Percolation in simple directed random graphs with a given degree distribution
From MaRDI portal
Cites work
- A critical point for random graphs with a given degree sequence
- Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
- Birth of a strongly connected giant in an inhomogeneous random digraph
- Bootstrap percolation and diffusion in random graphs with given vertex degrees
- Directed random graphs with given degree distributions
- Giant components in three-parameter random directed graphs
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 741240 (Why is no real title available?)
- On percolation in random graphs with given vertex degrees
- On the largest component of the critical random digraph
- Percolation
- Percolation on dense graph sequences
- Random graph dynamics
- The critical behavior of random digraphs
- The diameter of the directed configuration model
- The giant component of the directed configuration model revisited
- The scaling limit of a critical random directed graph
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
- The strong giant in a random digraph
This page was built for publication: Percolation in simple directed random graphs with a given degree distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965261)