Cover Image

Nonconcentration of hitting times for random walks on graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Chiclana, Rafael
Format:	Preprint
Published:	2026
Subjects:	Probability 60J10, 05C81
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal lower bound for the variance of hitting times for simple random walks on graphs
by: Chiclana, Rafael, et al.
Published: (2023)

Collisions of random walks on comb graphs with a planar base
by: De Ambroggio, Umberto, et al.
Published: (2025)

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)

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

Random rotor walks and i.i.d. sandpiles on Sierpinski graphs
by: Kaiser, Robin, et al.
Published: (2022)

Triple collisions on a comb graph
by: Croydon, David A., et al.
Published: (2024)

A Nordhaus--Gaddum problem for the spectral gap of a graph
by: Kim, Sooyeong, et al.
Published: (2024)

Spectral properties of the stochastic block model and their application to hitting times of random walks
by: Löwe, Matthias, et al.
Published: (2024)

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

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

On the structure of the sandpile identity element on Sierpinski gasket graphs
by: Kaiser, Robin, et al.
Published: (2026)

Average height for Abelian sandpiles and the looping constant on Sierpinski graphs
by: Heizmann, Nico, et al.
Published: (2023)

Scaling limit for the cover time of the $λ$-biased random walk on a binary tree with $λ<1$
by: Croydon, David A.
Published: (2024)

Locally Markov walks on finite graphs
by: Kaiser, Robin, et al.
Published: (2024)

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

Feynman Formula for Discrete-time Quantum Walks
by: Fouque, Jean-Pierre, et al.
Published: (2025)

Mixing time of the random walk on the giant component of the random geometric graph
by: Haaland, Magnus H., et al.
Published: (2025)

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

Hitting Time Distributions of Random Walks on Finite Graphs
by: Kumar, Anuraag
Published: (2025)

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

The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational
by: Sylvester, John
Published: (2021)

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

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

Random Walks and the Meeting Time for Trees
by: Beveridge, Andrew, et al.
Published: (2025)

Random Walks and the Best Meeting Time for Trees
by: Beveridge, Andrew, et al.
Published: (2025)

Can one condition a killed random walk to survive?
by: Rey, Lucas, et al.
Published: (2024)

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

On the jump of the cover time in random geometric graphs
by: Martinez, Carlos, et al.
Published: (2025)

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)

Conditions for Equivalence of Random Interlacements and Random Walk Reflected off of Infinity
by: Yu, Yao
Published: (2025)

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

Traces left by random walks on large random graphs: local limits
by: Dereich, Steffen
Published: (2024)

Extremal process of the local time of simple random walk on a regular tree
by: Abe, Yoshihiro, et al.
Published: (2025)

The Ising Model on a Two-Community Stochastic Block Model
by: Bianchi, Alessandra, et al.
Published: (2026)

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

On the cover time of Brownian motion on the Brownian continuum random tree
by: Andriopoulos, George, et al.
Published: (2024)

Iterated Graph Systems (I): random walks and diffusion limits
by: Neroli, Ziyu
Published: (2026)

Left-continuous random walk on $\mathbb{Z}$ and the parity of its hitting times
by: Vilkas, Timo
Published: (2024)

Discordant edges for the voter model on regular random graphs
by: Avena, Luca, et al.
Published: (2022)