Pages that link to "Item:Q495704"

The following pages link to Mixing times are hitting times of large sets (Q495704):

Displaying 27 items.

• Mixing of the upper triangular matrix walk (Q365712) (← 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)
• Hitting time and mixing time bounds of Stein's factors (Q1748553) (← links)
• On sensitivity of mixing times and cutoff (Q1748929) (← links)
• Mixing time bounds via bottleneck sequences (Q1756546) (← links)
• Bounds on lifting continuous-state Markov chains to speed up mixing (Q1800950) (← links)
• Metastable Markov chains: from the convergence of the trace to the convergence of the finite-dimensional distributions (Q1990229) (← links)
• Hitting, mixing and tunneling asymptotics of Metropolis-Hastings reversiblizations in the low-temperature regime (Q1996146) (← links)
• Mixing and hitting times for Gibbs samplers and other non-Feller processes (Q2073235) (← links)
• No cutoff in spherically symmetric trees (Q2137746) (← links)
• Some inequalities for reversible Markov chains and branching random walks via spectral optimization (Q2157453) (← links)
• Cutoff phenomenon for nearest Lamperti's random walk (Q2176364) (← links)
• Mixing of the square plaquette model on a critical length scale (Q2201503) (← links)
• A spectral characterization for concentration of the cover time (Q2209316) (← links)
• Cutoff for the square plaquette model on a critical length scale (Q2240829) (← links)
• Time scale separation and dynamic heterogeneity in the low temperature East model (Q2248859) (← links)
• Mixing times for a constrained Ising process on the two-dimensional torus at low density (Q2337837) (← links)
• Elementary bounds on mixing times for decomposable Markov chains (Q2402435) (← links)
• A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities (Q2413244) (← links)
• A threshold for cutoff in two-community random graphs (Q2657925) (← links)
• Leader election in well-connected graphs (Q2696279) (← links)
• The mixing time of the giant component of a random graph (Q2930052) (← links)
• The cutoff phenomenon for random birth and death chains (Q2977569) (← links)
• Tight inequalities among set hitting times in Markov chains (Q3190216) (← links)
• (Q5875493) (← links)
• Multiple random walks on graphs: mixing few to cover many (Q6085870) (← links)