Related papers: Oriented Random Walk on the Heisenberg Group and P…
We consider the simple random walk on the infinite cluster of a general class of percolation models on $\mathbb{Z}^d$, $d\geq 3$, including Bernoulli percolation as well as models with strong, algebraically decaying correlations. For almost…
Given a branching random walk, let $M_n$ be the minimum position of any member of the $n$th generation. We calculate $\mathbf{E}M_n$ to within O(1) and prove exponential tail bounds for $\mathbf{P}\{|M_n-\mathbf{E}M_n|>x\}$, under quite…
We give a sufficient condition for the existence of the harmonic measure from infinity of transient random walks on weighted graphs. In particular, this condition is verified by the random conductance model on $\Z^d$, $d\geq 3$, when the…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
In high dimensional percolation at parameter $p < p_c$, the one-arm probability $\pi_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $\pi_p(n) / \pi_{p_c}(n)$, establishing a form…
We consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and H\"aggstr\"om and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli…
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…
Consider Bernoulli bond percolation on a graph nicely embedded in hyperbolic space $\mathbb H^d$ in such a way that it admits a transitive action by isometries of $\mathbb H^d$. Let $p_0$ be the supremum of such percolation parameters that…
We prove the existence of scaling limits for the projection on the backbone of the random walks on the Incipient Infinite Cluster and the Invasion Percolation Cluster on a regular tree. We treat these projected random walks as randomly…
We consider a discrete-time random motion, Markov chain on the Poincar\'{e} disk. In the basic variant of the model a particle moves along certain circular arcs within the disk, its location is determined by a composition of random…
A first-order percolation transition, called explosive percolation, was recently discovered in evolution networks with random edge selection under a certain restriction. However, the network percolation with more realistic evolution…
This paper works out the rate of convergence of two "natural" random walks on the dicyclic group.
We investigate the dynamics of a single tracer exploring a course of fixed obstacles in the vicinity of the percolation transition for particles confined to the infinite cluster. The mean-square displacement displays anomalous transport,…
We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…
We prove tail estimates for variables $\sum_i f(X_i)$, where $(X_i)_i$ is the trajectory of a random walk on an undirected graph (or, equivalently, a reversible Markov chain). The estimates are in terms of the maximum of the function $f$,…
We consider random walks in a random environment that is given by i.i.d. Dirichlet distributions at each vertex of Z^d or, equivalently, oriented edge reinforced random walks on Z^d. The parameters of the distribution are a 2d-uplet of…
This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…
An infinite convergent sum of independent and identically distributed random variables discounted by a multiplicative random walk is called perpetuity, because of a possible actuarial application. We give three disjoint groups of sufficient…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
We consider a random walk on a random graph $(V,E)$, where $V$ is the set of open sites under i.i.d. Bernoulli site percolation on the multi-dimensional integer set $\mathbf{Z}^d$, and the transition probabilities of the walk are generated…