Pages that link to "Item:Q1729696"
From MaRDI portal
The following pages link to Cutoff at the ``entropic time'' for sparse Markov chains (Q1729696):
Displaying 14 items.
- An entropic proof of cutoff on Ramanujan graphs (Q829365) (← links)
- Mixing time trichotomy in regenerating dynamic digraphs (Q2029801) (← links)
- Linking the mixing times of random walks on static and dynamic random graphs (Q2080276) (← links)
- Mixing time of fractional random walk on finite fields (Q2084834) (← links)
- Universality of cutoff for graphs with an added random matching (Q2119210) (← links)
- Stationary distribution and cover time of sparse directed configuration models (Q2210748) (← 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)
- Spectrum of large random Markov chains: Heavy-tailed weights on the oriented complete graph (Q5370958) (← links)
- Mixing time of PageRank surfers on sparse random digraphs (Q6074663) (← links)
- The cutoff phenomenon for the stochastic heat and wave equation subject to small Lévy noise (Q6078571) (← links)
- Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022 (Q6133177) (← links)
- On the meeting of random walks on random DFA (Q6144443) (← links)
- Rankings in directed configuration models with heavy tailed in-degrees (Q6180388) (← links)