A critical point for random graphs with a given degree sequence
From MaRDI portal
Publication:4697807
DOI10.1002/RSA.3240060204zbMATH Open0823.05050OpenAlexW2044881936WikidataQ56564362 ScholiaQ56564362MaRDI QIDQ4697807FDOQ4697807
Authors: Michael Molloy, Bruce Reed 
Publication date: 23 October 1995
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240060204
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weighted sums of certain dependent random variables
- Component behavior near the critical point of the random graph process
- The first cycles in an evolving graph
- The asymptotic number of labeled graphs with given degree sequences
- Title not available (Why is that?)
- Almost all cubic graphs are Hamiltonian
- Almost all graphs with 1.44n edges are 3-colorable
- The chromatic number of random graphs at the double-jump threshold
Cited In (only showing first 100 items - show all)
- Optimal resource diffusion for suppressing disease spreading in multiplex networks
- Spectral bounds in random graphs applied to spreading phenomena and percolation
- Directed cycles and related structures in random graphs. I: Static properties
- Random graphs with forbidden vertex degrees
- Distance evolutions in growing preferential attachment graphs
- Accuracy criterion for mean field approximations of Markov processes on hypergraphs
- Quantum contact process on scale-free networks
- Inhomogeneous percolation models for spreading phenomena in random graphs
- Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication
- A non-Markovian SIR network model with fixed infectious period and preventive rewiring
- Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs
- Null models and community detection in multi-layer networks
- Random Simplicial Complexes: Models and Phenomena
- Depth first exploration of a configuration model
- From ecology to finance (and back?): a review on entropy-based null models for the analysis of bipartite networks
- Sparse maximum-entropy random graphs with a given power-law degree distribution
- Modelling the spread of diseases in clustered networks
- Dynamics of an edge-based SEIR model for sexually transmitted diseases
- Analysis of SHIR rumor propagation in random heterogeneous networks with dynamic friendships
- Epidemic dynamics of influenza-like diseases spreading in complex networks
- A propagation model with defensive measures for PLC-PC worms in industrial networks
- Are crossing dependencies really scarce?
- A low-dimensional network model for an SIS epidemic: analysis of the super compact pairwise model
- Analytical results for the in-degree and out-degree distributions of directed random networks that grow by node duplication
- Average hopcount of the shortest path in tree-like components with finite size
- A novel measure of edge and vertex centrality for assessing robustness in complex networks
- Epistemic Communities: Description and Hierarchic Categorization
- Random walks between leaves of random networks
- SIR dynamics in random networks with communities
- Survival and extinction of epidemics on random graphs with general degree
- Geometry of the minimal spanning tree of a random 3-regular graph
- Critical window for the vacant set left by random walk on random regular graphs
- Algebraic bounds for heterogeneous site percolation on directed and undirected graphs
- The scaling of the minimum sum of edge lengths in uniformly random trees
- An Experimental Study of Algorithms for Online Bipartite Matching
- Critical percolation on scale-free random graphs: new universality class for the configuration model
- Observability transition in multiplex networks
- Overlapping modularity at the critical point of \(k\)-clique percolation
- Searchability of central nodes in networks
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- A functional central limit theorem for SI processes on configuration model graphs
- SIR epidemics and vaccination on random graphs with clustering
- Global lower mass-bound for critical configuration models in the heavy-tailed regime
- Metastability of the contact process on fast evolving scale-free networks
- Chase-escape on the configuration model
- Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory
- Moments of uniform random multigraphs with fixed degree sequences
- Component structure of the vacant set induced by a random walk on a random graph
- Effects of heterogeneous self-protection awareness on resource-epidemic coevolution dynamics
- Infectious diseases spreading on a metapopulation network coupled with its second-neighbor network
- Dynamics of diffusion on monoplex and multiplex networks: a message-passing approach
- Phases of small worlds: a mean field formulation
- Sandwiching dense random regular graphs between binomial random graphs
- The stripping process can be slow. II
- Persuasion in networks: public signals and cores
- Distance in random graphs with infinite mean degrees
- A scale-free graph model based on bipartite graphs
- On bounding exact models of epidemic spread on networks
- The structure of typical clusters in large sparse random configurations
- Percolation in invariant Poisson graphs with i.i.d. degrees
- Improving pairwise approximations for network models with susceptible-infected-susceptible dynamics
- Random graphs with a fixed maximum degree
- Universality for critical heavy-tailed network models: metric structure of maximal components
- Critical points for random Boolean networks
- Susceptibility of random graphs with given vertex degrees
- Component structure of the configuration model: barely supercritical case
- Optimal attack strategy of complex networks based on tabu search
- Critical window for the vacant set left by random walk on the configuration model
- Bipartite structure of all complex networks
- The Bohman-Frieze process near criticality
- Percolation on complex networks: theory and application
- Random degree -- degree correlated networks
- Configuring random graph models with fixed degree sequences
- Heavy-tailed configuration models at criticality
- Large deviations of empirical neighborhood distribution in sparse random graphs
- Principles of statistical mechanics of uncorrelated random networks
- An old approach to the giant component problem
- Dynamic vaccination game in a heterogeneous mixing population
- On the maximum betweenness improvement problem
- Sufficient conditions of endemic threshold on metapopulation networks
- Transmission dynamics of oral polio vaccine viruses and vaccine-derived polioviruses on networks
- A sequential algorithm for generating random graphs
- A general critical condition for the emergence of a giant component in random graphs with given degrees
- Integrating fluctuations into distribution of resources in transportation networks
- Parameterisation of Keeling's network generation algorithm
- Percolation on random graphs with a fixed degree sequence
- Bootstrapping on undirected binary networks via statistical mechanics
- A generalized voter model on complex networks
- EFFECTS OF DEGREE CORRELATION ON THE SYNCHRONIZATION OF NETWORKS OF OSCILLATORS
- Thresholds for virus spread on networks
- Unravelling the size distribution of social groups with information theory in complex networks
- OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
- Stochastic Kronecker graphs
- Information propagation in stochastic networks
- The Critical Phase for Random Graphs with a Given Degree Sequence
- The component sizes of a critical random graph with given degree sequence
- A testing based extraction algorithm for identifying significant communities in networks
- Jigsaw percolation: what social networks can collaboratively solve a puzzle?
- Number of cliques in random scale-free network ensembles
- Network comparison and the within-ensemble graph distance
This page was built for publication: A critical point for random graphs with a given degree sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697807)
