Core forging and local limit theorems for the \(k\)-core of random graphs

DOI10.1016/j.jctb.2018.12.005zbMath1440.05180arXiv1707.03556OpenAlexW2963605248MaRDI QIDQ2312608

Mihyun Kang, Kathrin Skubch, Oliver Cooley, Amin Coja-Oghlan

Publication date: 17 July 2019

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

central limit theoremlocal limit theorem\(k\)-coresparse random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Density (toughness, etc.) (05C42)

Related Items

Singularity of the \(k\)-core of a random graph, Generalized K-Core Percolation in Networks with Community Structure

Cites Work

• Unnamed Item
• How does the core sit inside the mantle?
• A new bijection on rooted forests
• On the robustness of random \(k\)-cores
• The set of solutions of random XORSAT formulae
• Asymptotic normality of the \(k\)-core in random graphs
• Finite size scaling for the core of large random hypergraphs
• Size and connectivity of the \(k\)-core of a random graph
• An elementary proof of the local central limit theorem
• Sudden emergence of a giant \(k\)-core in a random graph
• A simple solution to the k‐core problem
• Tight Thresholds for Cuckoo Hashing via XORSAT
• Orientability of Random Hypergraphs and the Power of Multiple Choices
• Information, Physics, and Computation
• Efficient erasure correcting codes
• Paths in graphs
• The solution space geometry of random linear equations
• Cores in random hypergraphs and Boolean formulas
• The Satisfiability Threshold fork-XORSAT
• The freezing threshold for k-colourings of a random graph
• Thek-Core and Branching Processes
• Poisson Cloning Model for Random Graphs
• On stirling numbers of the second kind