Searcharxiv⌕ Search

arXiv subjects

Federico Camia

Publications and source records attributed to Federico Camia.

At least 55 records · Page 3Linked to original sources
arXiv2012

Fat fractal percolation and k-fractal percolation

We consider two variations on the Mandelbrot fractal percolation model. In the k-fractal percolation model, the d-dimensional unit cube is divided in N^d equal subcubes, k of which are retained while the others are discarded. The procedure is then iterated inside the retained cubes at all smaller scales. We show that the (properly rescaled) percolation critical value of this model converges to the critical value of ordinary site percolation on a particular d-dimensional lattice as N tends to infinity. This is analogous to the result of Falconer and Grimmett that the critical value for Mandelbrot fractal percolation converges to the critical value of site percolation on the same d-dimensional lattice. In the fat fractal percolation model, subcubes are retained with probability p_n at step n of the construction, where (p_n) is a non-decreasing sequence with \prod p_n > 0. The Lebesgue measure of the limit set is positive a.s. given non-extinction. We prove that either the set of connected components larger than one point has Lebesgue measure zero a.s. or its complement in the limit set has Lebesgue measure zero a.s.

math.PR↗
arXiv2012

Dimension (in)equalities and Hölder continuous curves in fractal percolation

We relate various concepts of fractal dimension of the limiting set C in fractal percolation to the dimensions of the set consisting of connected components larger than one point and its complement in C (the "dust"). In two dimensions, we also show that the set consisting of connected components larger than one point is a.s. the union of non-trivial Hölder continuous curves, all with the same exponent. Finally, we give a short proof of the fact that in two dimensions, any curve in the limiting set must have Hausdorff dimension strictly larger than 1.

math.PR↗
arXiv2010

Universal Behavior of Connectivity Properties in Fractal Percolation Models

Partially motivated by the desire to better understand the connectivity phase transition in fractal percolation, we introduce and study a class of continuum fractal percolation models in dimension d greater than or equal to 2. These include a scale invariant version of the classical (Poisson) Boolean model of stochastic geometry and (for d=2) the Brownian loop soup introduced by Lawler and Werner. The models lead to random fractal sets whose connectivity properties depend on a parameter lambda. In this paper we mainly study the transition between a phase where the random fractal sets are totally disconnected and a phase where they contain connected components larger than one point. In particular, we show that there are connected components larger than one point at the unique value of lambda that separates the two phases (called the critical point). We prove that such a behavior occurs also in Mandelbrot's fractal percolation in all dimensions d greater than or equal to 2. Our results show that it is a generic feature, independent of the dimension or the precise definition of the model, and is essentially a consequence of scale invariance alone. Furthermore, for d=2 we prove that the presence of connected components larger than one point implies the presence of a unique, unbounded, connected component.

math.PR↗
arXiv2010

Trivial, Critical and Near-critical Scaling Limits of Two-dimensional Percolation

It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of the plane are surrounded by arbitrarily large loops and every deterministic point is almost surely surrounded by a countably infinite family of nested loops with radii going to zero, and (3) an intermediate one, in which every deterministic point of the plane is almost surely surrounded by a largest loop and by a countably infinite family of nested loops with radii going to zero. We show how one can prove this using elementary arguments, with the help of known scaling relations for percolation. The trivial limit corresponds to subcritical and supercritical percolation, as well as to the case when the density p approaches the critical probability, p_c, sufficiently slowly as the lattice spacing is sent to zero. The second type corresponds to critical percolation and to a faster approach of p to p_c. The third, or near-critical, type of limit corresponds to an intermediate speed of approach of p to p_c. The fact that in the near-critical case a deterministic point is a.s. surrounded by a largest loop demonstrates the persistence of a macroscopic correlation length in the scaling limit and the absence of scale invariance.

math.PR↗
arXiv2008

Ising (Conformal) Fields and Cluster Area Measures

We provide a representation for the scaling limit of the d=2 critical Ising magnetization field as a (conformal) random field using SLE (Schramm-Loewner Evolution) clusters and associated renormalized area measures. The renormalized areas are from the scaling limit of the critical FK (Fortuin-Kasteleyn) clusters and the random field is a convergent sum of the area measures with random signs. Extensions to off-critical scaling limits, to d=3 and to Potts models are also considered.

math.PR↗
arXiv2008

Scaling Limits of Two-Dimensional Percolation: an Overview

We present a review of the recent progress on percolation scaling limits in two dimensions. In particular, we will consider the convergence of critical crossing probabilities to Cardy's formula and of the critical exploration path to chordal SLE(6), the full scaling limit of critical cluster boundaries, and near-critical scaling limits.

math.PR↗
arXiv2008

The high temperature Ising model on the triangular lattice is a critical percolation model

The Ising model at inverse temperature $β$ and zero external field can be obtained via the Fortuin-Kasteleyn (FK) random-cluster model with $q=2$ and density of open edges $p=1-e^{-β}$ by assigning spin +1 or -1 to each vertex in such a way that (1) all the vertices in the same FK cluster get the same spin and (2) +1 and -1 have equal probability. We generalize the above procedure by assigning spin +1 with probability $r$ and -1 with probability $1-r$, with $r \in [0,1]$, while keeping condition (1). For fixed $β$, this generates a dependent (spin) percolation model with parameter $r$. We show that, on the triangular lattice and for $β<β_c$, this model has a percolation phase transition at $r=1/2$, corresponding to the Ising model. This sheds some light on the conjecture that the high temperature Ising model on the triangular lattice is in the percolation universality class and that its scaling limit can be described in terms of SLE$_6$. We also prove uniqueness of the infinite +1 cluster for $r>1/2$, sharpness of the percolation phase transition (by showing exponential decay of the cluster size distribution for $r<1/2$), and continuity of the percolation function for all $r \in [0,1]$.

math.PR↗
arXiv2008

Large-N Limit of Crossing Probabilities, Discontinuity, and Asymptotic Behavior of Threshold Values in Mandelbrot's Fractal Percolation Process

We study Mandelbrot's percolation process in dimension $d \geq 2$. The process generates random fractal sets by an iterative procedure which starts by dividing the unit cube $[0,1]^d$ in $N^d$ subcubes, and independently retaining or discarding each subcube with probability $p$ or $1-p$ respectively. This step is then repeated within the retained subcubes at all scales. As $p$ is varied, there is a percolation phase transition in terms of paths for all $d \geq 2$, and in terms of $(d-1)$-dimensional "sheets" for all $d \geq 3$. For any $d \geq 2$, we consider the random fractal set produced at the path-percolation critical value $p_c(N,d)$, and show that the probability that it contains a path connecting two opposite faces of the cube $[0,1]^d$ tends to one as $N \to \infty$. As an immediate consequence, we obtain that the above probability has a discontinuity, as a function of $p$, at $p_c(N,d)$ for all $N$ sufficiently large. This had previously been proved only for $d=2$ (for any $N \geq 2$). For $d \geq 3$, we prove analogous results for sheet-percolation. In dimension two, Chayes and Chayes proved that $p_c(N,2)$ converges, as $N \to \infty$, to the critical density $p_c$ of site percolation on the square lattice. Assuming the existence of the correlation length exponent $ν$ for site percolation on the square lattice, we establish the speed of convergence up to a logarithmic factor. In particular, our results imply that $p_c(N,2)-p_c=(\frac{1}{N})^{1/ν+o(1)}$ as $N \to \infty$, showing an interesting relation with near-critical percolation.

math.PR↗
arXiv2007

Universality in Two-Dimensional Enhancement Percolation

We consider a type of dependent percolation introduced by Aizenman and Grimmett, who showed that certain "enhancements" of independent (Bernoulli) percolation, called essential, make the percolation critical probability strictly smaller. In this paper we first prove that, for two-dimensional enhancements with a natural monotonicity property, being essential is also a necessary condition to shift the critical point. We then show that (some) critical exponents and the scaling limit of crossing probabilities of a two-dimensional percolation process are unchanged if the process is subjected to a monotonic enhancement that is not essential. This proves a form of universality for all dependent percolation models obtained via a monotonic enhancement (of Bernoulli percolation) that does not shift the critical point. For the case of site percolation on the triangular lattice, we also prove a stronger form of universality by showing that the full scaling limit is not affected by any monotonic enhancement that does not shift the critical point.

math-ph↗
arXiv2007

Sharp phase transition and critical behaviour in 2D divide and colour models

Consider subcritical Bernoulli bond percolation with fixed parameter p<p_c. We define a dependent site percolation model by the following procedure: for each bond cluster, we colour all vertices in the cluster black with probability r and white with probability 1-r, independently of each other. On the square lattice, defining the critical probabilities for the site model and its dual, r_c(p) and r_c^*(p) respectively, as usual, we prove that r_c(p)+r_c^*(p)=1 for all subcritical p. On the triangular lattice, where our method also works, this leads to r_c(p)=1/2, for all subcritical p. On both lattices, we obtain exponential decay of cluster sizes below r_c(p), divergence of the mean cluster size at r_c(p), and continuity of the percolation function in r on [0,1]. We also discuss possible extensions of our results, and formulate some natural conjectures. Our methods rely on duality considerations and on recent extensions of the classical RSW theorem.

math.PR↗
arXiv2006

Critical Percolation Exploration Path and SLE(6): a Proof of Convergence

It was argued by Schramm and Smirnov that the critical site percolation exploration path on the triangular lattice converges in distribution to the trace of chordal SLE(6). We provide here a detailed proof, which relies on Smirnov's theorem that crossing probabilities have a conformally invariant scaling limit (given by Cardy's formula). The version of convergence to SLE(6) that we prove suffices for the Smirnov-Werner derivation of certain critical percolation crossing exponents and for our analysis of the critical percolation full scaling limit as a process of continuum nonsimple loops.

math.PR↗
arXiv2006

SLE(6) and CLE(6) from Critical Percolation

We review some of the recent progress on the scaling limit of two-dimensional critical percolation; in particular, the convergence of the exploration path to chordal SLE(6) and the "full" scaling limit of cluster interface loops. The results given here on the full scaling limit and its conformal invariance extend those presented previously. For site percolation on the triangular lattice, the results are fully rigorous. We explain some of the main ideas, skipping most technical details.

math.PR↗
arXiv2006

Two-Dimensional Critical Percolation: The Full Scaling Limit

We use SLE(6) paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice -- that is, the scaling limit of the set of all interfaces between different clusters. Some properties of the loop process, including conformal invariance, are also proved.

math.PR↗
arXiv2005

The Full Scaling Limit of Two-Dimensional Critical Percolation

We use SLE(6) paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice -- that is, the scaling limit of the set of all interfaces between different clusters. Some properties of the loop process, including conformal invariance, are also proved. In the main body of the paper these results are proved while assuming, as argued by Schramm and Smirnov, that the percolation exploration path converges in distribution to the trace of chordal SLE(6). Then, in a lengthy appendix, a detailed proof is provided for this convergence to SLE(6), which itself relies on Smirnov's result that crossing probabilities converge to Cardy's formula.

math.PR↗
arXiv2004

Scaling Limit and Critical Exponents for Two-Dimensional Bootstrap Percolation

Consider a cellular automaton with state space $\{0,1 \}^{{\mathbb Z}^2}$ where the initial configuration $ω_0$ is chosen according to a Bernoulli product measure, 1's are stable, and 0's become 1's if they are surrounded by at least three neighboring 1's. In this paper we show that the configuration $ω_n$ at time n converges exponentially fast to a final configuration $\barω$, and that the limiting measure corresponding to $\barω$ is in the universality class of Bernoulli (independent) percolation. More precisely, assuming the existence of the critical exponents $β$, $η$, $ν$ and $γ$, and of the continuum scaling limit of crossing probabilities for independent site percolation on the close-packed version of ${\mathbb Z}^2$ (i.e., for independent $*$-percolation on ${\mathbb Z}^2$), we prove that the bootstrapped percolation model has the same scaling limit and critical exponents. This type of bootstrap percolation can be seen as a paradigm for a class of cellular automata whose evolution is given, at each time step, by a monotonic and nonessential enhancement.

math.PR↗
arXiv2003

The Percolation Transition in the Zero-Temperature Domany Model

We analyze a deterministic cellular automaton $σ^{\cdot} = (σ^n : n \geq 0)$ corresponding to the zero-temperature case of Domany's stochastic Ising ferromagnet on the hexagonal lattice $\mathbb H$. The state space ${\cal S}_{\mathbb H} = \{-1, +1 \}^{\mathbb H}$ consists of assignments of -1 or +1 to each site of $\mathbb H$ and the initial state $σ^0 = \{σ_x^0 \}_{x \in {\mathbb H}}$ is chosen randomly with $P(σ_x^0 = +1) = p \in [0,1]$. The sites of $\mathbb H$ are partitioned in two sets $\cal A$ and $\cal B$ so that all the neighbors of a site x in $\cal A$ belong to $\cal B$ and vice versa, and the discrete time dynamics is such that the $σ^{\cdot}_x$'s with $x \in {\cal A}$ (respectively, $\cal B$) are updated simultaneously at odd (resp., even) times, making $σ^{\cdot}_x$ agree with the majority of its three neighbors. In [1] it was proved that there is a percolation transition at p=1/2 in the percolation models defined by $σ^n$, for all times $n \in [1, \infty]$. In this paper, we study the nature of that transition and prove that the critical exponents $β$, $ν$ and $η$ of the dependent percolation models defined by $σ^n, n \in [1, \infty]$, have the same values as for standard two-dimensional independent site percolation (on the triangular lattice).

math.PR↗
arXiv2003

Continuum Nonsimple Loops and 2D Critical Percolation

Substantial progress has been made in recent years on the 2D critical percolation scaling limit and its conformal invariance properties. In particular, chordal SLE6 (the Stochastic Loewner Evolution with parameter k=6) was, in the work of Schramm and of Smirnov, identified as the scaling limit of the critical percolation ``exploration process.'' In this paper we use that and other results to construct what we argue is the full scaling limit of the collection of all closed contours surrounding the critical percolation clusters on the 2D triangular lattice. This random process or gas of continuum nonsimple loops in the plane is constructed inductively by repeated use of chordal SLE6. These loops do not cross but do touch each other -- indeed, any two loops are connected by a finite ``path'' of touching loops.

math.PR↗