Related papers: Return probability for the Anderson model on the r…
We show that the "twisted" planar random walk - which results by summing up stationary increments rotated by multiples of a fixed angle - is recurrent under diverse assumptions on the increment process. For example, if the increment process…
We take up the idea of Nelson's stochastic processes, the aim of which was to deduce Schr\"odinger's equation. We make two major changes here. The first one is to consider deterministic processes which are pseudo-random but which have the…
A new proof is given for the formula for the expected return time of a random walk on a graph. This proof makes use of known relationships between electric resistance and random walks.
Gaussian Rosenzweig-Porter (GRP) random matrix ensemble is the only one in which the robust multifractal phase and ergodic transition have a status of a mathematical theorem. Yet, this phase in GRP model is oversimplified: the spectrum of…
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…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
We study a simple stochastic differential equation that models the dispersion of close heavy particles moving in a turbulent flow. In one and two dimensions, the model is closely related to the one-dimensional stationary Schroedinger…
We study a non-Markovian random walk in dimension 1. It depends on two parameters eps_r and eps_l, the probabilities to go straight on when walking to the right, respectively to the left. The position x of the walk after n steps and the…
Exponential random graph models (ERGMs) are flexible probability models allowing edge dependency. However, it is known that, to a first-order approximation, many ERGMs behave like Erd\"os-R\'enyi random graphs, where edges are independent.…
We investigate the persistence properties of critical d-dimensional systems relaxing from an initial state with non-vanishing order parameter (e.g., the magnetization in the Ising model), focusing on the dynamics of the global order…
In this paper we explore the features of a graph generated by random walkers with nodes that have evolutionary attractiveness and Boltzmann-like transition probabilities that depend both on the euclidean distance between the nodes and on…
We study the convergence towards a unique equilibrium distribution of the solutions to a time-discrete model with non-overlapping generations arising in quantitative genetics. The model describes the dynamics of a phenotypic distribution…
We study Anderson localisation on high-dimensional graphs with spatial structure induced by long-ranged but distance-dependent hopping. To this end, we introduce a class of models that interpolate between the short-range Anderson model on a…
We study an unbiased, discrete time random walk on the nonnegative integers, with the origin absorbing. The process has a history-dependent step length: the walker takes steps of length v while in a region which has been visited before, and…
In this paper, we aim at recovering an undirected weighted graph of $N$ vertices from the knowledge of a perturbed version of the eigenspaces of its adjacency matrix $W$. For instance, this situation arises for stationary signals on graphs…
It is a celebrated fact that a simple random walk on an infinite $k$-ary tree for $k \geq 2$ returns to the initial vertex at most finitely many times during infinitely many transitions; it is called transient. This work points out the fact…
Irreversible drift-diffusion processes are very common in biochemical reactions. They have a non-equilibrium stationary state (invariant measure) which does not satisfy detailed balance. For the corresponding Fokker-Planck equation on a…
We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze…
The Fourier-Bessel expansion of a function on a circular disc yields a simple series representation for the end-to-end probability distribution function w(R,phi) encountered in a planar persistent random walk, where the direction taken in a…
In the present paper, we study the distribution of the return points in the fibers for a RDS (random dynamical systems) nonuniformly expanding preserving an ergodic probability, we also show the abundance of nonlacunarity of hyperbolic…