Related papers: Some exact results in branching and annihilating r…
We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…
We study the order statistics of a random walk (RW) of $n$ steps whose jumps are distributed according to symmetric Erlang densities $f_p(\eta)\sim |\eta|^p \,e^{-|\eta|}$, parametrized by a non-negative integer $p$. Our main focus is on…
We study the distribution of dynamical quantities in various one-dimensional, disordered models the critical behavior of which is described by an infinite randomness fixed point. In the {\it disordered contact process}, the quenched…
Results on the behaviour of the rightmost particle in the $n$th generation in the branching random walk are reviewed and the phenomenon of anomalous spreading speeds, noticed recently in related deterministic models, is considered. The…
Random Walks in Dirichlet Environment (RWDE) correspond to Random Walks in Random Environment (RWRE) on $\Bbb{Z}^d$ where the transition probabilities are i.i.d. at each site with a Dirichlet distribution. Hence, the model is parametrized…
Particle hopping is a common feature in heterogeneous media. We explore such motion by using the widely applicable formalism of the continuous time random walk and focus on the statistics of rare events. Numerous experiments have shown that…
We consider a system of particles undergoing the branching and annihilating reactions A -> (m+1)A and A + A -> 0, with m even. The particles move via long-range Levy flights, where the probability of moving a distance r decays as…
We consider self-avoiding walk on a tree with random conductances. It is proven that in the weak disorder regime, the quenched critical point is equal to the annealed one, and that in the strong disorder regime, these critical points are…
A curious connection exists between the theory of optimal stopping for independent random variables, and branching processes. In particular, for the branching process $Z_n$ with offspring distribution $Y$, there exists a random variable $X$…
We study simple random walk on the class of random planar maps which can be encoded by a two-dimensional random walk with i.i.d. increments or a two-dimensional Brownian motion via a "mating-of-trees" type bijection. This class includes the…
We study an active random walker model in which a particle's motion is determined by a self-generated field. The field encodes information about the particle's path history. This leads to either self-attractive or self-repelling behavior.…
Random walk (RW)-based algorithms have long been popular in distributed systems due to low overheads and scalability, with recent growing applications in decentralized learning. However, their reliance on local interactions makes them…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
Multifractal properties of the distribution of topological invariants for a model of trajectories randomly entangled with a nonsymmetric lattice of obstacles are investigated. Using the equivalence of the model to random walks on a locally…
We provide finite-size scaling estimates for the dynamical critical exponent of the even parity-conserving universality class of critical behavior through exact numerical diagonalizations of the time evolution operator of an…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
We consider the simple random walk on random graphs generated by discrete point processes. This random graph has a random subset of a cubic lattice as the vertices and lines between any consecutive vertices on lines parallel to each…
We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent $\gamma=\log 3/\log2$. We find exact results concerning different first-passage…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…