Loops of any size and Hamilton cycles in random scale-free networks

DOI10.1088/1742-5468/2005/06/P06005zbMath1459.82100arXivcond-mat/0502552OpenAlexW3099336586WikidataQ60575132 ScholiaQ60575132MaRDI QIDQ4968858

Ginestra Bianconi, Matteo Marsili

Publication date: 9 July 2019

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0502552

zbMATH Keywords

networksrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (7)

On the number of circuits in random graphs ⋮ Relationships between Perron-Frobenius eigenvalue and measurements of loops in networks ⋮ Number of cliques in random scale-free network ensembles ⋮ Spin Glass approach to the feedback vertex set problem ⋮ Counting cliques and cycles in scale-free inhomogeneous random graphs ⋮ Ising spin glass models versus Ising models: an effective mapping at high temperature: I. General result ⋮ Ising spin glass models versus Ising models: an effective mapping at high temperature: II. Applications to graphs and networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Statistical mechanics of complex networks
• Circuits in random graphs: from local trees to global loops
• Statistics of cycles: how loopy is your network?
• A critical point for random graphs with a given degree sequence
• Potts model on random trees
• Finding All the Elementary Circuits of a Directed Graph

This page was built for publication: Loops of any size and Hamilton cycles in random scale-free networks