The topology of the recurrent and transient sets of homogeneous random walks

Each point a of a simplex A defines the random walk on a finitely generated abelian group that takes the i-th step of a fixed finite set S with probability a_i. Li, Mossel and Weiss asked when the set R of recurrent walks is path-connected or simply connected, and when the set R^c of transient walks is path-connected, simply connected or convex. We answer these questions in terms of the projections v_i of the steps to the free part Z^n of the group. Apart from two simple cases, in which R is contractible or convex, R is homotopy equivalent to a bipartite graph whose vertices are the lines and planes through the origin on which the steps balance. The set R^c is empty when every v_i is zero, and otherwise contractible unless 0 lies in the relative interior of the convex hull of the v_i and these vectors span a line or a plane; then it has two components or is homotopy equivalent to a circle. It is convex exactly when every recurrent walk is positive recurrent.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24281976
Primary Topic
Stochastic processes and statistical mechanics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The topology of the recurrent and transient sets of homogeneous random walks

Yitzchak Shmalo
1 links
Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
preprint

The topology of the recurrent and transient sets of homogeneous random walks

Yitzchak Shmalo
preprint en

Abstract

Each point a of a simplex A defines the random walk on a finitely generated abelian group that takes the i-th step of a fixed finite set S with probability a_i. Li, Mossel and Weiss asked when the set R of recurrent walks is path-connected or simply connected, and when the set R^c of transient walks is path-connected, simply connected or convex. We answer these questions in terms of the projections v_i of the steps to the free part Z^n of the group. Apart from two simple cases, in which R is contractible or convex, R is homotopy equivalent to a bipartite graph whose vertices are the lines and planes through the origin on which the steps balance. The set R^c is empty when every v_i is zero, and otherwise contractible unless 0 lies in the relative interior of the convex hull of the v_i and these vectors span a line or a plane; then it has two components or is homotopy equivalent to a circle. It is convex exactly when every recurrent walk is positive recurrent.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon