The following pages link to Jonathan Hermon (Q303558):
Displayed 44 items.
- Total variation and separation cutoffs are not equivalent and neither one implies the other (Q303559) (← links)
- On sensitivity of uniform mixing times (Q1635969) (← links)
- The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill (Q1700404) (← links)
- Frogs on trees? (Q1748920) (← links)
- On sensitivity of mixing times and cutoff (Q1748929) (← links)
- Characterization of cutoff for reversible Markov chains (Q2012242) (← links)
- Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution (Q2030393) (← links)
- Mean field behavior during the big bang regime for coalescing random walks (Q2085541) (← links)
- Universality of cutoff for graphs with an added random matching (Q2119210) (← links)
- Some inequalities for reversible Markov chains and branching random walks via spectral optimization (Q2157453) (← links)
- Recurrence of Markov chain traces (Q2179256) (← links)
- Cutoff for the mean-field zero-range process with bounded monotone rates (Q2179596) (← links)
- On an epidemic model on finite graphs (Q2180383) (← links)
- The social network model on infinite graphs (Q2192744) (← links)
- A spectral characterization for concentration of the cover time (Q2209316) (← links)
- A comparison principle for random walk on dynamical percolation (Q2212614) (← links)
- The exclusion process mixes (almost) faster than independent particles (Q2212617) (← links)
- The interchange process on high-dimensional products (Q2240808) (← links)
- Entropy dissipation estimates for inhomogeneous zero-range processes (Q2240883) (← links)
- Reversibility of the non-backtracking random walk (Q2291971) (← links)
- A version of Aldous' spectral-gap conjecture for the zero range process (Q2330459) (← links)
- Cutoff for Ramanujan graphs via degree inflation (Q2411767) (← links)
- A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities (Q2413244) (← links)
- Rapid social connectivity (Q2631858) (← links)
- On giant components and treewidth in the layers model (Q2811162) (← links)
- A technical report on hitting times, mixing and cutoff (Q4603436) (← links)
- Infinite and Giant Components in the Layers Percolation Model (Q4603437) (← links)
- No Percolation at Criticality on Certain Groups of Intermediate Growth (Q5022039) (← links)
- Rapid mixing of hypergraph independent sets (Q5229340) (← links)
- Characterization of cutoff for reversible Markov chains (Q5363065) (← links)
- Modified log-Sobolev inequalities for strong-Rayleigh measures (Q6104002) (← links)
- Geometry of random Cayley graphs of abelian groups (Q6146786) (← links)
- Supplementary Material for Random Cayley Graphs Project (Q6308072) (← links)
- Supercritical percolation on nonamenable graphs: Isoperimetry, analyticity, and exponential decay of the cluster size distribution (Q6317645) (← links)
- Cutoff for Random Walks on Upper Triangular Matrices (Q6328737) (← links)
- Further Results and Discussions on Random Cayley Graphs (Q6328738) (← links)
- Sensitivity of mixing times of Cayley graphs (Q6347256) (← links)
- Cutoff for Almost All Random Walks on Abelian Groups (Q6359884) (← links)
- Covering a graph with independent walks (Q6364361) (← links)
- A direct comparison between the mixing time of the interchange process with "few" particles and independent random walks (Q6368759) (← links)
- On the universality of fluctuations for the cover time (Q6390162) (← links)
- Cutoff for random walk on random graphs with a community structure (Q6420010) (← links)
- Relaxation times are stationary hitting times of large sets (Q6432866) (← links)
- Phase transition for random walks on graphs with added weighted random matching (Q6441158) (← links)