Related papers: Tightness for a family of recursion equations
We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…
The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of…
We consider a recent model of random walk that recursively grows the network on which it evolves, namely the Tree Builder Random Walk (TBRW). We introduce a bias $\rho \in (0,\infty)$ towards the root, and exhibit a phase transition for…
Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…
We study the problem of a random walk on a lattice in which bonds connecting nearest neighbor sites open and close randomly in time, a situation often encountered in fluctuating media. We present a simple renormalization group technique to…
We investigate the diffusion limited aggregation of particles executing persistent random walks. The scaling properties of both random walks and large aggregates are presented. The aggregates exhibit a crossover between ballistic and…
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…
In this report, the explicit probability density functions of the random Euclidean distances associated with regular hexagons are given, when the two endpoints of a link are randomly distributed in the same hexagon, and two adjacent…
Unlike classical simple random walks, one-dimensional random walks in random environments (RWRE) are known to have a wide array of potential limiting distributions. Under certain assumptions, however, it is known that CLT-like limiting…
The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…
We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…
Abstract. The purpose of this paper is twofold. We introduce the theory of random tensors, which naturally extends the method of random averaging operators in our earlier work arXiv:1910.08492, to study the propagation of randomness under…
As a generalization of random recursive trees and preferential attachment trees, we consider random recursive metric spaces. These spaces are constructed from random blocks, each a metric space equipped with a probability measure,…
It is known that a properly rescaled version of Sinai's random walk converges in distribution to Brox's diffusion. In this article we quantify this convergence by considering a specific coupling between Sinai's walk and Brox's diffusion.…
We consider the minimum of a super-critical branching random walk. Addario-Berry and Reed [Ann. Probab. 37 (2009) 1044-1079] proved the tightness of the minimum centered around its mean value. We show that a convergence in law holds, giving…
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
In this text we review a few structural properties of matrix models that should at least partly generalize to random tensor models. We review some aspects of the loop equations for matrix models and their algebraic counterpart for tensor…
We focus on recurrent random walks in random environment (RWRE) on Galton-Watson trees. The range of these walks, that is the number of sites visited at some fixed time, has been studied in three different papers [AC18], [AdR17] and [dR16].…