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 条
  • [1] Adler M., 2003, STOC, P575, DOI DOI 10.1145/780542.780626
  • [2] Aldous D.J., 2001, REVERSIBLE MARKOV CH
  • [3] MEETING TIMES FOR INDEPENDENT MARKOV-CHAINS
    ALDOUS, DJ
    [J]. STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 1991, 38 (02) : 185 - 193
  • [4] Aleliunas Romas., 1979, Proceedings of the 20th Symposium on Foundations of Computer Science (FOCS), P218, DOI [10.1109/SFCS.1979.34, DOI 10.1109/SFCS.1979.34]
  • [5] Non-backtracking random walks mix faster
    Alon, Noga
    Benjamini, Itai
    Lubetzky, Eyal
    Sodin, Sasha
    [J]. COMMUNICATIONS IN CONTEMPORARY MATHEMATICS, 2007, 9 (04) : 585 - 603
  • [6] Alon N, 2008, SPAA'08: PROCEEDINGS OF THE TWENTIETH ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, P119
  • [7] Randomized protocols for asynchronous consensus
    Aspnes, J
    [J]. DISTRIBUTED COMPUTING, 2003, 16 (2-3) : 165 - 175
  • [8] Avin C, 2008, LECT NOTES COMPUT SC, V5125, P121, DOI 10.1007/978-3-540-70575-8_11
  • [9] Avin Chen., 2006, P 9 ACM INT S MODELI, P219
  • [10] Parsimonious Flooding in Dynamic Graphs
    Baumann, Herve
    Crescenzi, Pierluigi
    Fraigniaud, Pierre
    [J]. PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2009, : 260 - 269
12345