Critical random graphs: Diameter and mixing time (Q941296): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:39, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Critical random graphs: Diameter and mixing time |
scientific article |
Statements
Critical random graphs: Diameter and mixing time (English)
0 references
4 September 2008
0 references
The mixing time of a random walk on a graph is defined as the waiting time \(t\) for closeness between the t-step transition probabilities and the stationary probabilities. For a random graph \(G(n,p)\), its largest connected component \(C\) and the mixing time of a random walk on \(C\) are investigated. The diameter of \(C\) and the mixing time are specified for \(p\) in the vicinity of \(1/n\). Generalizations to graphs with bounded degrees are also considered.
0 references
Random graph
0 references
Random walk
0 references
Mixing time
0 references
Connected component
0 references
Percolation
0 references
