SearcharxivSearch

arXiv · 2504.06851

Mixing trichotomy for random walks on directed stochastic block models

Abstract

We consider a directed version of the classical Stochastic Block Model with $m\ge 2$ communities and a parameter $\alpha$ controlling the inter-community connectivity. We show that, depending on the scaling of $\alpha$, the mixing time of the random walk on this graph can exhibit three different behaviors, which we refer to as subcritical, critical and supercritical. In the subcritical regime, the total variation distance to equilibrium decays abruptly, providing the occurrence of the so-called cutoff phenomenon. In the supercritical regime, the mixing is governed by the inter-community jumps, and the random walk exhibits a metastable behavior: at first it collapses to a local equilibrium, then, on a larger timescale, it can be effectively described as a mean-field process on the $m$ communities, with a decay to equilibrium which is asymptotically smooth and exponential. Finally, for the critical regime, we show a sort of interpolation of the two above-mentioned behaviors. Although the metastable behavior shown in the supercritical regime appears natural from a heuristic standpoint, a substantial part of our analysis can be read as a control on the homogenization of the underlying random environment.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alessandra Bianchi, Giacomo Passuello, Matteo Quattropani. 2025-04-09. Mixing trichotomy for random walks on directed stochastic block models. https://doi.org/10.1214/26-ejp1476

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