Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.15992

Interacting vertex reinforced random walks on complete sub-graphs

Fernando P. A. Prado·Rafael A. Rosales
View original source ↗Read source document ↗Export metadata ↓

Abstract

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete subgraph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the cumulative proportion of visits by all walks that have access to that vertex. Proportions are modified by multiplication by a real valued interaction parameter and the addition of a parameter representing the intrinsic preference of the walk for the vertex. This model covers a wide range of interactions, including the cooperation (attraction) or competition (repulsion) of several walks at single vertices. We are principally concerned with strong laws for the proportion of visits to each vertex by all walks. We prove that this measure converges almost surely towards the set of fixed points of the transition probabilities. Almost sure convergence to a single fixed point is in fact the generic behaviour as we show this to hold for almost all parameter values of our model. Beyond almost sure convergence, our model provides a general framework that yields a detailed description of the limiting behaviour for any choice of interaction parameters and subgraph geometry. We illustrate this by analyzing interacting walks on complete graphs, stars, and cycles, chosen to highlight the model's broad applicability. The central contribution lies in offering a powerful tool to analyse diverse types of interactions mediated by the intersections of subgraphs. Importantly, our results provide not only convergence criteria, but also conditions under which the empirical proportions of the walks' visits fail to converge to certain boundary points of the space where their trajectory evolves.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fernando P. A. Prado, Rafael A. Rosales. 2026-06-26. Interacting vertex reinforced random walks on complete sub-graphs. https://arxiv.org/abs/2508.15992

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

KEEP EXPLORING

Related papers

arXiv2026

Local well-posedness of general mean field game master equations

This paper presents a generic approach for establishing mean field game master equations, applicable whenever the mean field equilibrium can be characterized by a McKean-Vlasov forward-backward stochastic differential equation system. The core of our approach is a representation formula for the first-order Lions derivative of the decoupling field of this forward-backward SDE system. We then employ a bootstrap argument to recursively compute its higher-order derivatives. To demonstrate the method's versatility, we establish the local well-posedness for master equations in three distinct models: extended mean field games, mean field games with volatility control, and mean field games with a major player.

math.PR↗
arXiv2026

Uniqueness for nonlinear Fokker-Planck equations with general diffusion terms and their associated nonlinear Markov processes

This work is concerned with the uniqueness of distributional solutions to nonlinear Fokker-Planck equations with non-diagonal diffusion terms of type \begin{equation} u_{t}-\sum_{i,j=1}^{d} D^{2}_{ij}(a_{ij}(x)β(x,u))+ \text{div}(b(x,u)u)=0 \quad \text{in}\; (0, \infty) \times \mathbb{R}^{d} ,\notag \end{equation} with initial condition $u(0,x)\equiv u_{0}(x)$, where $a_{ij}$, $β$, and $b$ are suitable functions. Under suitable assumptions, this equation generates a continuous contraction semigroup $S(t): L^{1}(\mathbb{R}^{d}) \rightarrow L^{1}(\mathbb{R}^{d})$, and $u(t)=S(t)u_{0}$ is a mild solution to the equation. Our main contribution is to prove that this mild solution is unique in the much larger class of distributional solutions. This extends previous uniqueness results for the diagonal (also called isotropic) diffusion case $a_{ij} \equiv δ_{ij}$. Another key analytical result of this paper is the uniqueness for distributional solutions of the associated linearized equation. As a main application, we prove weak uniqueness for the corresponding McKean-Vlasov SDEs. Moreover, we prove that, the probabilistically weak solution to the McKean-Vlasov SDEs is also the unique probabilistically strong solution. Furthermore, we establish a new $L^{\infty}$ estimate for mild solutions starting from data in $L^{1}\cap L^{\infty}$ and this estimate is used in the construction of nonlinear Markov processes. Finally, we prove that the path laws of the solutions to the McKean-Vlasov SDEs form a nonlinear Markov process in the sense of McKean.

math.PR↗
arXiv2026

Small-time annealed large deviations principle for one-dimensional diffusions in a random environment

In this paper, we establish a small-time annealed path large deviation principle for one-dimensional diffusions in a random environment associated with the generator ${\mathcal L}_W f(x)=e^{-ρ(x,W)}(e^{a(x,W)}f'(x))'$. The coefficients $\{ρ(x,\cdot):x\in\mathbb R\}$ and $\{a(x,\cdot):x\in\mathbb R\}$ are random. We assume that for each fixed realization of the environment, $ρ$ and $a$ are continuous and locally exponentially integrable, and that the support of the associated intrinsic coordinates is compact and non-collapsing. This framework includes the extensively studied Brox diffusion $dX_t=dB_t-\frac12\dot W(X_t)\,dt$, where $B$ is a standard Brownian motion and $W$ is an independent two-sided Brownian motion representing the environment. The Itô--McKean representation of the diffusions and the estimates of the first exit probabilities derived via Moser iteration play a crucial role.

math.PR↗