Number of cliques in random scale-free network ensembles

DOI10.1016/j.physd.2006.09.013zbMath1130.94023arXivcond-mat/0606088OpenAlexW2110877664WikidataQ60575128 ScholiaQ60575128MaRDI QIDQ858491

Matteo Marsili, Ginestra Bianconi

Publication date: 9 January 2007

Published in: Physica D (Search for Journal in Brave)

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

zbMATH Keywords

complex networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of graph theory to circuits and networks (94C15)

Related Items (8)

Large communities in a scale-free network ⋮ On the distances within cliques in a soft random geometric graph ⋮ Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs ⋮ Counting cliques and cycles in scale-free inhomogeneous random graphs ⋮ Large cliques in sparse random intersection graphs ⋮ Cliques in rank-1 random graphs: the role of inhomogeneity ⋮ Large Cliques in a Power-Law Random Graph ⋮ Parameterized clique on inhomogeneous random graphs

Cites Work

• Unnamed Item
• Metric structure of random networks
• Statistical mechanics of complex networks
• Circuits in random graphs: from local trees to global loops
• A critical point for random graphs with a given degree sequence
• Loops of any size and Hamilton cycles in random scale-free networks

This page was built for publication: Number of cliques in random scale-free network ensembles