A critical point for random graphs with a given degree sequence
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3906527 (Why is no real title available?)
- scientific article; zbMATH DE number 747040 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- Almost all cubic graphs are Hamiltonian
- Almost all graphs with 1.44n edges are 3-colorable
- Component behavior near the critical point of the random graph process
- The asymptotic number of labeled graphs with given degree sequences
- The chromatic number of random graphs at the double-jump threshold
- The first cycles in an evolving graph
- Weighted sums of certain dependent random variables
Cited in
(only showing first 100 items - show all)- Prisoner's dilemma on directed networks
- Phase transitions on Markovian bipartite graphs-an application of the zero-range process
- Distance in random graphs with infinite mean degrees
- Epidemics on networks with preventive rewiring
- Controlling epidemic outbreak based on local dynamic infectiousness on complex networks
- A scale-free graph model based on bipartite graphs
- An integrative dynamical perspective for graph theory and the analysis of complex networks
- Contact processes on scale-free networks
- Optimal resource diffusion for suppressing disease spreading in multiplex networks
- On bounding exact models of epidemic spread on networks
- Degree distribution dynamics for disease spreading with individual awareness
- Percolation in invariant Poisson graphs with i.i.d. degrees
- Infinite and Giant Components in the Layers Percolation Model
- Persuasion in networks: public signals and cores
- The structure of typical clusters in large sparse random configurations
- Erosion of synchronization: coupling heterogeneity and network structure
- Improving pairwise approximations for network models with susceptible-infected-susceptible dynamics
- Statistical Network Analysis: A Review with Applications to the Coronavirus Disease 2019 Pandemic
- Loops of any size and Hamilton cycles in random scale-free networks
- Directed cycles and related structures in random graphs. I: Static properties
- An ensemble of random graphs with identical degree distribution
- The degree-wise effect of a second step for a random walk on a graph
- Random graphs with forbidden vertex degrees
- Analytical results for the distribution of first hitting times of random walks on random regular graphs
- Percolation in simple directed random graphs with a given degree distribution
- Spectral bounds in random graphs applied to spreading phenomena and percolation
- Basic reproduction number for the SIR epidemic in degree correlated networks
- Discrete-time epidemic dynamics with awareness in random networks
- Random graphs with a fixed maximum degree
- Structural transition in random mappings
- Random graphs with a given degree sequence
- Almost all graphs with average degree 4 are 3-colorable
- Component games on random graphs
- The critical Karp-Sipser core of random graphs
- Distance evolutions in growing preferential attachment graphs
- Critical points for random Boolean networks
- Universality for critical heavy-tailed network models: metric structure of maximal components
- Accuracy criterion for mean field approximations of Markov processes on hypergraphs
- Quantum contact process on scale-free networks
- New approximations for network reliability
- Heterogeneous network epidemics: real-time growth, variance and extinction of infection
- Hypercube percolation
- A note on the warmth of random graphs with given expected degrees
- Susceptibility of random graphs with given vertex degrees
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- Inhomogeneous percolation models for spreading phenomena in random graphs
- Phase transition in random intersection graphs with communities
- First-Order Model-Checking in Random Graphs and Complex Networks
- Mean-field models for non-Markovian epidemics on networks
- Rejection sampling of bipartite graphs with given degree sequence
- Convergence of the height process of supercritical Galton-Watson forests with an application to the configuration model in the critical window
- A stochastic SIR network epidemic model with preventive dropping of edges
- Jamming in complex networks with degree correlation
- Generation of arbitrary two-point correlated directed networks with given modularity
- 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
- Optimal attack strategy of complex networks based on tabu search
- Transport between multiple users in complex networks
- Some Bounds for the Vertex Degree Function Index of Connected Graphs with Given Minimum and Maximum Degrees
- Collective excitability in highly diluted random networks of oscillators
- Interplay between epidemic spread and information propagation on metapopulation networks
- A system of grabbing particles related to Galton-Watson trees
- Bipartite structure of all complex networks
- Rumor transmission in online social networks under Nash equilibrium of a psychological decision game
- Large induced subgraphs of random graphs with given degree sequences
- Component structure of the configuration model: barely supercritical case
- Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication
- Unstable diffusion in social networks
- Resolvent of large random graphs
- \(k\)-core architecture and \(k\)-core percolation on complex networks
- Generating simple random graphs with prescribed degree distribution
- Karp-Sipser on random graphs with a fixed degree sequence
- Critical window for the vacant set left by random walk on the configuration model
- Structural characterization of networks using the cat cortex as an example
- 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
- Real-time growth rate for general stochastic SIR epidemics on unclustered networks
- Investigating the relationship between k-core and s-core network decompositions
- Cost effective campaigning in social networks
- Modeling and analysis of new products diffusion on heterogeneous networks
- Percolating critical window for correlated scale-free networks
- Graph Embedding through Random Walk for Shortest Paths Problems
- SIR epidemics on random graphs with a fixed degree sequence
- The Bohman-Frieze process near criticality
- SIR dynamics in random networks with heterogeneous connectivity
- Percolation on complex networks: theory and application
- Analysis of a stochastic SIR epidemic on a random network incorporating household structure
- Diffusion and cascading behavior in random networks
- Complex networks: structure and dynamics
- Null models and community detection in multi-layer networks
- COMPLEX NETWORKS: TOPOLOGY, DYNAMICS AND SYNCHRONIZATION
- Random degree -- degree correlated networks
- Anomalous electrical and frictionless flow conductance in complex networks
- scientific article; zbMATH DE number 7731163 (Why is no real title available?)
- The effects of spatial constraints on the evolution of weighted complex networks
- Heavy-tailed configuration models at criticality
- The effects of evolutionary adaptations on spreading processes in complex networks
- On algebraic connectivity of directed scale-free networks
- Configuring random graph models with fixed degree sequences
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)
