Related papers: Random walk on p-$adics in glassy systems
The planted p-spin interaction model is a paradigm of random-graph systems possessing both a ferromagnetic phase and a disordered phase with the latter splitting into many spin glass states at low temperatures. Conventional simulated…
We consider a system consisting of a planar random walk on a square lattice, submitted to stochastic elementary local deformations. Depending on the deformation transition rates, and specifically on a parameter $\eta$ which breaks the…
In this paper an original interacting particle system approach is developed for studying Markov chains in rare event regimes. The proposed particle system is theoretically studied through a genealogical tree interpretation of Feynman--Kac…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
We study Markovian and non-Markovian behaviour of stochastic processes generated by $p$-adic random dynamical systems. Given a family of $p$-adic monomial random mappings generating a random dynamical system. Under which conditions do the…
The Rado graph, also known as the random graph $G(\infty, p)$, is a classical limit object for finite graphs. We study natural ball walks as a way of understanding the geometry of this graph. For the walk started at $i$, we show that order…
We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…
Suppose that G and H are finite, connected graphs, G regular, X is a lazy random walk on G and Z is a reversible ergodic Markov chain on H. The generalized lamplighter chain X* associated with X and Z is the random walk on the wreath…
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
In this work, we study the dynamics of complex systems with time-dependent transition rates, focusing on $p$-adic analysis in modeling such systems. Starting from the master equation that governs the stochastic dynamics of a system with a…
We present a detailed study of simple `tree' models for off equilibrium dynamics and aging in glassy systems. The simplest tree describes the landscape of a random energy model, whereas multifurcating trees occur in the solution of the…
In this paper we view the steady states of classical random walks over complex networks with an arbitrary degree distribution as states in thermal equilibrium. By identifying the distribution of states as a canonical ensemble, we are able…
Stochastic systems characterised by a random driving in a form of the general stable noise are considered. The particle experiences long rests due to the traps the density of which is position-dependent and obeys a power-law form attributed…
In previous work by Avena and den Hollander, a model of a one-dimensional random walk in a dynamic random environment was proposed where the random environment is resampled from a given law along a growing sequence of deterministic times.…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
Within the mode-coupling theory for structural relaxation in simple systems the asymptotic laws and their leading-asymptotic correction formulas are derived for the motion of a tagged particle near a glass-transition singularity. These…
The paper deals with a new class of random walks strictly connected with the Pareto distribution. We consider stochastic processes in the sense of generalized convolution or weak generalized convolution following the idea given in [1]. The…
In this paper we consider a generalization of analysis on $p$-adic numbers field to the $m$ case of $m$-adic numbers ring. The basic statements, theorems and formulas of $p$-adic analysis can be used for the case of $m$-adic analysis…
On the rooted $k$-ary tree we consider a 0-1 kinetically constrained spin model in which the occupancy variable at each node is re-sampled with rate one from the Bernoulli(p) measure iff all its children are empty. For this process the…
In the eighties, A. Connes and E. J. Woods made a connection between hyperfinite von Neumann algebras and Poisson boundaries of time dependent random walks. The present paper explains this connection and gives a detailed proof of two…