Cover Image

Cutoff for Almost All Random Walks on Abelian Groups

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hermon, Jonathan, Olesker-Taylor, Sam
Format:	Preprint
Published:	2021
Subjects:	Probability Group Theory 05C48, 05C80, 05C81, 20D15, 60B15, 60J27, 60K37
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Cutoff for random Cayley graphs of nilpotent groups
by: Hermon, Jonathan, et al.
Published: (2024)

Geometry of Random Cayley Graphs of Abelian Groups
by: Hermon, Jonathan, et al.
Published: (2021)

Cutoff for random walks on dihedral groups
by: Huang, Xiangying, et al.
Published: (2025)

Cutoff for Rewiring Dynamics on Perfect Matchings
by: Olesker-Taylor, Sam
Published: (2021)

Limit Profile for Projections of Random Walks on Groups
by: Nestoridi, Evita, et al.
Published: (2022)

Sensitivity of mixing times of Cayley graphs
by: Hermon, Jonathan, et al.
Published: (2020)

Return probability on Bienaymé-Galton-Watson trees and spectral asymptotics of sparse Erdős-Rényi random graphs
by: Heydenreich, Markus, et al.
Published: (2026)

On the return probability of the simple random walk on Galton-Watson trees
by: Müller, Peter, et al.
Published: (2024)

Convergence of blanket times for sequences of random walks on critical random graphs
by: Andriopoulos, George
Published: (2018)

Geometric Bounds on the Fastest Mixing Markov Chain
by: Olesker-Taylor, Sam, et al.
Published: (2021)

The multi-level friendship paradox for sparse random graphs
by: Hazra, Rajat Subhra, et al.
Published: (2025)

Network evolution with self-reinforcement
by: Bhamidi, Shankar, et al.
Published: (2026)

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
by: Andrade, Mauricio Daros, et al.
Published: (2025)

Ergodicity of the hard-core PCA with a random walk method
by: Casse, Jérôme, et al.
Published: (2025)

Self-Reinforced Preferential Attachment
by: Dahiya, Yogesh, et al.
Published: (2025)

Diameter and mixing time of the giant component in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Probabilistic Zero Forcing with Vertex Reversion
by: Brennan, Zachary
Published: (2024)

Simultaneous Cutoff on the Multitype Configuration Model
by: Fernley, John, et al.
Published: (2024)

Elephant Random Walks on Coverings of Dipole Graphs
by: Naganuma, Nobuaki, et al.
Published: (2026)

Random friend trees
by: Berry, Louigi Addario, et al.
Published: (2024)

Mixing trichotomy for random walks on directed stochastic block models
by: Bianchi, Alessandra, et al.
Published: (2025)

Mixing cutoff for simple random walks on the Chung-Lu digraph
by: Bianchi, Alessandra, et al.
Published: (2024)

Cutoff phenomenon for the warp-transpose top with random shuffle
by: Ghosh, Subhajit
Published: (2021)

Local limit of the random degree constrained process
by: Ráth, Balázs, et al.
Published: (2024)

The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)

Meeting times of Markov chains via singular value decomposition
by: van Belle, Thomas, et al.
Published: (2024)

Time-Biased Random Walks and Robustness of Expanders
by: Olesker-Taylor, Sam, et al.
Published: (2024)

The giant in random graphs is almost local
by: van der Hofstad, Remco
Published: (2021)

Structural results for the Tree Builder Random Walk
by: Engländer, Janos, et al.
Published: (2023)

Scaling limit of the Aldous-Broder chain on regular graphs: the transient regime
by: Hernández, Osvaldo Angtuncio, et al.
Published: (2025)

Concentration of measure for Graphon particle system
by: Bayraktar, Erhan, et al.
Published: (2022)

Can the root cluster remain largest forever in random recursive tree percolation?
by: Zheng, Yushu
Published: (2026)

Thresholds for contagious sets in random graphs
by: Angel, Omer, et al.
Published: (2016)

The effects of initial conditions on the accuracy of mean-field approximations of Markov processes on large random graphs
by: Dionigi, Pierfrancesco, et al.
Published: (2025)

Genealogies of records of stochastic processes with stationary increments as unimodular trees
by: Baccelli, François, et al.
Published: (2024)

Tight universal bounds on the height times the width of random trees
by: Donderwinkel, Serte, et al.
Published: (2024)

Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023)

The stable trees revisited
by: Goldschmidt, Christina, et al.
Published: (2025)

Random intersection graphs with communities
by: van der Hofstad, Remco, et al.
Published: (2018)

Tightness for the Cover Time of Wired Planar Domains
by: Louidor, Oren, et al.
Published: (2024)