Comparing mixing times on sparse random graphs (Q2320396)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7097344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing mixing times on sparse random graphs |
scientific article; zbMATH DE number 7097344 |
Statements
Comparing mixing times on sparse random graphs (English)
0 references
22 August 2019
0 references
random graphs
0 references
random walks
0 references
nonbacktracking vs. simple random walk
0 references
mixing times of Markov chains
0 references
0.9989598393440248
0 references
0.8454031944274902
0 references
0.8437817096710205
0 references
0.8410400152206421
0 references
0.8252974152565002
0 references
