Related papers: Random Walk Approach to Simple Evolution Model
Cauchy's formula was originally established for random straight paths crossing a body $B \subset \mathbb{R}^{n}$ and basically relates the average chord length through $B$ to the ratio between the volume and the surface of the body itself.…
With a view to connecting random mutation on the molecular level to punctuated equilibrium behavior on the phenotype level, we propose a new model for biological evolution, which incorporates random mutation and natural selection. In this…
In this paper, we introduce random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension $d$, a random walk with an absorbing state is defined which relates to the spectrum of the $k$-dimensional…
A particle subject to successive, random displacements is said to execute a random walk (in position or some other coordinate). The mathematical properties of random walks have been very thoroughly investigated, and the model is used in…
In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…
We introduce a simple lattice model of superconducting vortices driven by repulsive interactions through a random pinning potential. The model describes the behavior at the scale of the London length lambda or larger. It self-organizes to a…
Functional limit theorem for continuous-time random walks (CTRW) are found in general case of dependent waiting times and jump sizes that are also position dependent. The limiting anomalous diffusion is described in terms of fractional…
Using both numerical simulations and scaling arguments, we study the behavior of a random walker on a one-dimensional small-world network. For the properties we study, we find that the random walk obeys a characteristic scaling form. These…
We study slow-subdiffusion in comparison to subdiffusion. Both of the processes are treated as random walks and can be described within continuous time random walk formalism. However, the probability density of the waiting time of a random…
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
In this paper we consider a particular version of the random walk with restarts: random reset events which bring suddenly the system to the starting value. We analyze its relevant statistical properties like the transition probability and…
Models of random walks are considered in which walkers are born at one location and die at all other locations with uniform death rate. Steady-state distributions of random walkers exhibit dimensionally dependent critical behavior as a…
The food web is a directed graph in which nodes label species and directed links represent the predation between species. The cascade model generates random food webs. The continuum cascade model is a Poisson approximation of the cascade…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
We define a general model of stochastically-evolving graphs, namely the \emph{Edge-Uniform Stochastically-Evolving Graphs}. In this model, each possible edge of an underlying general static graph evolves independently being either alive or…
We investigate the distribution of the time spent by a random walker to the right of a boundary moving with constant velocity v. For the continuous-time problem (Brownian motion), we provide a simple alternative proof of Newman's recent…
We study persistence probabilities for random walks in correlated Gaussian random environment first studied by Oshanin, Rosso and Schehr. From the persistence results, we can deduce properties of critical branching processes with offspring…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
For a random walk defined for a doubly infinite sequence of times, we let the time parameter itself be an integer-valued process, and call the orginal process a random walk at random time. We find the scaling limit which generalizes the…
Random walks provide a simple conventional model to describe various transport processes, for example propagation of heat or diffusion of matter through a medium. However, in many practical cases the medium is highly irregular due to…