Contact process on regular tree with random vertex weights

被引:1
|
作者
Pan, Yu [1 ]
Chen, Dayue [1 ]
Xue, Xiaofeng [2 ]
机构
[1] Peking Univ, LMAM, Beijing 100871, Peoples R China
[2] Beijing Jiaotong Univ, Sch Sci, Beijing 100044, Peoples R China
基金
中国国家自然科学基金;
关键词
Contact process; random vertex weights; critical value; asymptotic behavior; RANDOM ENVIRONMENT; SURVIVAL;
D O I
10.1007/s11464-017-0633-4
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This paper is concerned with the contact process with random vertex weights on regular trees, and studies the asymptotic behavior of the critical infection rate as the degree of the trees increasing to infinity. In this model, the infection propagates through the edge connecting vertices x and y at rate lambda rho(x)rho(y) for some lambda > 0, where {rho(x), x is an element of T-d} are independent and identically distributed (i.i.d.) vertex weights. We show that when d is large enough, there is a phase transition at lambda(c)(d) is an element of (0,infinity) such that for lambda < lambda(c)(d), the contact process dies out, and for lambda > lambda(c)(d), the contact process survives with a positive probability. Moreover, we also show that there is another phase transition at lambda(e)(d) such that for lambda < lambda(e)(d), the contact process dies out at an exponential rate. Finally, we show that these two critical values have the same asymptotic behavior as d increases.
引用
收藏
页码:1163 / 1181
页数:19
相关论文
共 50 条
  • [41] Edge weights and vertex colours
    Karonski, M
    Luczak, T
    Thomason, A
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 91 (01) : 151 - 157
  • [42] Contact process in an evolving random environment
    Seiler, Marco
    Sturm, Anja
    ELECTRONIC JOURNAL OF PROBABILITY, 2023, 28
  • [43] THE CONTACT PROCESS IN A DYNAMIC RANDOM ENVIRONMENT
    Remenik, Daniel
    ANNALS OF APPLIED PROBABILITY, 2008, 18 (06): : 2392 - 2420
  • [44] Universality of the contact process with random dilution
    de Oliveira, Marcelo M.
    Ferreira, Silvio C.
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
  • [45] Combinatorial algorithms for the minmax robust median subtree problem on tree networks with interval vertex weights
    Nguyen, Kien Trung
    Nguyen-Thu, Huong
    Le, Huy Minh
    Hiep, Tran Thanh
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2025, 18 (02)
  • [46] Contact Processes with Random Recovery Rates and Edge Weights on Complete Graphs
    Xue, Xiaofeng
    Pan, Yu
    JOURNAL OF STATISTICAL PHYSICS, 2017, 169 (05) : 951 - 971
  • [47] Contact Processes with Random Recovery Rates and Edge Weights on Complete Graphs
    Xiaofeng Xue
    Yu Pan
    Journal of Statistical Physics, 2017, 169 : 951 - 971
  • [48] Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights
    Bhattacharya, Binay
    Kameda, Tsunehiko
    Song, Zhao
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 588 - 597
  • [49] Vertex-reinforced random walk on Z with sub-square-root weights is recurrent
    Chen, Jun
    Kozma, Gady
    COMPTES RENDUS MATHEMATIQUE, 2014, 352 (06) : 521 - 524
  • [50] Law of large numbers for the SIR model with random vertex weights on Erdos-Renyi graph
    Xue, Xiaofeng
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2017, 486 : 434 - 445