Clique percolation

DOI10.1002/rsa.20270zbMath1205.60165arXiv0804.0867MaRDI QIDQ3055777

Béla Bollobás, Oliver Riordan

Publication date: 9 November 2010

Published in: Random Structures and Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

percolation; branching process; clique; random graph

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

60K35: Interacting random processes; statistical mechanics type models; percolation theory

Related Items

Random geometric complexes, Locomotive assignment graph model for freight traffic on linear Section of railway. The problem of finding a maximal independent schedule coverage, A threshold for the Maker-Breaker clique game, Asymptotic normality of the size of the giant component in a random hypergraph, Inside the critical window for cohomology of random k -complexes

Cites Work

• Unnamed Item
• Unnamed Item
• Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
• Largest random component of a k-cube
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• The critical point of \(k\)-clique percolation in the Erdős-Rényi graph
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• The Evolution of Random Subgraphs of the Cube
• Sharp thresholds of graph properties, and the $k$-sat problem
• The phase transition in inhomogeneous random graphs
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition