The full spectrum of random walks on complete finite \(d\)-ary trees
From MaRDI portal
Publication:2042747
DOI10.1214/21-EJP608zbMath1478.60031arXiv1912.06771OpenAlexW3141258160MaRDI QIDQ2042747
Publication date: 21 July 2021
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.06771
Cites Work
- Unnamed Item
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- The random \(k\) cycle walk on the symmetric group
- Random walk covering of some special trees
- Total variation cutoff in birth-and-death chains
- Functions of random walks on hyperplane arrangements
- Random shuffles and group representations
- Random walks and hyperplane arrangements
- Mixing times of lozenge tiling and card shuffling Markov chains
- Semigroups, rings, and Markov chains
- The spectrum of the Laplacian matrix of a balanced binary tree
- Spectral analysis of random-to-random Markov chains
- Frogs on trees?
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
- Characterization of cutoff for reversible Markov chains
- Comparing with octopi
- Spectral computations for birth and death chains
- The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
- Computing cutoff times of birth and death chains
- Mixing times for the interchange process
- On the mixing time and spectral gap for birth and death chains
- Proof of Aldous’ spectral gap conjecture
- Generating a random permutation with random transpositions
