Cutoff on trees is rare
type: Item
instance of: scholarly article
title: Cutoff on trees is rare
zbMATH Open document ID: 1541.60055
author: Nina Gantert
author: Evita Nestoridi
author: Dominik Schmid
published in: Journal of Theoretical Probability
publication date: 2024-06-17T00:00:00Z
Mathematics Subject Classification ID: 60J27
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 60K37
Mathematics Subject Classification ID: 60G50
zbMATH DE Number: 7865975
zbMATH Keywords: random walk
zbMATH Keywords: spectral gap
zbMATH Keywords: mixing time
zbMATH Keywords: cutoff phenomenon
zbMATH Keywords: trees with cutoff
MaRDI profile type: Publication
cites work: Most trees are short and fat
cites work: Some Inequalities for Reversible Markov Chains
cites work: The continuum random tree. I
cites work: Q3976721
cites work: The continuum random tree. III
cites work: Shuffling Cards and Stopping Times
cites work: Characterization of cutoff for reversible Markov chains
cites work: Cutoff for nonbacktracking random walks on sparse random graphs
cites work: Random walks on the random graph
cites work: Centers for Random Walks on Trees
cites work: Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups
cites work: On the mixing time and spectral gap for birth and death chains
cites work: Computing cutoff times of birth and death chains
cites work: No cutoff in spherically symmetric trees
cites work: Generating a random permutation with random transpositions
cites work: Total variation cutoff in birth-and-death chains
cites work: Weighted Hardy and Poincaré Inequalities on Trees
cites work: Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
cites work: Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
cites work: Mixing times for the interchange process
cites work: Subdiffusive behavior of random walk on a random cluster
cites work: Q4595047
cites work: Spectral gap, isoperimetry and concentration on trees
cites work: Cutoff phenomena for random walks on random regular graphs
cites work: Probability on trees and networks
cites work: The CRT is the scaling limit of unordered binary trees
cites work: Relations between isoperimetry and spectral gap for finite Markov chains
cites work: On eigenfunctions of Markov processes on trees
cites work: The full spectrum of random walks on complete finite \(d\)-ary trees
cites work: Mixing times are hitting times of large sets
cites work: Total variation cutoff in a tree
cites work: Q1366794
DOI: 10.1007/S10959-023-01274-5
description: scientific article; zbMATH DE number 7865975