Remarks on random walks on graphs and the Floyd boundary (original) (raw)
Related papers
On the asymptotic spectrum of random walks on infinite families of graphs
Random walks and discrete potential …, 1999
Abstract. We observe that the spectral measure of the Markov operator depends continuously on the graph in the space of graphs with uniformly bounded degree. We investigate the behaviour of the largest eigenvalue and the density of eigenvalues for ...
Random walks on graphs: ideas, techniques and results
Journal of Physics A: Mathematical and General, 2005
Random walks on graphs are widely used in all sciences to describe a great variety of phenomena where dynamical random processes are affected by topology. In recent years, relevant mathematical results have been obtained in this field, and new ideas have been introduced, which can be fruitfully extended to different areas and disciplines. Here we aim at giving a brief but comprehensive perspective of these progresses, with a particular emphasis on physical aspects. Contents 1 Introduction 2 Mathematical description of graphs 3 The random walk problem 4 The generating functions 5 Random walks on finite graphs 6 Infinite graphs 7 Random walks on infinite graphs 8 Recurrence and transience: the type problem 9 The local spectral dimension 10 Averages on infinite graphs 11 The type problem on the average 1 12 The average spectral dimension 21 13 A survey of analytical results on specific networks 23 13.1 Renormalization techniques. .
A note on recurrent random walks on graphs
Journal of Statistical Physics, 1990
We consider random walks on polynomially growing graphs for which the resistances are also polynomially growing. In this setting we can show the same relation that was found earlier but that needed more complex conditions. The diffusion speed is determined by the geometric and resistance properties of the graph.
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2009
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graph G = (V, E), let d G (v) denote the degree of vertex v for all v ∈ V. The random walk W v = (W v (t), t = 0, 1,. . .) is defined as follows: W v (0) = v and given x = W v (t), W v (t + 1) is a randomly chosen neighbour of x. When one thinks of a random walk, one often thinks of Polya's Classical result for a walk on the d-dimensional lattice Z d , d ≥ 1. In this graph two vertices x = (x 1 , x 2 ,. .. , x d) and y = (y 1 , y 2 ,. .. , y d) are adjacent iff there is an index i such that (i) x j = y j for j = i and (ii) |x i − y i | = 1. Polya [33] showed that if d ≤ 2 then a walk starting at the origin returns to the origin with probability 1 and that if d ≥ 3 then it returns with probability p(d) < 1. See also Doyle and Snell [22]. A random walk on a graph G defines a Markov chain on the vertices V. If G is a finite, connected and non-bipartite graph, then this chain has a stationary distribution π given by π v = d G (v)/(2|E|). Thus if P (t) v (w) = Pr(W v (t) = w), then lim t→∞ P (t) v (w) = π w , independent of the starting vertex v. In this paper we only consider finite graphs, and we will focus on two aspects of a random walk: The Mixing Time and the Cover Time.
Random walk on graphs with regular resistance and volume growth
Annales de l'Institut Henri Poincare (B) Probability and Statistics, 2008
In this paper characterizations of graphs satisfying heat kernel estimates for a wide class of space-time scaling functions are given. The equivalence of the two-sided heat kernel estimate and the parabolic Harnack inequality is also shown via the equivalence of the upper (lower) heat kernel estimate to the parabolic mean value (and super mean value) inequality.
Random Walks in a Dirichlet Environment
Electronic Journal of Probability, 2006
This paper states a law of large numbers for a random walk in a random iid environment on Z d , where the environment follows some Dirichlet distribution. Moreover, we give explicit bounds for the asymptotic velocity of the process and also an asymptotic expansion of this velocity at low disorder
Random walks on the finite components of
2005
The expected n-step return-probability EµP o [ ˆ Xn = o] of a random walk ˆ Xn with symmetric transition probabilities on a random partial graph of a regular graph G of degree δ with transitive automorphism group Aut(G) is considered. The law µ of the random edge-set is assumed to be stationary with respect to some transitive, unimodular subgroup Γ of Aut(G). By the spectral theory of finite random walks, using interlacing techniques, bounds in terms of functionals of the cluster size are obtained: