Sudden emergence of a giant \(k\)-core in a random graph
From MaRDI portal
Publication:1924140
DOI10.1006/jctb.1996.0036zbMath0860.05065OpenAlexW2065663455WikidataQ106185259 ScholiaQ106185259MaRDI QIDQ1924140
Nicholas C. Wormald, J. H. Spencer, Boris G. Pittel
Publication date: 14 October 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.0036
Related Items
Bins and balls: Large deviations of the empirical occupancy process, The unassigned distance geometry problem, Continuous phase transitions on Galton–Watson trees, (k+1)-Cores Have k-Factors, On the number of circuits in random graphs, How does the core sit inside the mantle?, A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs, \(k\)-core architecture and \(k\)-core percolation on complex networks, Scaling and Inverse Scaling in Anisotropic Bootstrap Percolation, Sandwiching a densest subgraph by consecutive cores, Small cores in 3-uniform hypergraphs, Sets that are connected in two random graphs, Complete subgraphs in connected graphs and its application to spectral moment, Jamming percolation and glassy dynamics, The maximum number of cliques in graphs without long cycles, Perfect hashing, A note on long cycles in sparse random graphs, Singularity of the \(k\)-core of a random graph, Successive minimum spanning trees, A probabilistic analysis of randomly generated binary constraint satisfaction problems., Analysis of edge deletion processes on faulty random regular graphs., Bootstrap percolation and the geometry of complex networks, Sharp threshold for rigidity of random graphs, A central limit theorem for diffusion in sparse random graphs, On the threshold for \(k\)-regular subgraphs of random graphs, Phase transition of degeneracy in minor-closed families, Orientability Thresholds for Random Hypergraphs, On the dynamics of the glass transition on Bethe lattices, The Satisfiability Threshold fork-XORSAT, Threshold saturation in spatially coupled constraint satisfaction problems, Cores of random \(r\)-partite hypergraphs, Phase transitions in graphs on orientable surfaces, The cook-book approach to the differential equation method, On the study of jamming percolation, Asymptotic normality of the \(k\)-core in random graphs, A Spatial Web Graph Model with Local Influence Regions, The size of the giant joint component in a binomial random double graph, Perfect matchings and Hamiltonian cycles in the preferential attachment model, Percolation on complex networks: theory and application, Dynamics of random graphs with bounded degrees, Generalizedk-core pruning process on directed networks, Edge percolation on a random regular graph of low degree, On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph, \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph, Randomized allocation processes, Birth of a giant \((k_{1},k_{2})\)-core in the random digraph, Recent advances in percolation theory and its applications, Explosive transitions in complex networks' structure and dynamics: percolation and synchronization, Finite size scaling for the core of large random hypergraphs, A new class of cellular automata with a discontinuous glass transition, The Firstk-Regular Subgraph is Large, Conflict-Free Colouring of Graphs, Connectivity threshold and recovery time in rank-based models for complex networks, The Stripping Process Can be Slow: Part II, Random regular graphs with edge faults: Expansion through cores, Gibbs measures and phase transitions on sparse random graphs, Random graphs with forbidden vertex degrees, The characteristics of cycle-nodes-ratio and its application to network classification, Hamiltonicity thresholds in Achlioptas processes, Cutoff for random walk on dynamical Erdős-Rényi graph, Homomorphism complexes and \(k\)-cores, Scale‐free graphs of increasing degree, Constructing an asymptotic phase transition in random binary constraint satisfaction problems, The threshold for d-collapsibility in random complexes*, Thek-Core and Branching Processes, Almost all graphs with average degree 4 are 3-colorable, Survival probabilities for \(N\)-ary subtrees on a Galton-Watson family tree, Minimal attractors in digraph system models of neuronal networks, On the robustness of random \(k\)-cores, The set of solutions of random XORSAT formulae, Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs, On the \(k\)-orientability of random graphs, Pruning processes and a new characterization of convex geometries, A note on coloring sparse random graphs, Core forging and local limit theorems for the \(k\)-core of random graphs, Optimal Controlled Nodes Selection for Fast Consensus, The solution space geometry of random linear equations, Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT, Density decompositions of networks, Coloring Random Graphs, The planted matching problem: phase transitions and exact results, The property of having a k -regular subgraph has a sharp threshold, Protean graphs with a variety of ranking schemes, Protean Graphs with a Variety of Ranking Schemes, Loose cores and cycles in random hypergraphs, Hamiltonicity in random graphs is born resilient, Percolation in dense storage arrays, A novel giant-subgraph phase-transition in sparse random \(k\)-partite graphs, Cores of random graphs are born Hamiltonian, Asymptotic enumeration of sparse graphs with a minimum degree constraint
