Related papers: A remark on monotonicity in Bernoulli bond Percola…
We prove a monotonicity formula for minimal or almost minimal sets for the Hausdorff measure $\cal{H}^d$, subject to a sliding boundary constraint where competitors for $E$ are obtained by deforming $E$ by a one-parameter family of…
We investigate locality of the supercritical regime for Bernoulli percolation on transitive graphs with polynomial growth, by which we mean the following. Take a transitive graph of polynomial growth $\mathscr{G}$ satisfying…
We study FK-percolation where the edge parameters are chosen as independent random variables in the near-critical regime. We show that if these parameters satisfy a natural centering condition around the critical point, then the quenched…
We prove that the growth constants for nearest-neighbour lattice trees and lattice (bond) animals on the integer lattice Zd are asymptotic to 2de as the dimension goes to infinity, and that their critical one-point functions converge to e.…
The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…
Let $G_{n,p}^1$ be a superposition of the random graph $G_{n,p}$ and a one-dimensional lattice: the $n$ vertices are set to be on a ring with fixed edges between the consecutive vertices, and with random independent edges given with…
We study the independent alignment percolation model on $\mathbb{Z}^d$ introduced by Beaton, Grimmett and Holmes [arXiv:1908.07203]. It is a model for random intersecting line segments defined as follows. First the sites of $\mathbb{Z}^d$…
We consider a one parameter family of Lorenz maps indexed by their point of discontinuity $p$ and constructed from a pair of bilipschitz functions. We prove that their topological entropies vary continuously as a function of $p$ and discuss…
We suggest treating a conducting network of oriented polymer chains as an anisotropic fractal whose dimensionality D=1+\epsilon is close to one. Percolation on such a fractal is studied within the real space renormalization group of Migdal…
We study higher-dimensional homological analogues of bond percolation on a square lattice and site percolation on a triangular lattice. By taking a quotient of certain infinite cell complexes by growing sublattices, we obtain finite cell…
We study the mutual percolation of two interdependent lattice networks ranging from two to seven dimensions, denoted as $D$. We impose that the length of interdependent links connecting nodes in the two lattices be less than or equal to a…
We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…
An anisotropic random barrier model is presented, in which the transition probabilities in different directions have different probability density functions. At low temperatures, the anisotropic long--time diffusion coefficients, obtained…
We consider a directed percolation process on an ${\cal M}$ x ${\cal N}$ rectangular lattice whose vertical edges are directed upward with an occupation probability y and horizontal edges directed toward the right with occupation…
We analyze and characterize maximal monotonicity of linear relations (set-valued operators with linear graphs). An important tool in our study are Fitzpatrick functions. The results obtained partially extend work on linear and at most…
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattice animals on the d-dimensional hyper cubic lattice having long finite-range connections, above their upper critical dimensions d=4…
The equivalence of the characteristic function approach and the probabilistic approach to monotone and boolean convolutions is proven for non-compactly supported probability measures. A probabilistically motivated definition of the…
Let $G_1,\dots, G_m$ be independent Bernoulli random subgraphs of the complete graph ${\cal K}_n$ having variable sizes $x_1,\dots, x_m\in [n]$ and densities $q_1,\dots, q_m\in [0,1]$. Letting $n,m\to+\infty$, we study the connectivity…
Two related issues are explored for bond percolation on the d-dimensional cubic lattice (with d > 2) and its dual plaquette process. Firstly, for what values of the parameter p does the complement of the infinite open cluster possess an…
A random graph model on a host graph H is said to be 1-independent if for every pair of vertex-disjoint subsets A,B of E(H), the state of edges (absent or present) in A is independent of the state of edges in B. For an infinite connected…