Related papers: Linear Lower Bounds for $\delta_c(p)$ for a Class …
In this article, we revisit random site and bond percolation in square lattice focusing primarily on the behavior of entropy and order parameter. In the case of traditional site percolation, we find that both the quantities are zero at…
We generalize the directed percolation (DP) model by relaxing the strict directionality of DP such that propagation can occur in either direction but with anisotropic probabilities. We denote the probabilities as $p_{\downarrow}= p \cdot…
Surface bound states in a discrete-lattice model of a $d_{x^2 - y^2}$ cuprate superconductor are shown to be, in general, coherent superpositions of an incoming excitation and more than one outgoing excitation, and a simple graphical…
We consider the Bernoulli percolation model in a finite box and we introduce an automatic control of the percolation probability, which is a function of the percolation configuration. For a suitable choice of this automatic control, the…
Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions. We study four constraint percolation…
In section 1 we give an improved lower bound on Hermite's constant $\delta_{2g}$ for symplectic lattices in even dimensions ($g=2n$) by applying a mean-value argument from the geometry of numbers to a subset of symmetric lattices. Here we…
Given a graph $G = (V,E)$, an $(\alpha, \beta)$-ruling set is a subset $S \subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is…
We study the growth and isoperimetry of infinite clusters in slightly supercritical Bernoulli bond percolation on transitive nonamenable graphs under the $L^2$ boundedness condition ($p_c<p_{2\to 2}$). Surprisingly, we find that the volume…
With a small parameter $\epsilon$, Poisson-Nernst-Planck (PNP) systems over a finite one-dimensional (1D) spatial domain have steady state solutions, called 1D boundary layer solutions, which profiles form boundary layers near boundary…
We introduce a percolation model on $\mathbb{Z}^d$, $d \geq 3$, in which the discrete lines of vertices that are parallel to the coordinate axis are entirely removed at random and independently of each other. In this way a vertex belongs to…
The purpose of this paper is to investigate a condition \begin{equation*} (C_{p}) \hspace{1cm} \alpha \int_{0}^{u}f(s)ds \leq uf(u)+\beta u^{p}+\gamma,\,\,u>0 \end{equation*} for some $\alpha>2$, $\gamma>0$, and…
We postulate the existence of a natural Poissonian marking of the double (touching) points of SLE(6) and hence of the related continuum nonsimple loop process that describes macroscopic cluster boundaries in 2D critical percolation. We…
The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…
On the lattice $\widetilde{\mathbb Z}^2_+:={(x,y)\in \mathbb Z \times \mathbb Z_+\colon x+y \text{is even}}$ we consider the following oriented (northwest-northeast) site percolation: the lines $H_i:={(x,y)\in \widetilde {\mathbb Z}^2_+…
In an earlier work, the first author and Petsche used potential theoretic techniques to establish a lower bound for the height of algebraic numbers that satisfy splitting conditions, such as being totally real or p-adic, improving on…
Let C_n be the origin-containing cluster in subcritical percolation on the lattice (1/n) Z^d, viewed as a random variable in the space Omega of compact, connected, origin-containing subsets of R^d, endowed with the Hausdorff metric delta.…
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
We consider the following oriented percolation model of $\mathbb {N} \times \mathbb{Z}^d$: we equip $\mathbb {N}\times \mathbb{Z}^d$ with the edge set $\{[(n,x),(n+1,y)] | n\in \mathbb {N}, x,y\in \mathbb{Z}^d\}$, and we say that each edge…
Consider critical site percolation on $\mathbb{Z}^d$ with $d \geq 2$. We prove a lower bound of order $n^{- d^2}$ for point-to-point connection probabilities, where $n$ is the distance between the points. Most of the work in our proof…
We study site- and bond-percolation on a class of lattices referred to as Lieb lattices. In two dimensions the Lieb lattice (LL) is also known as the decorated square lattice, or as the CuO$_2$ lattice; in three dimensions it can be…