SearcharxivSearch

arXiv · 2603.05967

Space-time boundaries for random walks and their application to operator algebras

Abstract

We investigate the Martin boundary of the space-time Markov chain associated to a finitely supported random walk $(\Gamma, \mu)$ with spectral radius $\rho$ and relate it to several classical compactifications of $\Gamma$. Assuming the strong ratio-limit property, we prove that the reduced ratio-limit compactification embeds naturally into the space-time Martin boundary. We introduce the $0$-Martin boundary, which governs the behaviour of $\infty$-harmonic functions, and show that the $0$-Martin kernels arise as rescaled limits of $\lambda$-Martin kernels as $\lambda\rightarrow 0$. For symmetric random walks on hyperbolic groups, the $0$-Martin boundary naturally covers the Gromov boundary, while the cover need not be injective in general. Our main structural theorem identifies the minimal space-time Martin boundary with the disjoint union of minimal $\lambda$-Martin boundaries over $\lambda\in [0, \rho^{-1}]$ with its natural pointwise topology. As an application, we show that the noncommutative Shilov boundary of the tensor algebra of the random walk $(\Gamma, \mu)$ coincides with its Toeplitz $C^*$-algebra.

Explore related subjects

Keep this discovery

BibTeXRIS

Adam Dor-On, Ilya Gekhtman, Pavel Prudnikov. 2026-03-06. Space-time boundaries for random walks and their application to operator algebras. https://arxiv.org/abs/2603.05967

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR