Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userApproximation for extinction probability of the contact process based on the Grobner basis
تقدير احتمالية الانقراض لعملية الاتصال بناءً على مبنى الجروبنر
195
0
0.0
(
0
)
Authors
Norio Konno
Ask ChatGPT about the research
في هذه المذكرة، نقدم طريقة جديدة للحصول على سلسلة من التقاربات لاحتمال الانقراض لعملية الاتصال المتعددة الأبعاد باستخدام مبنى Grobner.
In this note we give a new method for getting a series of approximations for the extinction probability of the one-dimensional contact process by using the Grobner basis.
rate research
Read More
We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the integer line, in each case we prove that the logarithm of the extinction time divided by the size of the graph converges in probability to a (model-dependent) positive constant. The graphs we treat include various percolation models on increasing boxes of Z d or R d in their supercritical or percolative regimes (Bernoulli bond and site percolation, the occupied and vacant sets of random interlacements, excursion sets of the Gaussian free field, random geometric graphs) as well as supercritical Galton-Watson trees grown up to finite generations.
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{e}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a metastable result for the extinction time is also proved.
We introduce a method to prove metastability of the contact process on ErdH{o}s-Renyi graphs and on configuration model graphs. The method relies on uniformly bounding the total infection rate from below, over all sets with a fixed number of nodes. Once this bound is established, a simple comparison with a well chosen birth-and-death process will show the exponential growth of the extinction time. Our paper complements recent results on the metastability of the contact process: under a certain minimal edge density condition, we give explicit lower bounds on the infection rate needed to get metastability, and we have explicit exponentially growing lower bounds on the expected extinction time.
We view the classical Lindeberg principle in a Markov process setting to establish a universal probability approximation framework by It^{o}s formula and Markov semigroup. As applications, we consider approximating a family of online stochastic gradient descents (SGDs) by a stochastic differential equation (SDE) driven by additive Brownian motion, and obtain an approximation error with explicit dependence on the dimension which makes it possible to analyse high dimensional models. We also apply our framework to study stable approximation and normal approximation and obtain their optimal convergence rates (up to a logarithmic correction for normal approximation).
A little over 25 years ago Pemantle pioneered the study of the contact process on trees, and showed that on homogeneous trees the critical values $lambda_1$ and $lambda_2$ for global and local survival were different. He also considered trees with periodic degree sequences, and Galton-Watson trees. Here, we will consider periodic trees in which the number of children in successive generation is $(n,a_1,ldots, a_k)$ with $max_i a_i le Cn^{1-delta}$ and $log(a_1 cdots a_k)/log n to b$ as $ntoinfty$. We show that the critical value for local survival is asymptotically $sqrt{c (log n)/n}$ where $c=(k-b)/2$. This supports Pemantles claim that the critical value is largely determined by the maximum degree, but it also shows that the smaller degrees can make a significant contribution to the answer.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
