Short random walks on graphs

被引：20
|
作者：
Barnes, G
Feige, U
机构：
[1] MAX PLANCK INST INFORMAT, SAARBRUCKEN, GERMANY
[2] WEIZMANN INST SCI, DEPT MATH APPL, IL-76100 REHOVOT, ISRAEL
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 1996年 / 9卷 / 01期
关键词：
random walk; graph; Markov chain;
D O I：
10.1137/S0895480194264988
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The short-term behavior of random walks on graphs is studied, in particular, the rate at which a random walk discovers new vertices and edges. A conjecture by Linial, that the expected time to find N distinct vertices is O(N-3) is proved. In addition, upper bounds of O(M(2)) on the expected time to traverse M edges and of O(MN) on the expected time to either visit N vertices or traverse M edges (whichever comes first) are proved.
引用
收藏
页码：19 / 28
页数：10
相关论文
共 50 条
  • [41] Random Walks on Randomly Evolving Graphs
    Cai, Leran
    Sauerwald, Thomas
    Zanetti, Luca
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2020, 2020, 12156 : 111 - 128
  • [42] Random Walks on Directed Covers of Graphs
    Lorenz A. Gilch
    Sebastian Müller
    Journal of Theoretical Probability, 2011, 24 : 118 - 149
  • [43] The Einstein relation for random walks on graphs
    Teles, A
    JOURNAL OF STATISTICAL PHYSICS, 2006, 122 (04) : 617 - 645
  • [44] On distributions computable by random walks on graphs
    Kindler, G
    Romik, D
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2004, 17 (04) : 624 - 633
  • [45] Congestion Transition on Random Walks on Graphs
    Di Meco, Lorenzo
    Esposti, Mirko Degli
    Bellisardi, Federico
    Bazzani, Armando
    ENTROPY, 2024, 26 (08)
  • [46] Gillis's random walks on graphs
    Guillotin-Plantard, N
    JOURNAL OF APPLIED PROBABILITY, 2005, 42 (01) : 295 - 301
  • [47] Random walks in time-graphs
    INRIA, Sophia Antipolis, France
    不详
    不详
    Int. Workshop Mob. Opportunistic Networking, MobiOpp, 1600, (93-100):
  • [48] Reconstruction of graphs based on random walks
    Wittmann, Dominik M.
    Schmidl, Daniel
    Bloechl, Florian
    Theis, Fabian J.
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3826 - 3838
  • [49] Random walks on Coxeter interchange graphs
    Buckland, Matthew
    Kolesnik, Brett
    Mitchell, Rivka
    Przybylowski, Tomasz
    ELECTRONIC JOURNAL OF PROBABILITY, 2025, 30
  • [50] Random Walks with Lookahead on Power Law Random Graphs
    Mihail, Milena
    Saberi, Amin
    Tetali, Prasad
    INTERNET MATHEMATICS, 2006, 3 (02) : 147 - 152
12345