✦ LIBER ✦

Exploring complex networks through random walks

✍ Scribed by Costa, Luciano da Fontoura; Travieso, Gonzalo

Book ID: 118164735
Publisher: The American Physical Society
Year: 2007
Tongue: English
Weight: 262 KB
Volume: 75
Category: Article
ISSN: 1063-651X
DOI: 10.1103/physreve.75.016102

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Load-dependent random walks on complex n

Load-dependent random walks on complex networks

✍ L. Wu; S. Zhu 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 452 KB

Centrality measure of complex networks u

Centrality measure of complex networks using biased random walks

✍ S. Lee; S.-H. Yook; Y. Kim 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 352 KB

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

Exploring complex networks

✍ Strogatz, Steven H. 📂 Article 📅 2001 🏛 Nature Publishing Group 🌐 English ⚖ 589 KB

A model of self-avoiding random walks fo

A model of self-avoiding random walks for searching complex networks

✍ Víctor M. López Millán; Vicent Cholvi; Luis López; Antonio Fernández Anta 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

Random walk networks

✍ Bartolo Luque; Fernando J. Ballesteros 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 286 KB