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
- Critical window for connectivity in the configuration model
- Central limit theorems for SIR epidemics and percolation on configuration model random graphs
- Epidemics in a population with social structures
- 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
- Exactly scale-free scale-free networks
- 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
- Susceptible-infected epidemics on evolving graphs
- 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
- 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
- Moment closure of infectious diseases model on heterogeneous metapopulation network
- Epidemics on networks with preventive rewiring
- Contact processes on scale-free networks
- Discrete-time epidemic dynamics with awareness in random networks
- Almost all graphs with average degree 4 are 3-colorable
- Random graphs with a given degree sequence
- Structural transition in random mappings
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- Heterogeneous network epidemics: real-time growth, variance and extinction of infection
- Hypercube percolation
- Mean-field models for non-Markovian epidemics on networks
- Jamming in complex networks with degree correlation
- Generation of arbitrary two-point correlated directed networks with given modularity
- Resolvent of large random graphs
- Karp-Sipser on random graphs with a fixed degree sequence
- \(k\)-core architecture and \(k\)-core percolation on complex networks
- Generating simple random graphs with prescribed degree distribution
- Metric structure of random networks
- SIR epidemics on random graphs with a fixed degree sequence
- Real-time growth rate for general stochastic SIR epidemics on unclustered networks
- COMPLEX NETWORKS: TOPOLOGY, DYNAMICS AND SYNCHRONIZATION
- SIR dynamics in random networks with heterogeneous connectivity
- Complex networks: structure and dynamics
- Analysis of a stochastic SIR epidemic on a random network incorporating household structure
- The effects of spatial constraints on the evolution of weighted complex networks
- Diffusion and cascading behavior in random networks
- Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
- Asymptotic normality in random graphs with given vertex degrees
- Synchronization in weighted scale-free networks with degree-degree correlation
- Cores of random \(r\)-partite hypergraphs
- Faster mixing and small bottlenecks
- Epidemics on a weighted network with tunable degree-degree correlation
- Limit theorems for a random graph epidemic model
- Asymptotics of trees with a prescribed degree sequence and applications
- SYNCHRONIZABILITY AND SYNCHRONIZATION DYNAMICS OF WEIGHED AND UNWEIGHED SCALE FREE NETWORKS WITH DEGREE MIXING
- Minimum vertex cover in generalized random graphs with power law degree distribution
- Trapping of continuous-time quantum walks on Erdős-Rényi graphs
- The scaling window for a random graph with a given degree sequence
- A weighted configuration model and inhomogeneous epidemics
- Optimal link removal for epidemic mitigation: A two-way partitioning approach
- Ordering in voter models on networks: exact reduction to a single-coordinate diffusion
- Asymptotic normality of the \(k\)-core in random graphs
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)
