Asymptotic normality of the \(k\)-core in random graphs

DOI10.1214/07-AAP478zbMath1157.05047arXivmath/0612827MaRDI QIDQ930680

Malwina J. Luczak, Svante Janson

Publication date: 1 July 2008

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

random graphscentral limit theoremballs and binscores

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items

SIR epidemics on random graphs with a fixed degree sequence, Singularity of the \(k\)-core of a random graph, A central limit theorem for diffusion in sparse random graphs, Generalized K-Core Percolation in Networks with Community Structure, Random graphs with given vertex degrees and switchings, Fast algorithms for determining (generalized) core groups in social networks, Asymptotic normality in random graphs with given vertex degrees, Phase transitions in graphs on orientable surfaces, Central limit theorems in the configuration model, Monotonicity, asymptotic normality and vertex degrees in random graphs, Birth of a giant \((k_{1},k_{2})\)-core in the random digraph, Central limit theorem for statistics of subcritical configuration models, A new approach to the giant component problem, On the robustness of random \(k\)-cores, Susceptibility in subcritical random graphs, Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis, Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs, Core forging and local limit theorems for the \(k\)-core of random graphs, Component structure of the configuration model: Barely supercritical case, The probability that a random multigraph is simple. II, Loose cores and cycles in random hypergraphs, Law of large numbers for the SIR epidemic on a random graph with given degrees, The diameter of weighted random graphs, Cores of random graphs are born Hamiltonian

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encores on cores
• Size and connectivity of the \(k\)-core of a random graph
• A central limit theorem for decomposable random variables with applications to random graphs
• Structure of large random hypergraphs
• Sudden emergence of a giant \(k\)-core in a random graph
• Monotonicity, asymptotic normality and vertex degrees in random graphs
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• A simple solution to the k‐core problem
• A functional limit theorem for random graphs with applications to subgraph count statistics
• On tree census and the giant component in sparse random graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Orthogonal decompositions and functional limit theorems for random graph statistics
• Probability: A Graduate Course
• A critical point for random graphs with a given degree sequence
• Cores in random hypergraphs and Boolean formulas
• On a Random Graph Related to Quantum Theory
• Poisson Cloning Model for Random Graphs