相关论文: Tree walks and the spectrum of random graphs

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

We study simple random walk on the uniform spanning tree on Z^2 . We obtain estimates for the transition probabilities of the random walk, the distance of the walk from its starting point after n steps, and exit times of both Euclidean…

We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…

This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…

We study lower bounds for the problem of approximating a one dimensional distribution given (noisy) measurements of its moments. We show that there are distributions on $[-1,1]$ that cannot be approximated to accuracy $\epsilon$ in…

We introduce a technique using nonbacktracking random walk for estimating the spectral radius of simple random walk. This technique relates the density of nontrivial cycles in simple random walk to that in nonbacktracking random walk. We…

We consider biased random walk on regular tree and we obtain the spectral radius, first return probability and $n$-step transition probability.

We consider random walks on a tree $G=(V,E)$ with stationary distribution $\pi_v = \mathrm{deg}(v)/2|E|$ for $v \in V$. Let the hitting time $H(v,w)$ denote the expected number of steps required for the random walk started at vertex $v$ to…

Several well-known results from the random matrix theory, such as Wigner's law and the Marchenko--Pastur law, can be interpreted (and proved) in terms of non-backtracking walks on a certain graph. Orthogonal polynomials with respect to the…

We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…

We define a new stochastic process on general simplicial complexes which allows to study their spectral and homological properties. Some results for random walks on graphs are shown to hold in this general setting. As an application, the…

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 the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of $n$ random points in a compact set $\Omega_n$ of $\R^d$. Under various assumptions we establish the…

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…

A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong…

We study random walks on the giant component of the Erd\H{o}s-R\'enyi random graph ${\cal G}(n,p)$ where $p=\lambda/n$ for $\lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently…

In this paper we consider the relation between the spectrum and the number of short cycles in large graphs. Suppose $G_1, G_2, G_3, \ldots$ is a sequence of finite and connected graphs that share a common universal cover $T$ and such that…

We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…

Given an integer $n$, let $G(n)$ be the number of integer sequences $n-1\ge d_1\ge d_2\ge\dotsb\ge d_n\ge 0$ that are the degree sequence of some graph. We show that $G(n)=(c+o(1))4^n/n^{3/4}$ for some constant $c>0$, improving both the…