Clique percolation
From MaRDI portal
Publication:3055777
DOI10.1002/rsa.20270zbMath1205.60165arXiv0804.0867OpenAlexW3037115198MaRDI QIDQ3055777
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
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items
Inside the critical window for cohomology of random k -complexes ⋮ A threshold for the Maker-Breaker clique game ⋮ Square percolation and the threshold for quadratic divergence in random right‐angled Coxeter groups ⋮ Random geometric complexes ⋮ Thresholds for vanishing of `isolated' faces in random Čech and Vietoris-Rips complexes ⋮ Percolation on complex networks: theory and application ⋮ The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs ⋮ Locomotive assignment graph model for freight traffic on linear Section of railway. The problem of finding a maximal independent schedule coverage ⋮ Asymptotic normality of the size of the giant component in a random hypergraph
Cites Work
- 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
- Bisecting sparse random graphs
- The phase transition in inhomogeneous random graphs
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
