Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful

被引：0
作者：
Cooper, Colin [1 ]
机构：
[1] Kings Coll London, Dept Informat, London WC2R 2LS, England
来源：
STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY | 2011年 / 6796卷
关键词：
COVER TIME; GRAPHS; MODEL;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：1 / 14
页数：14
相关论文
共 45 条
  • [31] Distributed probabilistic polling and applications to proportionate agreement
    Hassin, Y
    [J]. INFORMATION AND COMPUTATION, 2001, 171 (02) : 248 - 268
  • [32] Expander graphs and their applications
    Hoory, Shlomo
    Linial, Nathan
    Wigderson, Avi
    [J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 2006, 43 (04) : 439 - 561
  • [33] Ikeda S, 2003, LECT NOTES COMPUT SC, V2719, P1054
  • [34] Ikeda S., 2002, IEEE T PARALLEL DIST, V13
  • [35] ISRAELI A, 1990, PROCEEDINGS OF THE NINTH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, P119, DOI 10.1145/93385.93409
  • [36] The cover time, the blanket time, and the Matthews bound
    Kahn, J
    Kim, JH
    Lovász, L
    Vu, VH
    [J]. 41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, : 467 - 475
  • [37] Gossip-based computation of aggregate information
    Kempe, D
    Dobra, A
    Gehrke, J
    [J]. 44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 482 - 491
  • [38] Koba K., 2010, RANDOM WALKS DYNAMIC
  • [39] Kuhn F, 2007, SPAA'07: PROCEEDINGS OF THE NINETEENTH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, P145
  • [40] Lovasz L, 1996, BOLYAI MATH STUD, V2, P353
12345