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)
- Degree distribution dynamics for disease spreading with individual awareness
- Loops of any size and Hamilton cycles in random scale-free networks
- Analytical results for the distribution of first hitting times of random walks on random regular graphs
- Rejection sampling of bipartite graphs with given degree sequence
- A stochastic SIR network epidemic model with preventive dropping of edges
- Unstable diffusion in social networks
- A system of grabbing particles related to Galton-Watson trees
- Interplay between epidemic spread and information propagation on metapopulation networks
- Transport between multiple users in complex networks
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- Modeling and analysis of new products diffusion on heterogeneous networks
- Investigating the relationship between \(k\)-core and \(s\)-core network decompositions
- Cost effective campaigning in social networks
- Anomalous electrical and frictionless flow conductance in complex networks
- On algebraic connectivity of directed scale-free networks
- Central limit theorems for SIR epidemics and percolation on configuration model random graphs
- Limit laws for self-loops and multiple edges in the configuration model
- The tail does not determine the size of the giant
- Diffusion in Random Networks: Impact of Degree Distribution
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
- Dismantling Sparse Random Graphs
- Bipartite and directed scale-free complex networks arising from zeta functions
- Underestimated cost of targeted attacks on complex networks
- Rumor spreading of an SIHR model in heterogeneous networks based on probability generating function
- Cooperative assembly systems
- Title not available (Why is that?)
- Using the bootstrap for statistical inference on random graphs
- Systemic risk in multiplex networks with asymmetric coupling and threshold feedback
- Degree distribution of shortest path trees and bias of network sampling algorithms
- Some remarks about extreme degrees in a random graph
- Firm-to-firm labor flows and the aggregate matching function: a network-based test using employer-employee matched records
- When is a scale-free graph ultra-small?
- Effect of link oriented self-healing on resilience of networks
- Ensemble nonequivalence in random graphs with modular structure
- THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS
- Systemic risk in banking networks: advantages of ``tiered banking systems
- Unbiased sampling of network ensembles
- Catastrophic event phenomena in communication networks: a survey
- The distribution of first hitting times of random walks on directed Erdős–Rényi networks
- Time-varying human mobility patterns with metapopulation epidemic dynamics
- Qualitative analysis on differential, fractional differential, and dynamic equations and related topics
- Binary decision making with very heterogeneous influence
- Percolation of arbitrary uncorrelated nested subgraphs
- The evolution of the min-min random graph process
- The solution space geometry of random linear equations
- A functional central limit theorem for SI processes on configuration model graphs
- Switcher-random-walks: a cognitive-inspired mechanism for network exploration
- Culture and inattentional blindness: a global workspace perspective
- Respondent-driven sampling on directed networks
- Central limit theorems in the configuration model
- Synchronization of Network-Coupled Oscillators with Uncertain Dynamics
- Analytical results for the distribution of first-passage times of random walks on random regular graphs
- Evolution of random graph processes with degree constraints
- Nonuniversality of weighted random graphs with infinite variance degree
- Critical value asymptotics for the contact process on random graphs
- Critical Window for Connectivity in the Configuration Model
- Moment closure of infectious diseases model on heterogeneous metapopulation network
- 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
- Phase transition of random non-uniform hypergraphs
- 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
- Moments of Uniform Random Multigraphs with Fixed Degree Sequences
- 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 Stripping Process Can be Slow: Part II
- 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
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)
