𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random walks and local cuts in graphs

✍ Scribed by Fan Chung

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
144 KB
Volume
423
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Random walks on random simple graphs
Random walks on random simple graphs
✍ Martin Hildebrand πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 676 KB

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

Random walks and orthogonal functions as
Random walks and orthogonal functions associated with highly symmetric graphs
✍ Peter F. Stadler πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 374 KB

The relationship of orthogonal functions associated with vertex transitive graphs and random walks on such graphs is investigated. We use this relationship to characterize the exponentially decaying autocorrelation functions along random walks on isotropic random fields defined on vertex transitive

Matchings and walks in graphs
Matchings and walks in graphs
✍ C. D. Godsil πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 527 KB

## Abstract The matching polynomial Ξ±(__G, x__) of a graph __G__ is a form of the generating function for the number of sets of __k__ independent edges of __G__. in this paper we show that if __G__ is a graph with vertex __v__ then there is a tree __T__ with vertex __w__ such that \documentclass{ar