相关论文: Distribution of sizes of erased loops for loop-era…

The loop-erased random walk (LERW) in $\mathbb{Z}^4$ is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by $(\log n)^{\frac{1}{3}}$ converges almost…

We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…

Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free…

The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…

The probability distribution of the number $s$ of distinct sites visited up to time $t$ by a random walk on the fully-connected lattice with $N$ sites is first obtained by solving the eigenvalue problem associated with the discrete master…

Sharp estimates for the length of loop erased random walk between two vertices on the [n]^d -torus, d > 4, are established. The mean length is order n^{d/2} . In dimension 4 we have only an upper bound.

We study the set ${\cal L}(G)$ of lengths of all cycles that appear in a random $d$-regular $G$ on $n$ vertices for a fixed $d\geq 3$, as well as in Erd\H{o}s--R\'enyi random graphs on $n$ vertices with a fixed average degree $c>1$.…

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…

We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…

We give evidence that the functional renormalization group (FRG), developed to study disordered systems, may provide a field theoretic description for the loop-erased random walk (LERW), allowing to compute its fractal dimension in a…

The loop-erased random walk (LERW) in $ \Z^d, d \geq 2$, is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW…

We propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding. The FRTD assigns a probability mass function to each node, allowing us to define a distance between any…

Given a spanning forest on a large square lattice, we consider by combinatorial methods a correlation function of $k$ paths ($k$ is odd) along branches of trees or, equivalently, $k$ loop--erased random walks. Starting and ending points of…

Starting from a sequence regarded as a walk through some set of values, we consider the associated loop-erased walk as a sequence of directed edges, with an edge from $i$ to $j$ if the loop erased walk makes a step from $i$ to $j$. We…

Let $M$ be the infinite spanning-tree-weighted random planar map, which is the local limit of finite random planar maps sampled with probability proportional to the number of spanning trees they admit. We show that a.s. the…

The probability distribution of random walks on linear structures generated by random walks in $d$-dimensional space, $P_d(r,t)$, is analytically studied for the case $\xi\equiv r/t^{1/4}\ll1$. It is shown to obey the scaling form…

Loop-erased random walk and it's scaling limit, Schramm--Loewner evolution, have found numerous applications in mathematics and physics. We present a 2 dimensional analogue of LERW, the loop erased random surface. We do this by defining a 2…

We investigate the relation between simple random walks on repeated barycentric subdivisions of a triangle and a self-similar fractal, Strichartz hexacarpet, which we introduce. We explore a graph approximation to the hexacarpet in order to…

We compute a number of distance-dependent universal scaling functions characterizing the distance statistics of large maps of genus one. In particular, we obtain explicitly the probability distribution for the length of the shortest…

This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the…