arXiv subjects

Bernardo N. B. de Lima

Publications and source records attributed to Bernardo N. B. de Lima.

32 records · Page 2Linked to original sources

arXiv2018

Monotonicity and phase diagram for multi-range percolation on oriented trees

We consider Bernoulli bond percolation on oriented regular trees, where besides the usual short bonds, all bonds of a certain length are added. Independently, short bonds are open with probability $p$ and long bonds are open with probability $q$. We study properties of the critical curve which delimits the set of pairs $(p,q)$ for which there are almost surely no infinite paths. We also show that this curve decreases with respect to the length of the long bonds.

math.PR↗

arXiv2017

A note on truncated long-range percolation with heavy tails on oriented graphs

We consider oriented long-range percolation on a graph with vertex set $\mathbb{Z}^d \times \mathbb{Z}_+$ and directed edges of the form $\langle (x,t), (x+y,t+1)\rangle$, for $x,y$ in $\mathbb{Z}^d$ and $t \in \mathbb{Z}_+$. Any edge of this form is open with probability $p_y$, independently for all edges. Under the assumption that the values $p_y$ do not vanish at infinity, we show that there is percolation even if all edges of length more than $k$ are deleted, for $k$ large enough. We also state the analogous result for a long-range contact process on $\mathbb{Z}^d$.

math.PR↗

arXiv2015

On stable pair potentials with an attractive tail, remarks on two papers by A. G. Basuev

We revisit two old and apparently little known papers by Basuev [2] [3] and show that the results contained there yield strong improvements on current lower bounds of the convergence radius of the Mayer series for continuous particle systems interacting via a very large class of stable and tempered potentials which includes the Lennard-Jones type potentials. In particular we analyze the case of the classical Lennard-Jones gas under the light of the Basuev scheme and, using also some new results [33] on this model recently obtained by one of us, we provide a new lower bound for the Mayer series convergence radius of the classical Lennard-Jones gas which improves by a factor of the order $10^5$ on the current best lower bound recently obtained in [17].

math-ph↗

arXiv2015

Truncated long-range percolation on oriented graphs

We consider different problems within the general theme of long-range percolation on oriented graphs. Our aim is to settle the so-called truncation question, described as follows. We are given probabilities that certain long-range oriented bonds are open; assuming that the sum of these probabilities is infinite, we ask if the probability of percolation is positive when we truncate the graph, disallowing bonds of range above a possibly large but finite threshold. We give some conditions in which the answer is affirmative. We also translate some of our results on oriented percolation to the context of a long-range contact process.

math.PR↗

arXiv2015

A remark on monotonicity in Bernoulli bond Percolation

Consider an anisotropic independent bond percolation model on the $d$-dimensional hypercubic lattice, $d\geq 2$, with parameter $p$. We show that the two point connectivity function $P_{p}(\{(0,\dots,0)\leftrightarrow (n,0,\dots,0)\})$ is a monotone function in $n$ when the parameter $p$ is close enough to 0. Analogously, we show that truncated connectivity function $P_{p}(\{(0,\dots,0)\leftrightarrow (n,0,\dots,0), (0,\dots,0)\nleftrightarrow\infty\})$ is also a monotone function in $n$ when $p$ is close to 1.

math.PR↗

arXiv2014

The Mayer series of the Lennard-Jones gas: improved bounds for the convergence radius

We provide a lower bound for the convergence radius of the Mayer series of the Lennard-Jones gas which strongly improves on the classical bound obtained by Penrose and Ruelle 1963. To obtain this result we use an alternative estimate recently proposed by Morais et al. (J. Stat. Phys. 2014) for a restricted class of stable and tempered pair potentials (namely those which can be written as the sum of a non-negative potential plus an absolutely integrable and stable potential) combined with a method developed by Locatelli and Schoen (J. Glob. Optim. 2002) for establishing a lower bound for the minimal interatomic distance between particles interacting via a Morse potential in a cluster of minimum-energy configurations.

math-ph↗

arXiv2013

Embedding binary sequences into Bernoulli site percolation on $\mathbb{Z}^3$

We investigate the problem of embedding infinite binary sequences into Bernoulli site percolation on $\mathbb{Z}^d$ with parameter $p$, known also as percolation of words.\ In 1995, I.\ Benjamini and H.\ Kesten proved that, for $d \geq 10$ and $p=1/2$, all sequences can be embedded, almost surely. They conjectured that the same should hold for $d \geq 3$. In this paper we consider $d \geq 3$ and $p \in (p_c(d), 1-p_c(d))$, where $p_c(d)<1/2$ is the critical threshold for site percolation on $\mathbb{Z}^d$. We show that there exists an integer $M = M (p)$, such that, a.s., every binary sequence, for which every run of consecutive {0s} or {1s} contains at least $M$ digits, can be embedded.

math.PR↗

arXiv2013

Anisotropic Percolation on Slabs

We consider anisotropic independent bond percolation models on the slab $\Z^2\times\{0,\dots,k\}$, where we suppose that the axial (vertical) bonds are open with probability $p$, while the radial (horizontal) bonds are open with probability $q$. We study the critical curves for these models and establish their continuity and strict monotonicity.

math.PR↗

arXiv2013

Truncated Connectivities in a highly supercritical anisotropic percolation model

We consider an anisotropic bond percolation model on $\mathbb{Z}^2$, with $\textbf{p}=(p_h,p_v)\in [0,1]^2$, $p_v>p_h$, and declare each horizontal (respectively vertical) edge of $\mathbb{Z}^2$ to be open with probability $p_h$(respectively $p_v$), and otherwise closed, independently of all other edges. Let $x=(x_1,x_2) \in \mathbb{Z}^2$ with $0 \prob(\{0\leftrightarrow x'\})$. In this note we give an affirmative answer in the highly supercritical regime.

math.PR↗

arXiv2012

On the compatibility of binary sequences

An ordered pair of semi-infinite binary sequences $(η,ξ)$ is said to be compatible if there is a way of removing a certain number (possibly infinite) of ones from $η$ and zeroes from $ξ$, whichwould map both sequences to the same semi-infinite sequence. This notion was introduced by Peter Winkler, who also posed the following question: $η$ and $ξ$ being independent i.i.d. Bernoulli sequences with parameters $p^\prime$ and $p$ respectively, does it exist $(p', p)$ so that the set of compatible pairs has positive measure? It is known that this does not happen for $p$ and $p^\prime$ very close to 1/2. In the positive direction, we construct, for any $ε> 0$, a deterministic binary sequence $η_ε$ whose set of zeroes has Hausdorff dimension larger than $1-ε$, and such that $\mathbb{P}_p {ξ\colon (η_ε,ξ) \text {is compatible}} > 0$ for $p$ small enough, where $\mathbb{P}_p$ stands for the product Bernoulli measure with parameter $p$.

math.PR↗

arXiv2011

Monotonicity of Percolation Probability on $\Z^d$ with Long Range Connections

Consider an independent site percolation model on $\Z^d,\ d\geq 2$, with parameter $p \in (0,1)$, where there are only nearest neighbor bonds and long range bonds of length $k$ parallel to some coordinate axis. We show that the percolation probability is a non-decreasing function of $k$. We also generalize this result for models whose long range bonds have several lengths.

math.PR↗

arXiv2011

Critical Point and Percolation Probability in a Long Range Site Percolation Model on $\Z^d$

Consider an independent site percolation model with parameter $p \in (0,1)$ on $\Z^d,\ d\geq 2$ where there are only nearest neighbor bonds and long range bonds of length $k$ parallel to each coordinate axis. We show that the percolation threshold of such model converges to $p_c(\Z^{2d})$ when $k$ goes to infinity, the percolation threshold for ordinary (nearest neighbour) percolation on $\Z^{2d}$. We also generalize this result for models whose long range bonds have several lengths.

math.PR↗

arXiv2010

A percolation process on the square lattice where large finite clusters are frozen

Aldous constructed a growth process for the binary tree where clusters freeze as soon as they become infinite. It was pointed out by Benjamini and Schramm that such a process does not exist for the square lattice. This motivated us to investigate the modified process on the square lattice, where clusters freeze as soon as they have diameter larger than or equal to N, the parameter of the model. The non-existence result, mentioned above, raises the question if the N-parameter model shows some 'anomalous' behaviour as N tends to infinity. For instance, if one looks at the cluster of a given vertex, does, as N tends to infinity, the probability that it eventually freezes go to 1? Does this probability go to 0? More generally, what can be said about the size of a final cluster? We give a partial answer to some of such questions.

math.PR↗

arXiv2009

Percolation of words on $\Z^d$ with long range connections

Consider an independent site percolation model on $\Z^d$, with parameter $p \in (0,1)$, where all long range connections in the axes directions are allowed. In this work we show that given any parameter $p$, there exists and integer $K(p)$ such that all binary sequences (words) $ξ\in \{0,1\}^{\N}$ can be seen simultaneously, almost surely, even if all connections whose length is bigger than $K(p)$ are suppressed. We also show some results concerning the question how $K(p)$ should scale with $p$ when $p$ goes to zero. Related results are also obtained for the question of whether or not almost all words are seen.

math.PR↗