A simple solution to the k‐core problem
From MaRDI portal
Publication:3419611
DOI10.1002/RSA.20147zbMath1113.05091arXivmath/0508453OpenAlexW2330524492MaRDI QIDQ3419611
Svante Janson, Malwina J. Luczak
Publication date: 7 February 2007
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0508453
Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Vertex degrees (05C07)
Related Items (37)
SIR epidemics on random graphs with a fixed degree sequence ⋮ How does the core sit inside the mantle? ⋮ Small cores in 3-uniform hypergraphs ⋮ Sets that are connected in two random graphs ⋮ Load Thresholds for Cuckoo Hashing with Overlapping Blocks ⋮ Singularity of the \(k\)-core of a random graph ⋮ Load Thresholds for Cuckoo Hashing with Overlapping Blocks ⋮ Successive minimum spanning trees ⋮ Persuasion in Networks: Public Signals and Cores ⋮ A central limit theorem for diffusion in sparse random graphs ⋮ On the threshold for \(k\)-regular subgraphs of random graphs ⋮ Dismantling Sparse Random Graphs ⋮ Diffusion and cascading behavior in random networks ⋮ Finding density-based subspace clusters in graphs with feature vectors ⋮ The cook-book approach to the differential equation method ⋮ Asymptotic normality of the \(k\)-core in random graphs ⋮ The Probability That a Random Multigraph is Simple ⋮ On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph ⋮ Preferential attachment without vertex growth: emergence of the giant component ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ Unnamed Item ⋮ The Stripping Process Can be Slow: Part II ⋮ Random graphs with forbidden vertex degrees ⋮ Thek-Core and Branching Processes ⋮ A new approach to the giant component problem ⋮ On the robustness of random \(k\)-cores ⋮ The coreness and H-index of random geometric graphs ⋮ Core forging and local limit theorems for the \(k\)-core of random graphs ⋮ The solution space geometry of random linear equations ⋮ Degree correlations in scale-free random graph models ⋮ A new approach to the orientation of random hypergraphs ⋮ On the Spread of Random Graphs ⋮ A general critical condition for the emergence of a giant component in random graphs with given degrees ⋮ 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
This page was built for publication: A simple solution to the k‐core problem
