相关论文: The time constant and critical probabilities in pe…
Percolation plays an important role in fields and phenomena as diverse as the study of social networks, the dynamics of epidemics, the robustness of electricity grids, conduction in disordered media, and geometric properties in statistical…
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the `people' graph…
In the $R$-spread out, $d$-dimensional voter model, each site $x$ of $\mathbb{Z}^d$ has state (or 'opinion') 0 or 1 and, with rate 1, updates its opinion by copying that of some site $y$ chosen uniformly at random among all sites within…
In this article, we first extend the construction of random interlacements, introduced by A.S. Sznitman in [arXiv:0704.2560], to the more general setting of transient weighted graphs. We prove the Harris-FKG inequality for this model and…
We study infinite ``$+$'' or ``$-$'' clusters for an Ising model on an connected, transitive, non-amenable, planar, one-ended graph $G$ with finite vertex degree. If the critical percolation probability $p_c^{site}$ for the i.i.d.~Bernoulli…
We consider directed first passage percolation on the integer lattice, with time constant $\mu$ and passage time $a_{0n}$ from the origin to $(n,0,...,0)$. It is shown that under certain conditions on the passage time distribution, $Ea_{0n}…
Percolation is one of the simplest and nicest models in probability theory/statistical mechanics which exhibits critical phenomena. Dynamical percolation is a model where a simple time dynamics is added to the (ordinary) percolation model.…
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
We consider the $d$-neighbor bootstrap percolation process on the $d$-dimensional torus, with vertex set $V=\{1,\cdots,n\}^d$ and edge set $\{xy:\sum_{i=1}^d|x_i-y_i (\text{mod} \; n)|=1\}$. We determine the percolation time up to a…
We show that the distribution of times for a diffusing particle to first hit an absorber is \emph{independent} of the direction of an external flow field, when we condition on the event that the particle reaches the target for flow away…
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily…
We apply a variation on the methods of Duminil-Copin, Raoufi, and Tassion to establish a new differential inequality applying to both Bernoulli percolation and the Fortuin-Kasteleyn random cluster model. This differential inequality has a…
We introduce a model for temporally disordered directed percolation in which the probability of spreading from a vertex $(t,x)$, where $t$ is the time and $x$ is the spatial coordinate, is independent of $x$ but depends on $t$. Using a very…
Inspired by strict-monotonicity criteria for the time constant in first passage percolation, we investigate convex ordering of point processes in relation to the time constant in first contact percolation. In a nutshell, first contact…
The fluctuations of the passage time in first passage percolation are of great interest. We show that the non-random fluctuations in planar FPP are at least of order $\log(n)^\alpha$ for any $\alpha<1/2$ under some conditions that are known…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…
Consider subcritical Bernoulli bond percolation with fixed parameter p<p_c. We define a dependent site percolation model by the following procedure: for each bond cluster, we colour all vertices in the cluster black with probability r and…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
Weak multiplex percolation generalizes percolation to multi-layer networks, represented as networks with a common set of nodes linked by multiple types (colors) of edges. We report a novel discontinuous phase transition in this problem.…