Related papers: Traces left by random walks on large random graphs…
We define two families of Poissonian soups of bidirectional trajectories on $\mathbb{Z}^2$, which can be seen to adequately describe the local picture of the trace left by a random walk on the two-dimensional torus $(\mathbb{Z}/N…
This paper is concerned with the limit theory of the extreme order statistics derived from random walks. We establish the joint convergence of the order statistics near the minimum of a random walk in terms of the Feller chains. Detailed…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
We study the behaviour of a sequence of biased random walks X(i), i>=0 on a sequence of random graphs, where the initial graph is Zd and otherwise the graph for the i-th walk is the trace of the (i - 1)-st walk. The sequence of bias vectors…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
We define the model of two-dimensional random interlacements using simple random walk trajectories conditioned on never hitting the origin, and then obtain some properties of this model. Also, for random walk on a large torus conditioned on…
We present an algorithm to grow a graph with scale-free structure of {\it in-} and {\it out-links} and variable wiring diagram in the class of the world-wide Web. We then explore the graph by intentional random walks using local…
In this note, we try to analyze and clarify the intriguing interplay between some counting problems related to specific thermalized weighted graphs and random walks consistent with such graphs.
Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…
We consider random walks in dynamic random environments and propose a criterion which, if satisfied, allows to decompose the random walk trajectory into i.i.d. increments, and ultimately to prove limit theorems. The criterion involves the…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We show that the Bernoulli part extraction method can be used to obtain approximate forms of the local limit theorem for sums of independent lattice valued random variables, with effective error term, that is with explicit parameters and…
We consider the range of random walks up to time n, R_n, on graphs satisfying a uniform condition. This condition is characterized by potential theory. Not only all vertex transitive graphs but also many non-regular graphs satisfy the…
Graph embedding has recently gained momentum in the research community, in particular after the introduction of random walk and neural network based approaches. However, most of the embedding approaches focus on representing the local…
Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…
We introduce random walks in a sparse random environment on $\mathbb Z$ and investigate basic asymptotic properties of this model, such as recurrence-transience, asymptotic speed, and limit theorems in both the transient and recurrent…
We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are…
Our objective is to explore random walks on the general linear group, constrained to a specific domain, with a primary focus on establishing the conditioned local limit theorem. This paper marks the initial stride toward achieving this…