Complex networks have been mostly characterized from the point of view of the degree distribution of their nodes and a few other motifs (or modules), with a special attention to triangles and cliques. The most exotic phenomena have been observed when the exponent γ of the associated power-law degree distribution is sufficiently small. In particular, a zero percolation threshold takes place for $\gamma<3$ , and an anomalous critical behavior sets in for $\gamma<5$ . In this letter we prove that in sparse scale-free networks characterized by a cut-off scaling with the sistem size N, relative fluctuations are actually never negligible: given a motif Γ, we analyze the relative fluctuations $R_{\Gamma}$ of the associated density of Γ, and we sh...
Analysis of degree-degree dependencies in complex networks, and their impact on processes on network...
In this paper, we study the critical behavior of percolation on a configuration model with degree di...
A general $(k,l)$ clique community of a network, which consists of adjacent k-cliques sharing at le...
We discuss critical behavior of percolation on finite random networks. In a seminal paper, Aldous (1...
Synchronization problems in complex networks are very often studied by researchers due to their many...
We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-...
We analyze critical phenomena on networks generated as the union of hidden variable models (networks...
In every network, a distance between a pair of nodes can be defined as the length of the shortest pa...
Multiple studies of neural avalanches across different data modalities led to the prominent hypothes...
Preferential attachment networks with power law exponent tau > 3 are known to exhibit a phase transi...
\u3cp\u3eFor scale-free networks with degrees following a power law with an exponent τ ∈ (2, 3), the...
We derive the finite-size dependence of the clustering coefficient of scale-free random graphs gener...
In this paper, we study the critical behavior of percolation on a configuration model with degree di...
Percolation is a fundamental concept that has brought new understanding of the robustness properties...
Analysis of degree-degree dependencies in complex networks, and their impact on processes on network...
In this paper, we study the critical behavior of percolation on a configuration model with degree di...
A general $(k,l)$ clique community of a network, which consists of adjacent k-cliques sharing at le...
We discuss critical behavior of percolation on finite random networks. In a seminal paper, Aldous (1...
Synchronization problems in complex networks are very often studied by researchers due to their many...
We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-...
We analyze critical phenomena on networks generated as the union of hidden variable models (networks...
In every network, a distance between a pair of nodes can be defined as the length of the shortest pa...
Multiple studies of neural avalanches across different data modalities led to the prominent hypothes...
Preferential attachment networks with power law exponent tau > 3 are known to exhibit a phase transi...
\u3cp\u3eFor scale-free networks with degrees following a power law with an exponent τ ∈ (2, 3), the...
We derive the finite-size dependence of the clustering coefficient of scale-free random graphs gener...
In this paper, we study the critical behavior of percolation on a configuration model with degree di...
Percolation is a fundamental concept that has brought new understanding of the robustness properties...
Analysis of degree-degree dependencies in complex networks, and their impact on processes on network...
In this paper, we study the critical behavior of percolation on a configuration model with degree di...
A general $(k,l)$ clique community of a network, which consists of adjacent k-cliques sharing at le...