ﻻ يوجد ملخص باللغة العربية
In the Constrained-degree percolation model on a graph $(mathbb{V},mathbb{E})$ there are a sequence, $(U_e)_{einmathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open at time $U_e$, it succeeds if both its end-vertices would have degrees at most $k-1$. We prove a phase transition theorem for this model on the square lattice $mathbb{L}^2$, as well as on the d-ary regular tree. We also prove that on the square lattice the infinite cluster is unique in the supercritical phase.
We consider the Constrained-degree percolation model with random constraints on the square lattice and prove a non-trivial phase transition. In this model, each vertex has an independently distributed random constraint $jin {0,1,2,3}$ with probabilit
We consider the Bernoulli Boolean discrete percolation model on the d-dimensional integer lattice. We study sufficient conditions on the distribution of the radii of balls placed at the points of a Bernoulli point process for the absence of percolati
We consider first passage percolation on the configuration model. Once the network has been generated each edge is assigned an i.i.d. weight modeling the passage time of a message along this edge. Then independently two vertices are chosen uniformly
We consider an anisotropic bond percolation model on $mathbb{Z}^2$, with $textbf{p}=(p_h,p_v)in [0,1]^2$, $p_v>p_h$, and declare each horizontal (respectively vertical) edge of $mathbb{Z}^2$ to be open with probability $p_h$(respectively $p_v$), and
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