ترغب بنشر مسار تعليمي؟ اضغط هنا

Critical percolation and A+B --> 2A dynamics

91   0   0.0 ( 0 )
 نشر من قبل Matthew Junge
 تاريخ النشر 2019
  مجال البحث
والبحث باللغة English
 تأليف Matthew Junge




اسأل ChatGPT حول البحث

We study an interacting particle system in which moving particles activate dormant particles linked by the components of critical bond percolation. Addressing a conjecture from Beckman, Dinan, Durrett, Huo, and Junge for a continuous variant, we prove that the process can reach infinity in finite time i.e., explode. In particular, we prove that explosions occur almost surely on regular trees as well as oriented and unoriented two-dimensional integer lattices with sufficiently many particles per site. The oriented case requires an additional hypothesis about the existence and value of a certain critical exponent. We further prove that the process with one particle per site expands at a superlinear rate on integer lattices of any dimension. Some arguments use connections to critical first passage percolation, including a new result about the existence of an infinite path with finite passage time on the oriented two-dimensional lattice.



قيم البحث

اقرأ أيضاً

77 - Pengfei Tang 2020
Consider Bernoulli bond percolation a locally finite, connected graph $G$ and let $p_{mathrm{cut}}$ be the threshold corresponding to a first-moment method lower bound. Kahn (textit{Electron. Comm. Probab. Volume 8, 184-187.} (2003)) constructed a co unter-example to Lyons conjecture of $p_{mathrm{cut}}=p_c$ and proposed a modification. Here we give a positive answer to Kahns modified question. The key observation is that in Kahns modification, the new expectation quantity also appears in the differential inequality of one-arm events. This links the question to a lemma of Duminil-Copin and Tassion (textit{Comm. Math. Phys. Volume 343, 725-745.} (2016)). We also study some applications for Bernoulli percolation on periodic trees.
We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the field on th e one hand, and the links with potential theory for the associated diffusion on the other, we rigorously determine the behavior of various key quantities related to the (near-)critical regime for this model. In particular, our results apply in case the base graph is the three-dimensional cubic lattice. They unveil the values of the associated critical exponents, which are explicit but not mean-field and consistent with predictions from scaling theory below the upper-critical dimension.
We consider two-dimensional dependent dynamical site percolation where sites perform majority dynamics. We introduce the critical percolation function at time t as the infimum density with which one needs to begin in order to obtain an infinite open component at time t. We prove that, for any fixed time t, there is no percolation at criticality and that the critical percolation function is continuous. We also prove that, for any positive time, the percolation threshold is strictly smaller than the critical probability for independent site percolation.
We consider an inhomogeneous oriented percolation model introduced by de Lima, Rolla and Valesin. In this model, the underlying graph is an oriented rooted tree in which each vertex points to each of its $d$ children with `short edges, and in additio n, each vertex points to each of its $d^k$ descendant at a fixed distance $k$ with `long edges. A bond percolation process is then considered on this graph, with the prescription that independently, short edges are open with probability $p$ and long edges are open with probability $q$. We study the behavior of the critical curve $q_c(p)$: we find the first two terms in the expansion of $q_c(p)$ as $k to infty$, and prove that the critical curve lies strictly above the critical curve of a related branching process, in the relevant parameter region. We also prove limit theorems for the percolation cluster in the supercritical, subcritical and critical regimes.
56 - J. van den Berg , H. Don 2019
Consider critical site percolation on $mathbb{Z}^d$ with $d geq 2$. We prove a lower bound of order $n^{- d^2}$ for point-to-point connection probabilities, where $n$ is the distance between the points. Most of the work in our proof concerns a `const ruction which finally reduces the problem to a topological one. This is then solved by applying a topological fact, which follows from Brouwers fixed point theorem. Our bound improves the lower bound with exponent $2 d (d-1)$, used by Cerf in 2015 to obtain an upper bound for the so-called two-arm probabilities. Apart from being of interest in itself, our result gives a small improvement of the bound on the two-arm exponent found by Cerf.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا