This paper looks at random regular simple graphs and considers nearest neighbor random walks on such graphs. This paper considers walks where the degree d of each vertex is around (logn)", where a is a constant which is at least 2 and where n is the number of vertices. By extending techniques of Dou
Isoperimetric inequalities and random walks on quotients of graphs and buildings
β Scribed by Enrico Leuzinger
- Publisher
- Springer-Verlag
- Year
- 2004
- Tongue
- French
- Weight
- 148 KB
- Volume
- 248
- Category
- Article
- ISSN
- 0025-5874
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Fuchsian groups (acting as isometries of the hyperbolic plane) occur naturally in geometry, combinatorial group theory, and other contexts. We use character-theoretic and probabilistic methods to study the spaces of homomorphisms from Fuchsian groups to symmetric groups. We obtain a wide variety of
We study random walks and electrical resistances between pairs of vertices in products of graphs. Among the results we prove are the following. ( 1) In a graph G x P, where P is a path with endvertices x and y, and G is any graph, with vertices n and b, the resistance between vertices (a,~) and (b,c