𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Restricted random walks on a graph

✍ Scribed by F. Y. Wu; H. Kunz

Publisher
Springer
Year
1999
Tongue
English
Weight
338 KB
Volume
3
Category
Article
ISSN
0218-0006

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Random walks on a finite oriented graph
Random walks on a finite oriented graph
✍ S. V. Troyanovskii; V. R. Krasheninnikov πŸ“‚ Article πŸ“… 1973 πŸ› Springer US 🌐 English βš– 291 KB
Classification by restricted random walk
Classification by restricted random walks
✍ Joachim SchΓΆll; Elisabeth SchΓΆll-Paschinger πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 311 KB
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

Graph homomorphisms through random walks
Graph homomorphisms through random walks
✍ Amir Daneshgar; Hossein Hajiabolhassan πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 174 KB

## Abstract In this paper we introduce some general necessary conditions for the existence of graph homomorphisms, which hold in both directed and undirected cases. Our method is a combination of Diaconis and Saloff–Coste comparison technique for Markov chains and a generalization of Haemers interl