𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Resistance distance in graphs and random walks

✍ Scribed by José Luis Palacios

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
151 KB
Volume
81
Category
Article
ISSN
0020-7608

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Resistance distance in regular graphs
Resistance distance in regular graphs
✍ I. Lukovits; S. Nikolić; N. Trinajstić 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB 👁 2 views

This report considers the resistance distance as a recently proposed new ## Ž . intrinsic metric on molecular graphs, and in particular, the sum R over resistance distances between all pairs of vertices is considered as a graph invariant. It has been vertices and K denotes a complete graph contai

Distance graphs with missing multiples i
Distance graphs with missing multiples in the distance sets
✍ Liu, Daphne D.-F.; Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 2 views

Given positive integers m, k, and s with m > ks, let D m,k,s represent the set {1, 2, . . . , m} -{k, 2k, . . . , sk}. The distance graph G(Z, D m,k,s ) has as vertex set all integers Z and edges connecting i and j whenever |i -j| ∈ D m,k,s . The chromatic number and the fractional chromatic number

Static and Dynamic Path Selection on Exp
Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach
✍ Andrei Z. Broder; Alan M. Frieze; Eli Upfal 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

This paper addresses the problem of virtual circuit switching in bounded degree expander graphs. We study the static and dynamic versions of this problem. Our solutions are based on the rapidly mixing properties of random walks on expander graphs. In the static version of the problem an algorithm is

Loop-erased self-avoiding random walks i
Loop-erased self-avoiding random walks in four and five dimensions
✍ Bradley, R. E.; Windwer, S. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 1 views

Monte Carlo simulations of loop-erased self-avoiding random walks in four and five dimensions were performed, using two distinct algorithms. We find consistency between these methods in their estimates of critical exponents. The upper critical dimension for this phenomenon is four, and it has been s