相关论文: A note on the Harris-Kesten Theorem

We make progress on a conjecture of Kahn and Kalai, the original (stronger but less general) version of what became known as the ``Kahn-Kalai Conjecture" (KKC; now a theorem of Park and Pham). This ``second" KKC concerns the threshold,…

We established a physically utilizable Bell inequality based on the Peres-Horodecki criterion. The new quadratic probabilistic Bell inequality naturally provides us a necessary and sufficient way to test all entangled two-qubit or…

Extending results of Linial (1984) and Aigner (1985), we prove a uniform lower bound on the balance constant of a poset $P$ of width $2$. This constant is defined as $\delta(P) = \max_{(x, y)\in P^2}\min\{\mathbb{P}(x\prec y),…

In 1986 A. Ancona showed, using the Koebe one-quarter Theorem, that for a simply-connected planar domain the constant in the Hardy inequality with the distance to the boundary is greater than or equal to 1/16. In this paper we consider…

We use isoperimetric inequalities combined with a new technique to prove upper bounds for the site percolation threshold of plane graphs with given minimum degree conditions. In the process we prove tight new isoperimetric bounds for…

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

In Bernoulli bond percolation on the Cartesian product graph of a $d$-regular tree and a line, we give an upper bound for the critical probability $p_c$.

We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds to be $p_c ({\rm bond})=0.248\,811\,82(10)$ and $p_c ({\rm site})=0.311\,607\,7(2)$. By…

Although quantitative stability for critical points of the Sobolev and fractional Sobolev inequalities has been extensively studied, the corresponding stability theory for critical points of the Hardy--Littlewood--Sobolev (HLS) inequality…

We introduce and study a family of 2D percolation systems which are based on the bond percolation model of the triangular lattice. The system under study has local correlations, however, bonds separated by a few lattice spacings act…

Park and Pham's recent proof of the Kahn-Kalai conjecture was a major breakthrough in the field of graph and hypergraph thresholds. Their result gives an upper bound on the threshold at which a probabilistic construction has a $1-\epsilon$…

We prove an almost constant lower bound of the isoperimetric coefficient in the KLS conjecture. The lower bound has the dimension dependency $d^{-o_d(1)}$. When the dimension is large enough, our lower bound is tighter than the previous…

The probability of simultaneous occurence of at least k spanning clusters has been studied by Monte Carlo simulations on the 2D square lattice at the bond percolation threshold Pc=1/2. The calculated probabilities for free boundary…

The hull-gradient method is used to determine the critical threshold for bond percolation on the two-dimensional Kagome lattice (and its dual, the dice lattice). For this system, the hull walk is represented as a self-avoiding trail, or…

We revisit the Kahn-Kalai conjecture, recently proved in striking fashion by Park and Pham, and present a slightly reformulated simple proof which has a few advantages: (1) it works for non-uniform product measures, (2) it gives…

We investigate oriented bond-site percolation on the planar lattice in which entire columns are stretched. Generalising recent results by Hil\'ario et al., we establish non-trivial percolation under a $(1+\varepsilon)$-th moment condition…

In this article, we generalize known formulas for crossing probabilities. Prior crossing results date back to J. Cardy's prediction of a formula for the probability that a percolation cluster in two dimensions connects the left and right…

We consider the $r$-neighbor bootstrap percolation process on the graph with vertex set $V=\{0,1\}^n$ and edges connecting the pairs at Hamming distance $1,2,\dots,k$, where $k\ge 2$. We find asymptotics of the critical probability of…

In this paper we consider a one-dimensional fully parabolic quasilinear Keller-Segel system with critical nonlinear diffusion. We show uniform-in-time boundedness of solutions, which means, that unlike in higher dimensions, there is no…

The two-dimensional dense O(n) loop model for $n=1$ is equivalent to the bond percolation and for $n=0$ to the dense polymers or spanning trees. We consider the boundary correlations on the half space and calculate the probability $P_b$…