Related papers: Divisible sandpiles via random walks in random sce…

We consider $d$ random walks $\big(S_n^{(j)}\big)_{n\in\mathbb{N}}$, $1\leq j \leq d$, in the same random environment $\omega$ in $\mathbb{Z}$, and a recurrent simple random walk $(Z_n)_{n\in\mathbb{N}}$ on $\mathbb{Z}$. We assume that,…

We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…

Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*} {\mathbb P}(\text{$A$ is singular in…

We study random walks on the lampshuffler group $\mathrm{FSym}(H)\rtimes H$, where $H$ is a finitely generated group and $\mathrm{FSym}(H)$ is the group of finitary permutations of $H$. We show that for any step distribution $\mu$ with a…

Let $G$ be an infinite connected graph with vertex set $V$. Let $\{S_n: n \in \mathbb N_0 \}$ be the simple random walk on $G$ and let $\{ \xi(v) : v \in V \}$ be a collection of i.i.d. random variables which are independent of the random…

We study the expanding properties of random perturbations of regular interval maps satisfying the summability condition of exponent one. Under very general conditions on the interval maps and perturbation types, we prove strong stochastic…

We study a class of random homogeneous systems. Our main result says that under suitable general assumptions, these systems converge weakly, upon a suitable normalization, to the probability distribution with density $\frac34 \, (1-x^2) \,…

We prove strong statistical stability of a large class of one-dimensional maps which may have an arbitrary finite number of discontinuities and of non-degenerate critical points and/or singular points with infinite derivative, and satisfy…

We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given $\alpha \in (0,1)$, the union of any $n$-vertex graph with minimum degree $\alpha n$ and the binomial random…

We consider transient random walks in random environment on $\z$ with zero asymptotic speed. A classical result of Kesten, Kozlov and Spitzer says that the hitting time of the level $n$ converges in law, after a proper normalization,…

We prove that metric graph with the minimal growth of the number of possible endpoints of a random walk is the union of several linear paths coming out of the same vertex

In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…

It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

Random dynamical systems (RDS) evolve by a dynamical rule chosen independently with a certain probability, from a given set of deterministic rules. These dynamical systems in an interval reach a steady state with a unique well-defined…

We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…

We study nearest neighbor random walks on fixed environments of $\mathbb{Z}$ composed of two point types : $(1/2,1/2)$ and $(p,1-p)$ for $p>1/2$. We show that for every environment with density of $p$ drifts bounded by $\lambda$ we have…

We study the problem of planning paths for $p$ distinguishable pebbles (robots) residing on the vertices of an $n$-vertex connected graph with $p \le n$. A pebble may move from a vertex to an adjacent one in a time step provided that it…

A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…

Consider a discrete-time simple random walk $(X_t)_{t\ge 0}$ on an infinite, connected, locally finite graph $G$. Let $R_t := |\{X_0,\dots,X_t\}|$ denote its range at time $t$, and $T_n:=\inf\{t\ge 0: R_t= n\}$ the $n-$th discovery time. We…