ﻻ يوجد ملخص باللغة العربية
Let $ mathbb{L}^{d} = ( mathbb{Z}^{d},mathbb{E}^{d} ) $ be the $ d $-dimensional hypercubic lattice. We consider a model of inhomogeneous Bernoulli percolation on $ mathbb{L}^{d} $ in which every edge inside the $ s $-dimensional hyperplane $ mathbb{Z}^{s} times { 0 }^{d-s} $, $ 2 leq s < d $, is open with probability $ q $ and every other edge is open with probability $ p $. We prove the uniqueness of the infinite cluster in the supercritical regime whenever $ p eq p_{c}(d) $, where $ p_{c}(d) $ denotes the threshold for homogeneous percolation, and that the critical point $ (p,q_{c}(p)) $ can be approximated on the phase space by the critical points of slabs, for any $ p < p_{c}(d) $.
We study first-passage percolation where edges in the left and right half-planes are assigned values according to different distributions. We show that the asymptotic growth of the resulting inhomogeneous first-passage process obeys a shape theorem,
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
We consider the Bernoulli bond percolation process $mathbb{P}_{p,p}$ on the nearest-neighbor edges of $mathbb{Z}^d$, which are open independently with probability $p<p_c$, except for those lying on the first coordinate axis, for which this probabilit
Let $mathbb{G}=left(mathbb{V},mathbb{E}right)$ be the graph obtained by taking the cartesian product of an infinite and connected graph $G=(V,E)$ and the set of integers $mathbb{Z}$. We choose a collection $mathcal{C}$ of finite connected subgraphs o
We provide a complete proof of the diagrammatic bounds on the lace-expansion coefficients for oriented percolation, which are used in [arXiv:math/0703455] to investigate critical behavior for long-range oriented percolation above 2min{alpha,2} spatial dimensions.