Pages that link to "Item:Q984454"
From MaRDI portal
The following pages link to Cutoff phenomena for random walks on random regular graphs (Q984454):
Displaying 46 items.
- Cutoff on all Ramanujan graphs (Q343522) (← links)
- Cutoff phenomenon for random walks on Kneser graphs (Q403570) (← links)
- Spectra of lifted Ramanujan graphs (Q555601) (← links)
- Deterministic walks with choice (Q741725) (← links)
- Mixing times of random walks on dynamic configuration models (Q1617116) (← links)
- The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill (Q1700404) (← links)
- Cutoff at the ``entropic time'' for sparse Markov chains (Q1729696) (← links)
- Random walks on the random graph (Q1747756) (← links)
- Simple random walk on long range percolation clusters. I: Heat kernel bounds (Q1934367) (← links)
- Cutoff for the Ising model on the lattice (Q1943673) (← links)
- Giant vacant component left by a random walk in a random \(d\)-regular graph (Q1944664) (← links)
- Some spectral properties of the non-backtracking matrix of a graph (Q2020643) (← links)
- Level-set percolation of the Gaussian free field on regular graphs II: finite expanders (Q2024517) (← links)
- Mixing time trichotomy in regenerating dynamic digraphs (Q2029801) (← links)
- The spectral gap of sparse random digraphs (Q2041813) (← links)
- Correction to: ``Speeding up Markov chains with deterministic jumps'' (Q2052703) (← links)
- Linking the mixing times of random walks on static and dynamic random graphs (Q2080276) (← links)
- A phase transition for repeated averages (Q2119205) (← links)
- Universality of cutoff for graphs with an added random matching (Q2119210) (← links)
- Cutoff for random lifts of weighted graphs (Q2119212) (← links)
- Complex networks: structure and functionality (Q2119911) (← links)
- No cutoff in spherically symmetric trees (Q2137746) (← links)
- Cutoff on Ramanujan complexes and classical groups (Q2165717) (← links)
- Cut-off phenomenon for Ornstein-Uhlenbeck processes driven by Lévy processes (Q2184573) (← links)
- Speeding up Markov chains with deterministic jumps (Q2210752) (← links)
- Random walks on Ramanujan complexes and digraphs (Q2216740) (← links)
- Survival and extinction of epidemics on random graphs with general degree (Q2227715) (← links)
- Comparing mixing times on sparse random graphs (Q2320396) (← links)
- Random walk on sparse random digraphs (Q2413249) (← links)
- Local Kesten-McKay law for random regular graphs (Q2422489) (← links)
- A threshold for cutoff in two-community random graphs (Q2657925) (← links)
- Cutoff for permuted Markov chains (Q2686612) (← links)
- Information percolation and cutoff for the stochastic Ising model (Q2802070) (← links)
- Random doubly stochastic tridiagonal matrices (Q2841678) (← links)
- Contact process on a graph with communities (Q2954467) (← links)
- The degree-wise effect of a second step for a random walk on a graph (Q4611281) (← links)
- Critical value asymptotics for the contact process on random graphs (Q5082394) (← links)
- Cutoff for General Spin Systems with Arbitrary Boundary Conditions (Q5418796) (← links)
- Mixing time of PageRank surfers on sparse random digraphs (Q6074663) (← links)
- Speeding up random walk mixing by starting from a uniform vertex (Q6126961) (← links)
- Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022 (Q6133177) (← links)
- Scale-free percolation mixing time (Q6145597) (← links)
- Cutoff profile of the metropolis biased card shuffling (Q6151954) (← links)
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs (Q6157383) (← links)
- Rankings in directed configuration models with heavy tailed in-degrees (Q6180388) (← links)
- Simple versus nonsimple loops on random regular graphs (Q6199381) (← links)
