Thek-Core and Branching Processes

DOI10.1017/S0963548307008589zbMath1136.05071arXivmath/0511093MaRDI QIDQ5448993

Oliver Riordan

Publication date: 10 March 2008

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

power-law; scale-free graph; Galton-Watson branching process; Random graph

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C80: Random graphs (graph-theoretic aspects)

60J80: Branching processes (Galton-Watson, birth-and-death, etc.)

05C07: Vertex degrees

Related Items

Random Simplicial Complexes: Around the Phase Transition, Phase transitions in graphs on orientable surfaces, The Stripping Process Can be Slow: Part II, Continuous phase transitions on Galton–Watson trees, Singularity of the \(k\)-core of a random graph, Propagation of chaos of forward-backward stochastic differential equations with graphon interactions, How does the core sit inside the mantle?, The cook-book approach to the differential equation method, Birth of a giant \((k_{1},k_{2})\)-core in the random digraph, Survival probabilities for \(N\)-ary subtrees on a Galton-Watson family tree, On the robustness of random \(k\)-cores, Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT, Loose cores and cycles in random hypergraphs, Core forging and local limit theorems for the \(k\)-core of random graphs, An old approach to the giant component problem, The structure of typical clusters in large sparse random configurations, A central limit theorem for diffusion in sparse random graphs, Cores of random graphs are born Hamiltonian, Random graphs with forbidden vertex degrees

Cites Work

• Sudden emergence of a giant \(k\)-core in a random graph
• A Random Graph Model for Power Law Graphs
• Emergence of Scaling in Random Networks
• A simple solution to the k‐core problem
• The phase transition in the uniformly grown random graph has infinite order
• The phase transition in inhomogeneous random graphs
• Cores in random hypergraphs and Boolean formulas
• Families of Non-disjoint subsets
• The Small Giant Component in Scale-Free Random Graphs