Zobrazeno 1 - 10
of 85
pro vyhledávání: '"Dorogovtsev, Sergey N."'
Publikováno v:
Phys. Rev. E 109, 014307 (2024)
Hypergraphs are higher-order networks that capture the interactions between two or more nodes. Hypergraphs can always be represented by factor graphs, i.e. bipartite networks between nodes and factor nodes (representing groups of nodes). Despite this
Externí odkaz:
http://arxiv.org/abs/2307.15346
Publikováno v:
Phys. Rev. E 109, 014306 (2024)
Hypergraphs capture the higher-order interactions in complex systems and always admit a factor graph representation, consisting of a bipartite network of nodes and hyperedges. As hypegraphs are ubiquitous, investigating hypergraph robustness is a pro
Externí odkaz:
http://arxiv.org/abs/2305.12297
Publikováno v:
Phys. Rev. E 102, 032304 (2020)
The structure of an evolving network contains information about its past. Extracting this information efficiently, however, is, in general, a difficult challenge. We formulate a fast and efficient method to estimate the most likely history of growing
Externí odkaz:
http://arxiv.org/abs/2003.04378
Simplicial complexes are increasingly used to study complex system structure and dynamics including diffusion, synchronization and epidemic spreading. The spectral dimension of the graph Laplacian is known to determine the diffusion properties at lon
Externí odkaz:
http://arxiv.org/abs/1910.12566
Autor:
da Silva, Diamantino C., Bianconi, Ginestra, da Costa, Rui A., Dorogovtsev, Sergey N., Mendes, José F. F.
Publikováno v:
Phys. Rev. E 97, 032316 (2018)
We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by the condi
Externí odkaz:
http://arxiv.org/abs/1708.02231
Publikováno v:
Phys. Rev. E 95, 042322 (2017)
Message passing equations yield a sharp percolation transition in finite graphs, as an artifact of the locally treelike approximation. For an arbitrary finite, connected, undirected graph we construct an infinite tree having the same local structural
Externí odkaz:
http://arxiv.org/abs/1702.05380
Publikováno v:
Phys. Rev. E 94, 062308 (2016)
In multiplex networks, cycles cannot be characterized only by their length, as edges may occur in different layers in different combinations. We define a classification of cycles by the number of edges in each layer and the number of switches between
Externí odkaz:
http://arxiv.org/abs/1609.05788
Publikováno v:
Phys. Rev. E 94, 022302 (2016)
A majority of studied models for scale-free networks have degree distributions with exponents greater than $2$. Real networks, however, can demonstrate essentially more heavy-tailed degree distributions. We explore two models of scale-free equilibriu
Externí odkaz:
http://arxiv.org/abs/1606.04973
Publikováno v:
Phys. Rev. E 94, 032301 (2016)
Multiplex networks describe a large variety of complex systems including infrastructures, transportation networks and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to character
Externí odkaz:
http://arxiv.org/abs/1604.05175