Some inequalities for reversible Markov chains and branching random walks via spectral optimization (Q2157453)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some inequalities for reversible Markov chains and branching random walks via spectral optimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some inequalities for reversible Markov chains and branching random walks via spectral optimization |
scientific article |
Statements
Some inequalities for reversible Markov chains and branching random walks via spectral optimization (English)
0 references
22 July 2022
0 references
branching random walk
0 references
coalescing random walk
0 references
hitting times
0 references
intersection times
0 references
mixing times
0 references
spectral optimization
0 references
spectral-gap
0 references
vertex-transitive graphs
0 references
0 references
0 references
0.7729979157447815
0 references
0.7489562630653381
0 references
0.7414015531539917
0 references
0.7404085397720337
0 references
0.7355229258537292
0 references
