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 条
  • [31] THE CONTACT PROCESS IN A RANDOM ENVIRONMENT
    BRAMSON, M
    DURRETT, R
    SCHONMANN, RH
    ANNALS OF PROBABILITY, 1991, 19 (03): : 960 - 983
  • [32] MINIMAX WEIGHTS IN A TREND DETECTION PROBLEM OF A RANDOM PROCESS
    LEGOSTAEVA, IL
    SHIRYAEV, AN
    THEORY OF PROBILITY AND ITS APPLICATIONS,USSR, 1971, 16 (02): : 344 - +
  • [33] THE CRITICAL CONTACT PROCESS ON A HOMOGENEOUS TREE
    MORROW, GJ
    SCHINAZI, RB
    ZHANG, Y
    JOURNAL OF APPLIED PROBABILITY, 1994, 31 (01) : 250 - 255
  • [34] Record process on the Continuum Random Tree
    Abraham, Romain
    Delmas, Jean-Francois
    ALEA-LATIN AMERICAN JOURNAL OF PROBABILITY AND MATHEMATICAL STATISTICS, 2013, 10 (01): : 225 - 251
  • [35] The semi-random tree process
    Burova, Sofiya
    Lichev, Lyuben
    EUROPEAN JOURNAL OF COMBINATORICS, 2025, 126
  • [36] The Matching Process and Independent Process in Random Regular Graphs and Hypergraphs
    Bal, Deepak
    Bennett, Patrick
    ELECTRONIC JOURNAL OF COMBINATORICS, 2023, 30 (01):
  • [37] Continuum tree limit for the range of random walks on regular trees
    Duquesne, T
    ANNALS OF PROBABILITY, 2005, 33 (06): : 2212 - 2254
  • [38] MINIMAL SPANNING TREE ANALYSIS OF REGULAR, RANDOM AND CLUSTER STRUCTURES
    DUSSERT, C
    RASIGNI, G
    RASIGNI, M
    PALMARI, J
    LLEBARIA, A
    ZEITSCHRIFT FUR PHYSIK D-ATOMS MOLECULES AND CLUSTERS, 1989, 12 (1-4): : 41 - 44
  • [39] Path languages of random permitting context tree grammars are regular
    Drewes, Frank
    van der Merwe, Brink
    FUNDAMENTA INFORMATICAE, 2008, 82 (1-2) : 47 - 60
  • [40] A combinatorial Laplacian with vertex weights
    Chung, FRK
    Langlands, RP
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1996, 75 (02) : 316 - 327