The Small Giant Component in Scale-Free Random Graphs
From MaRDI portal
Recommendations
- The phase transition in the uniformly grown random graph has infinite order
- Slow emergence of the giant component in the growing m‐out graph
- Giant components in random graphs
- A simple branching process approach to the phase transition in \(G_{n,p}\)
- The Critical Phase for Random Graphs with a Given Degree Sequence
Cited in
(19)- Near critical preferential attachment networks have small giant components
- When is a scale-free graph ultra-small?
- A simple branching process approach to the phase transition in \(G_{n,p}\)
- Supercritical percolation on large scale-free random trees
- Epidemics on random intersection graphs
- Phase transitions on Markovian bipartite graphs-an application of the zero-range process
- Sparse random graphs with clustering
- Asymptotic equivalence and contiguity of some random graphs
- Large cliques in a power-law random graph
- Effect of scale on long-range random graphs and chromosomal inversions
- Renormalization-group theory of the abnormal singularities at the critical-order transition in bond percolation on pointed hierarchical graphs
- The phase transition in the uniformly grown random graph has infinite order
- Hitting times for Shamir's problem
- The phase transition in inhomogeneous random graphs
- Algorithms and Models for the Web-Graph
- Slow emergence of the giant component in the growing m‐out graph
- Thek-Core and Branching Processes
- The contact process on the complete graph with random vertex-dependent infection rates
- Neighbor selection and hitting probability in small-world graphs
This page was built for publication: The Small Giant Component in Scale-Free Random Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704398)
