The Size of the Giant Component of a Random Graph with a Given Degree Sequence
From MaRDI portal
Publication:4228206
DOI10.1017/S0963548398003526zbMath0916.05064OpenAlexW2129918926WikidataQ60698851 ScholiaQ60698851MaRDI QIDQ4228206
Bruce A. Reed, Michael S. O. Molloy
Publication date: 19 July 1999
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548398003526
Related Items (only showing first 100 items - show all)
Not all interventions are equal for the height of the second peak ⋮ Mixing times of random walks on dynamic configuration models ⋮ Investigating the relationship between \(k\)-core and \(s\)-core network decompositions ⋮ SIR epidemics on random graphs with a fixed degree sequence ⋮ Exploring networks with traceroute-like probes: Theory and simulations ⋮ Rare event asymptotics for exploration processes for random graphs ⋮ Depth first exploration of a configuration model ⋮ The tail does not determine the size of the giant ⋮ Minimum vertex cover in generalized random graphs with power law degree distribution ⋮ On the number of circuits in random graphs ⋮ The scaling window for a random graph with a given degree sequence ⋮ Random graph models of social networks ⋮ Robustness of power-law networks: its assessment and optimization ⋮ Network security and contagion ⋮ Generating simple random graphs with prescribed degree distribution ⋮ Bipartite structure of all complex networks ⋮ Networks based on collisions among mobile agents ⋮ The structure of typical clusters in large sparse random configurations ⋮ Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory ⋮ Evolution of scale-free random graphs: Potts model formulation ⋮ Analytical connection between thresholds and immunization strategies of SIS model in random networks ⋮ Complex networks: structure and dynamics ⋮ Distance in random graphs with infinite mean degrees ⋮ Bootstrap percolation in living neural networks ⋮ When is a scale-free graph ultra-small? ⋮ Epidemics, disorder, and percolation ⋮ DYNAMICS OF ROUTING MECHANISMS ON TRAFFIC NETWORKS ⋮ SIR epidemics and vaccination on random graphs with clustering ⋮ Push is Fast on Sparse Random Graphs ⋮ Thresholds for virus spread on networks ⋮ Generation of arbitrary two-point correlated directed networks with given modularity ⋮ OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS ⋮ TOPOLOGICAL VULNERABILITY OF THE EUROPEAN POWER GRID UNDER ERRORS AND ATTACKS ⋮ Analytic results on the polymerisation random graph model ⋮ Cores of random \(r\)-partite hypergraphs ⋮ Respondent-driven sampling on directed networks ⋮ Random graphs with a given degree sequence ⋮ The degree-wise effect of a second step for a random walk on a graph ⋮ Culture and inattentional blindness: a global workspace perspective ⋮ Contact processes on scale-free networks ⋮ First passage percolation on random graphs with finite mean degrees ⋮ Toward formal models of biologically inspired, highly parallel machine cognition ⋮ The component sizes of a critical random graph with given degree sequence ⋮ A weighted configuration model and inhomogeneous epidemics ⋮ Asymptotic normality of the \(k\)-core in random graphs ⋮ SIR dynamics in random networks with heterogeneous connectivity ⋮ A Random Graph Model for Power Law Graphs ⋮ On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase ⋮ The largest component in a subcritical random graph with a power law degree distribution ⋮ Sampling on bipartite networks: a comparative analysis of eight crawling methods ⋮ Edge percolation on a random regular graph of low degree ⋮ Maximizing the Size of the Giant ⋮ Transport properties of random walks on scale-free/regular-lattice hybrid networks ⋮ Preferential attachment without vertex growth: emergence of the giant component ⋮ Critical random graphs and the differential equations technique ⋮ Component structure of the vacant set induced by a random walk on a random graph ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ Mean-field models for non-Markovian epidemics on networks ⋮ Continuum limit of critical inhomogeneous random graphs ⋮ Statistical physics of vaccination ⋮ Synchronization in random networks with given expected degree sequences ⋮ Percolation in invariant Poisson graphs with i.i.d. degrees ⋮ A non-Markovian SIR network model with fixed infectious period and preventive rewiring ⋮ The structure and function of networks ⋮ Critical points for random Boolean networks ⋮ The contact process on the complete graph with random vertex-dependent infection rates ⋮ COOPERATION IN THE PRISONER'S DILEMMA GAME IN RANDOM SCALE-FREE GRAPHS ⋮ Epidemics and vaccination on weighted graphs ⋮ Random graphs with forbidden vertex degrees ⋮ Giant Component in Random Multipartite Graphs with Given Degree Sequences ⋮ Percolation of interdependent network of networks ⋮ RESILIENCE TO CONTAGION IN FINANCIAL NETWORKS ⋮ Applications of the variance of final outbreak size for disease spreading in networks ⋮ A new approach to the giant component problem ⋮ Statistical mechanics of complex networks ⋮ Universality for distances in power-law random graphs ⋮ Extreme fluctuations in noisy task-completion landscapes on scale-free networks ⋮ Inhomogeneous percolation models for spreading phenomena in random graphs ⋮ Birds of a feather or opposites attract - effects in network modelling ⋮ Duality in inhomogeneous random graphs, and the cut metric ⋮ Large components in random induced subgraphs of \(n\)-cubes ⋮ A scale-free graph model based on bipartite graphs ⋮ A Theoretical Analysis of the Structure of HC-128 ⋮ RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING ⋮ Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees ⋮ Structural sparsity of complex networks: bounded expansion in random models and real-world graphs ⋮ Universality for random surfaces in unconstrained genus ⋮ Susceptible-infected epidemics on evolving graphs ⋮ On a random graph evolving by degrees ⋮ Phases of small worlds: a mean field formulation ⋮ Phase transitions on Markovian bipartite graphs-an application of the zero-range process ⋮ The Bohman-Frieze process near criticality ⋮ Modeling and analysis of new products diffusion on heterogeneous networks ⋮ Limit laws for self-loops and multiple edges in the configuration model ⋮ On the mean distance in scale free graphs ⋮ The diameter of weighted random graphs ⋮ The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees ⋮ Metric structure of random networks ⋮ An old approach to the giant component problem ⋮ Directed cycles and related structures in random graphs. I: Static properties
This page was built for publication: The Size of the Giant Component of a Random Graph with a Given Degree Sequence
