The critical point of \(k\)-clique percolation in the Erdős-Rényi graph

DOI10.1007/s10955-006-9184-xzbMath1118.82024arXivcond-mat/0610298OpenAlexW2096504267MaRDI QIDQ2641391

Gergely Palla, Tamás Vicsek, Imre Derényi

Publication date: 20 August 2007

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

networkpercolationrandom graphcommunity

Mathematics Subject Classification ID

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

Related Items

Catastrophic event phenomena in communication networks: a survey ⋮ Overlapping modularity at the critical point of \(k\)-clique percolation ⋮ Triangle percolation in mean field random graphs-with PDE ⋮ InfoSearch: A Social Search Engine ⋮ Thresholds for vanishing of `isolated' faces in random Čech and Vietoris-Rips complexes ⋮ The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs ⋮ Clique percolation ⋮ Random intersection graphs with communities

Cites Work

• Unnamed Item
• Unnamed Item
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Community structure in social and biological networks
• Paths in graphs
• Collective dynamics of ‘small-world’ networks