Random Walk on Directed Dynamic Graphs

Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the undirected dynamic graph model. However, realistic networks suc...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Denysyuk, Oksana, Rodrigues, Luis
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 01.02.2011
Subjects
Graphs
Mobile ad hoc networks
Random walk
Social networks
Upper bounds
Wireless networks
Online AccessGet full text

Cover

More Information
Summary:Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the undirected dynamic graph model. However, realistic networks such as the ones identified above are directed. In this paper we present early work in addressing the properties of directed dynamic graphs. In particular, we explore the problem of random walk in such graphs. We assume the existence of an oblivious adversary that makes arbitrary changes in every communication round. We explore the problem of covering the dynamic graph, that even in the static case can be exponential, and we establish an upper bound O(d_max n^3 log^2 n) of the cover time for balanced dynamic graphs.
ISSN:2331-8422