Related papers: Widths of crossings in Poisson Boolean percolation
We construct the uniform infinite planar map (UIPM), obtained as the n \to \infty local limit of planar maps with n edges, chosen uniformly at random. We then describe how the UIPM can be sampled using a "peeling" process, in a similar way…
Recent studies of the tunnelling through two opaque barriers claim that the transit time is independent of the barrier widths and of the separation distance between the barriers. We observe, in contrast, that if multiple reflections are…
The expected range of a sample of n+1 normally distributed variables is known to be related to the mean width of a regular n-simplex. We show that the expected maximum mu_n of a sample of n half-normally distributed variables is related to…
The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant…
In standard bootstrap percolation, a subset A of the n x n grid is initially infected. A new site is then infected if at least two of its neighbours are infected, and an infected site stays infected forever. The set A is said to percolate…
A new kind of invasion percolation is introduced in order to take into account the inertia of the invader fluid. The inertia strength is controlled by the number N of pores (or steps) invaded after the perimeter rupture. The new model…
We study the following problem for critical site percolation on the triangular lattice. Let A and B be sites on a horizontal line e separated by distance n. Consider, in the half-plane above e, the lowest occupied crossing R from the…
We derive a sufficient condition for the existence of a subcritical percolation phase for a wide range of continuum percolation models where each vertex is embedded into Euclidean space according to an iid-marked stationary Poisson point…
The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…
We prove that the probability of crossing a large square in quenched Voronoi percolation converges to 1/2 at criticality, confirming a conjecture of Benjamini, Kalai and Schramm from 1999. The main new tools are a quenched version of the…
We study properties of occupation times by Brownian excursions and Brownian loops in two-dimensional domains. This allows for instance to interpret some Gaussian fields, such as the Gaussian Free Fields as (properly normalized) fluctuations…
We investigate the importance of crossing symmetry in effective field models and the effects of phenomenological nucleon resonance widths on the paradigmatic case of pion photoproduction. We use reaction models containing four star…
Porous materials made up of impermeable polyhedral grains constrain fluid flow to voids around the impenetrable constituent barrier particles. A percolation transition marks the boundary between assemblies of grains which contain system…
Every realistic instance of a percolation problem is faced with some degree of polydispersity, e.g., the pore-size distribution of an inhomogeneous medium, the size distribution of filler particles in composite materials, or the vertex…
In a recent article, one of the authors used $c=0$ logarithmic conformal field theory to predict crossing-probability formulas for percolation clusters inside a hexagon with free boundary conditions. In this article, we verify these…
A $k$-crossing family in a point set $S$ in general position is a set of $k$ segments spanned by points of $S$ such that all $k$ segments mutually cross. In this short note we present two statements on crossing families which are based on…
Let $G$ be a multigraph with $n$ vertices and $e>4n$ edges, drawn in the plane such that any two parallel edges form a simple closed curve with at least one vertex in its interior and at least one vertex in its exterior. Pach and T\'oth (A…
We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number of non-crossing Hamiltonian cycles (polygonalizations) is polynomially bounded in…
Using the randomized algorithm method developed by Duminil-Copin, Raoufi and Tassion (2019b), we exhibit sharp phase transition for the confetti percolation model. This provides an alternate proof, than that of Ahlberg, Tassion and Texeira…
Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube B_n ={0,1}^n with nearest neighbor edges. For oriented and unoriented percolation, p=e/n and p=1/n are the respective critical…