Related papers: Random walks on uniform and non-uniform combs and …
Let $\theta$ be a Bernoulli measure which is stationary for a random walk generated by finitely many contracting rational affine dilations of $\mathbb{R}^d$, and let $\mathcal{K} = \mathrm{supp}(\theta)$ be the corresponding attractor. An…
In a landscape composed of N randomly distributed sites in Euclidean space, a walker (``tourist'') goes to the nearest one that has not been visited in the last \tau steps. This procedure leads to trajectories composed of a transient part…
We develop rigorous, analytic techniques to study the behaviour of biased random walks on combs. This enables us to calculate exactly the spectral dimension of random comb ensembles for any bias scenario in the teeth or spine. Two specific…
We characterize the size of the largest common induced subgraph of two independent random uniform $d$-hypergraphs of different sizes with $d\geq 3$. More precisely, its distribution is asymptotically concentrated on two points, and we…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
We study the random walk on a finite dihedral group $G$ driven by the uniform measure on $k$ independently and uniformly chosen elements. We show that the walk exhibits cutoff with high probability throughout nearly the entire regime $1 \ll…
We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over…
Let d = (d1, d2, ..., dn) be a vector of non-negative integers with even sum. We prove some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph.…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
In this article we study collisions of two independent random walks on comb graphs $\mathrm{Comb}(\tilde{G},f)$ for a large class of recurrent planar graphs $\tilde{G}$ and profile functions $f$, the latter governing the length of vertical…
Discretized landscapes can be mapped onto ranked surfaces, where every element (site or bond) has a unique rank associated with its corresponding relative height. By sequentially allocating these elements according to their ranks and…
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…
We consider the random walk attachment graph introduced by Saram\"{a}ki and Kaski and proposed as a mechanism to explain how behaviour similar to preferential attachment may appear requiring only local knowledge. We show that if the length…
Many real-world networks exhibit the so-called small-world phenomenon: their typical distances are much smaller than their sizes. One mathematical model for this phenomenon is a long-range percolation graph on a $d$-dimensional box $\{0, 1,…
We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of…
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed and refresh their status at rate \mu\ while at the same time a random walker moves on G at rate 1 but only along…
This paper investigates random walks and diffusion limits on a broad class of fractal graphs generated by Edge Iterated Graph Systems (EIGS). We prove that the rescaled simple random walks converge in the…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…
Time-dependent conformal maps are used to model a class of growth phenomena limited by coupled non-Laplacian transport processes, such as nonlinear diffusion, advection, and electro-migration. Both continuous and stochastic dynamics are…
We calculate the spectral dimension of a wide class of tree-like fractals by solving the random walk problem through a new analytical technique, based on invariance under generalized cutting-decimation transformations. These fractals are…