Related papers: Hipster random walks, random series-parallel graph…

We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…

We consider continuous-time random walk models described by arbitrary sojourn time probability density functions. We find a general expression for the distribution of time-averaged observables for such systems, generalizing some recent…

We study the densities of uniform random walks in the plane. A special focus is on the case of short walks with three or four steps and less completely those with five steps. As one of the main results, we obtain a hypergeometric…

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…

We consider conservative cross-diffusion systems for two species where individual motion rates depend linearly on the local density of the other species. We develop duality estimates and obtain stability and approximation results. We first…

We study, on a $d$ dimensional hypercubic lattice, a random walk which is homogeneous except for one site. Instead of visiting this site, the walker hops over it with arbitrary rates. The probability distribution of this walk and the…

Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…

A random walk in a sparse random environment is a model introduced by Matzavinos et al. [Electron. J. Probab. 21, paper no. 72: 2016] as a generalization of both a simple symmetric random walk and a classical random walk in a random…

We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly…

For chaotic systems there is a theory for the decay of the survival probability, and for the parametric dependence of the local density of states. This theory leads to the distinction between "perturbative" and "non-perturbative" regimes,…

We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…

In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…

We investigate continuous time random walks with truncated $\alpha$-stable trapping times. We prove distributional ergodicity for a class of observables; namely, the time-averaged observables follow the probability density function called…

For a fixed graph $H$ and for arbitrarily large host graphs $G$, the number of homomorphisms from $H$ to $G$ and the number of subgraphs isomorphic to $H$ contained in $G$ have been extensively studied in extremal graph theory and graph…

The rate of convergence of simple random walk on the Heisenberg group over $Z/nZ$ with a standard generating set was determined by Bump et al [1,2]. We extend this result to random walks on the same groups with an arbitrary minimal…

We study homogenization properties of the discrete Laplace operator with random conductances on a large domain in $\mathbb{Z}^d$. More precisely, we prove almost-sure homogenization of the discrete Poisson equation and of the top of the…

We obtain the first results on convergence rates in the Prokhorov metric for the weak invariance principle (functional central limit theorem) for deterministic dynamical systems. Our results hold for uniformly expanding/hyperbolic (Axiom A)…

In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…

Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex, she moves to a uniformly random…

In this paper, we make specific conjectures about the distribution of Jacobians of random graphs with their canonical duality pairings. Our conjectures are based on a Cohen-Lenstra type heuristic saying that a finite abelian group with…