We study a new geometric bootstrap percolation model,
We consider a dynamical process on a graph
- Award ID(s):
- 1855745
- NSF-PAR ID:
- 10121819
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- Random Structures & Algorithms
- Volume:
- 56
- Issue:
- 1
- ISSN:
- 1042-9832
- Page Range / eLocation ID:
- p. 63-96
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
Abstract line percolation , on thed ‐dimensional integer grid. In line percolation with infection parameter r , infection spreads from a subsetof initially infected lattice points as follows: if there exists an axis‐parallel line L withr or more infected lattice points on it, then every lattice point ofon L gets infected, and we repeat this until the infection can no longer spread. The elements of the setA are usually chosen independently, with some densityp , and the main question is to determine, the density at which percolation (infection of the entire grid) becomes likely. In this paper, we determine up to a multiplicative factor of and up to a multiplicative constant as for every fixed . We also determine the size of the minimal percolating sets in all dimensions and for all values of the infection parameter. -
more » « less
We consider instances of long‐range percolation on
and , where points at distance r get connected by an edge with probability proportional tor −s , fors ∈ (d ,2d ), and study the asymptotic of the graph‐theoretical (a.k.a. chemical) distanceD (x ,y ) betweenx andy in the limit as |x −y |→∞ . For the model onwe show that, in probability as | x |→∞ , the distanceD (0,x ) is squeezed between two positive multiples of, where for γ : =s /(2d ). For the model onwe show that D (0,xr ) is, in probability asr →∞ for any nonzero, asymptotic to for φ a positive, continuous (deterministic) function obeyingφ (r γ ) =φ (r ) for allr > 1. The proof of the asymptotic scaling is based on a subadditive argument along a continuum of doubly‐exponential sequences of scales. The results strengthen considerably the conclusions obtained earlier by the first author. Still, significant open questions remain. -
more » « less
In this paper, we explore the interplay of virus contact rate, virus production rates, and initial viral load during early HIV infection. First, we consider an early HIV infection model formulated as a bivariate branching process and provide conditions for its criticality
R 0 > 1. Using dimensionless rates, we show that the criticality conditionR 0 > 1 defines a threshold on the target cell infection rate in terms of the infected cell removal rate and virus production rate. This result has motivated us to introduce two additional models of early HIV infection under the assumption that the virus contact rate is proportional to the target cell infection probability (denoted by). Using the second model, we show that the length of the eclipse phase of a newly infected host depends on the target cell infection probability, and the corresponding deterministic equations exhibit bistability. Indeed, occurrence of viral invasion in the deterministic dynamics depends on R 0and the initial viral loadV 0. If the viral load is small enough, eg,V 0 ≪θ , then there will be extinction regardless of the value ofR 0. On the other hand, if the viral load is large enough, eg,V 0 ≫θ andR 0 > 1, then there will be infection. Of note,V 0≈θ corresponds to a threshold regime above which virus can invade. Finally, we briefly discuss between‐cell competition of viral strains using a third model. Our findings may help explain the HIV population bottlenecks during within‐host progression and host‐to‐host transmission. -
more » « less
The triangle‐free process begins with an empty graph on
n vertices and iteratively adds edges chosen uniformly at random subject to the constraint that no triangle is formed. We determine the asymptotic number of edges in the maximal triangle‐free graph at which the triangle‐free process terminates. We also bound the independence number of this graph, which gives an improved lower bound on the Ramsey numbersR (3,t ): we show, which is within a 4 + o (1) factor of the best known upper bound. Our improvement on previous analyses of this process exploits the self‐correcting nature of key statistics of the process. Furthermore, we determine which bounded size subgraphs are likely to appear in the maximal triangle‐free graph produced by the triangle‐free process: they are precisely those triangle‐free graphs with density at most 2. -
more » « less
We study site percolation models on planar lattices including the [
m ,4,n ,4] lattice and the square tilings on the Euclidean plane () or the hyperbolic plane ( ), satisfying certain local constraints on degree‐4 faces. These models are closely related to Ising models and XOR Ising models (product of two i.i.d Ising models) on regular tilings of or . In particular, we obtain a description of the numbers of infinite “+” and “−” clusters of the ferromagnetic Ising model on a vertex‐transitive triangular tiling of for different boundary conditions and coupling constants. Our results show the possibility that such an Ising configuration has infinitely many infinite “+” and “−” clusters, while its random cluster representation has no infinite open clusters. Percolation properties of corresponding XOR Ising models are also discussed.
