Pages that link to "Item:Q2320396"

The following pages link to Comparing mixing times on sparse random graphs (Q2320396):

Displaying 8 items.

• An entropic proof of cutoff on Ramanujan graphs (Q829365) (← links)
• Universality of cutoff for graphs with an added random matching (Q2119210) (← links)
• Cutoff for random lifts of weighted graphs (Q2119212) (← links)
• No cutoff in spherically symmetric trees (Q2137746) (← links)
• The cutoff phenomenon in total variation for nonlinear Langevin systems with small layered stable noise (Q2243931) (← links)
• Cutoff for permuted Markov chains (Q2686612) (← links)
• The cutoff phenomenon for the stochastic heat and wave equation subject to small Lévy noise (Q6078571) (← links)
• Cutoff ergodicity bounds in Wasserstein distance for a viscous energy shell model with Lévy noise (Q6614945) (← links)