Article

Reachability on scale-free networks

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

Random walk on discrete lattices is a fundamental model in physics that forms the basis for our understanding of transport and diffusion process. In this work, we study unreachability in networks, {\it i.e}, the number of nodes not visited by any walkers until some finite time. We show that for the case of multiple random walkers on scale-free networks, the fraction of sites not visited is well approximated by a stretched exponential function. We also discuss some preliminary results for distinct sites visited on time-varying networks.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
We study the number of distinct sites visited by N random walkers after t steps SN(t) under the condition that all the walkers are initially at the origin. We derive asymptotic expressions for the mean number of distinct sites SN(t) in one, two, and three dimensions. We find that SN(t) passes through several growth regimes; at short times SN(t)td (regime I), for txttx we find that SN(t)(t ln[N S1(t)/td/2])d/2 (regime II), and for ttx, SN(t)NS1(t) (regime III). The crossover times are txln N for all dimensions, and tx, exp N, and N2 for one, two, and three dimensions, respectively. We show that in regimes II and III SN(t) satisfies a scaling relation of the form SN(t)td/2f(x), with xNS1(t)/td/2. We also obtain asymptotic results for the complete probability distribution of SN(t) for the one-dimensional case in the limit of large N and t.
Article
This chapter explains the two-dimensional (2D) random walk, which has been used in many ecological studies to study the movement of animals, as well as in polymer science. It considers five types of 2D random walk, which are as follows: Pearson random walk; symmetric random walk (SRW); alternating random walk (ARW); self-avoiding random walk (SAW) and nonreversing random walk (NRRW). The chapter briefly discusses two extension of the NRRW. These are: noncontinuing random walk (NCRW) and nonreversing and noncontinuing random walk (NRNCRW).
Article
Coupled biological and chemical systems, neural networks, social interacting species, the Internet and the World Wide Web, are only a few examples of systems composed by a large number of highly interconnected dynamical units. The first approach to capture the global properties of such systems is to model them as graphs whose nodes represent the dynamical units, and whose links stand for the interactions between them. On the one hand, scientists have to cope with structural issues, such as characterizing the topology of a complex wiring architecture, revealing the unifying principles that are at the basis of real networks, and developing models to mimic the growth of a network and reproduce its structural properties. On the other hand, many relevant questions arise when studying complex networks’ dynamics, such as learning how a large ensemble of dynamical systems that interact through a complex wiring topology can behave collectively. We review the major concepts and results recently achieved in the study of the structure and dynamics of complex networks, and summarize the relevant applications of these ideas in many different disciplines, ranging from nonlinear science to biology, from statistical mechanics to medicine and engineering.
Book
This book is a second edition, updated and expanded to explain the technologies that help us find information on the web. Search engines and web navigation tools have become ubiquitous in our day to day use of the web as an information source, a tool for commercial transactions and a social computing tool. Moreover, through the mobile web we have access to the web's services when we are on the move. This book demystifies the tools that we use when interacting with the web, and gives the reader a detailed overview of where we are and where we are going in terms of search engine and web navigation technologies.
  • Karl Pearson
Karl Pearson, Nature 72, 294 (1905).
  • A Edward
  • Codling
  • J Michael
  • Simon Plank
  • Benhamou
Edward A Codling, Michael J Plank and Simon Benhamou, J. R. Soc. Interface 5, 813 (2008).
  • L Lu
L. Lu et. al., Phys. Rep. 519, 1 (2012).
  • O Bnichou
  • C Loverdo
  • M Moreau
  • R Voituriez
O. Bnichou, C. Loverdo, M. Moreau, and R. Voituriez, Rev. Mod. Phys. 83, 81 (2011).
  • J D Noh
  • H Reiger
J. D. Noh and H. Reiger, Phys. Rev. Lett. 92, 118701 (2004);
  • Ernesto Estrada
  • Naomichi Hatano
  • Michele Benzi
Ernesto Estrada, Naomichi Hatano, Michele Benzi, Phys. Rep. 514, 89 (2012).
  • V Kishore
  • M S Santhanam
  • R E Amritkar
V. Kishore, M. S. Santhanam and R. E. Amritkar, Phys. Rev. Lett. X XXX (2011);
  • D. De Martino
D. De Martino et. al., Phys. Rev. E 79, 015101(R) (2009);
  • P Echenique
P. Echenique et. al., EPL 71, 325 (2005).
  • M Argollo De Menezes
  • A L Barabsi
M. Argollo de Menezes and A.L. Barabsi, Phys. Rev. Lett. 92, 028701 (2004);
  • S Lee
  • S-H Yook
  • Y Kim
S. Lee, S-H Yook and Y. Kim, Physica A 387, 3033 (2008).
  • E Almaas
  • R V Kulkarni
  • D Stroud
E. Almaas, R. V. Kulkarni and D. Stroud, Phys. Rev. E 68, 056105 (2003).
  • T J Perkins
  • E Foxall
  • L Glass
  • R Edwards
T. J. Perkins, E. Foxall, L. Glass and R. Edwards, Nature Comm. 5, 5121 (2014).
  • Peter Holme
  • Jari Saramaki
Peter Holme and Jari Saramaki, Phys. Rep. 519, 97 (2012).
  • A Kundu
  • S N Majumdar
  • G Schehr
A. Kundu, S.N. Majumdar, and G. Schehr, Phys. Rev. Lett. 110, 220602 (2013).
  • H W Lau
  • K Y Szeto
H. W. Lau and K. Y. Szeto, EPL 90 40005 (2010).