Loop statistics in complex networks

DOI10.1140/EPJB/E2008-00401-9MaRDI QIDQ977875zbMATH OpenOpenAlexFDO

Authors J. Martínez

Publication date 23 June 2010

Published in The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0707.0560

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Critical phenomena in equilibrium statistical mechanics (82B27)

Abstract: Complex networks display various types of percolation transitions. We show that the degree distribution and the degree-degree correlation alone are not sufficient to describe diverse percolation critical phenomena. This suggests that a genuine structural correlation is an essential ingredient in characterizing networks. As a signature of the correlation we investigate a scaling behavior in $M_N(h)$, the number of finite loops of size $h$, with respect to a network size $N$. We find that networks, whose degree distributions are not too broad, fall into two classes exhibiting $M_N(h)sim(constant)$ and $M_N(h)sim(lnN{)}^{p}si$, respectively. This classification coincides with the one according to the percolation critical phenomena.

Recommendations

• Statistcal mechanics of complex networks
• Statistical mechanics of complex networks
• Loops of any size and Hamilton cycles in random scale-free networks
• scientific article; zbMATH DE number 933355
• Characterizing complex networks through statistics of Möbius transformations
• Cycle statistics in complex networks and Ihara's Zeta function
• Statistical analysis of graph structures in random variable networks
• Graph-theoretic analysis of complex stochastic networks

Cited in

(6)

• Loops of any size and Hamilton cycles in random scale-free networks
• Characterizing complex networks through statistics of Möbius transformations
• The characteristics of cycle-nodes-ratio and its application to network classification
• Relationships between Perron-Frobenius eigenvalue and measurements of loops in networks
• Characterizing system dynamics with a weighted and directed network constructed from time series data
• Statistics of cycles: how loopy is your network?

This page was built for publication: Loop statistics in complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q977875)