3.2k citations · 4.8k across the 18 of their papers we have counts for
18 papers
Weak percolation on multiplex networks with overlapping edges
G. J. Baxter, R. A. da Costa, S. N. Dorogovtsev +1
We solve the weak percolation problem for multiplex networks with overlapping edges. In weak percolation, a vertex belongs to a connected component if at least one of its neighbors…
Enhanced robustness of single-layer networks with redundant dependencies
Gábor Timár, György Kovács, José Fernando F. Mendes
Dependency links in single-layer networks offer a convenient way of modeling nonlocal percolation effects in networked systems where certain pairs of nodes are only able to functio…
Exotic Critical Behavior of Weak Multiplex Percolation
G. J. Baxter, R. A. da Costa, S. N. Dorogovtsev +1
We describe the critical behavior of weak multiplex percolation, a generalization of percolation to multiplex or interdependent networks. A node can determine its active or inactiv…
Choosing among alternative histories of a tree
Gábor Timár, Rui A. da Costa, Sergey N. Dorogovtsev +1
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 fa…
A unified approach to percolation processes on multiplex networks
G. J. Baxter, D. Cellai, S. N. Dorogovtsev +2
Many real complex systems cannot be represented by a single network, but due to multiple sub-systems and types of interactions, must be represented as a multiplex network. This is…
Scale-free networks with exponent one
Gábor Timár, Sergey N. Dorogovtsev, José Fernando F. Mendes
A majority of studied models for scale-free networks have degree distributions with exponents greater than . Real networks, however, can demonstrate essentially more heavy-taile…