Searcharxiv⌕ Search

arXiv subjects

Rémy Sanchis

Publications and source records attributed to Rémy Sanchis.

15 recordsLinked to original sources

Critical percolation on slabs with random columnar disorder

We explore a bond percolation model on slabs $\mathbb{S}^+_k=\mathbb{Z}_+\times \mathbb{Z}_+\times\{0,\dots,k\}$ featuring one-dimensional inhomogeneities. In this context, a vertical column on the slab comprises the set of vertical edges projecting to the same vertex on $\mathbb{Z}_+\times\{0,\dots,k\}$. Columns are chosen based on the arrivals of a renewal process, where the tail distributions of inter-arrival times follow a power law with exponent $ϕ>1$. Inhomogeneities are introduced as follows: vertical edges on selected columns are open (closed) with probability $q$ (respectively $1-q$), independently. Conversely, vertical edges within unselected columns and all horizontal edges are open (closed) with probability $p$ (respectively $1-p$). We prove that for all sufficiently large $ϕ$ (depending solely on $k$), the following assertion holds: if $q>p_c(\mathbb{S}^+_k)$, then $p$ can be taken strictly smaller than $p_c(\mathbb{S}^+_k)$ in a manner that percolation still occurs.

math.PR↗

Near-critical percolation with sparse reinforcements

We study the effect of sparse random reinforcement on near-critical Bernoulli site percolation on the first quadrant of the square lattice. The reinforcement is generated by randomly selecting horizontal and vertical lines and increasing the opening probability $p$ only at their intersections, so that the reinforcement is supported on a sparse set of points with long-range dependence. We determine how the geometry of this random set influences the phase transition. We first investigate whether the reinforcement lowers the critical threshold. When the spacings between consecutive selected lines are geometric, we prove that, for every $p$ above the critical threshold, percolation occurs even if the opening probability $q$ outside the reinforcement is strictly below criticality. In contrast, if the spacings in one direction decay slower than exponentially while those in the other are geometric, then no threshold shift occurs: percolation is impossible for $q$ below the critical threshold, regardless of $p$. We next study the critical case $q=p_c$. We show that sufficiently high moments of the spacing distributions imply percolation at criticality, whereas the absence of a fractional moment of order $α\in(0,1)$ rules it out. Both regimes remain unchanged after an additional independent thinning of the reinforced vertices. Thus, reinforcement supported on random intersections may either lower the critical threshold or leave it unchanged while fundamentally altering the nature of the phase transition.

math.PR↗

The BEG model at the FAD triple point on the square lattice

In this note, we prove that the two-dimensional Blume-Emery-Griffiths model at the triple point Ferromagnetic-Antiquadrupolar-Disordered (FAD) has a unique Gibbs measure at any temperature, thereby establishing the absence of phase transitions. The FAD point lies at the intersection of lines separating three regions of the phase diagram, and it is a singular point where the model exhibits infinitely many ground states. Our proof is based on a random-cluster type representation with configuration-dependent cluster weights and a coupling with Bernoulli site percolation with parameter $1/2$.

math-ph↗

Anisotropic Ising model in d+s dimensions

In this note, we consider the asymmetric nearest neighbor ferromagnetic Ising model on the $(d+s)$-dimensional unit cubic lattice $\Z^{d+s}$, at inverse temperature $β=1$ and with coupling constants $J_s>0$ and $J_d>0$ for edges of $\Z^s$ and $\Z^d$, respectively. We obtain a lower bound for the critical curve in the phase diagram of $(J_s,J_d)$. In particular, as $J_d$ approaches its critical value from below, our result is directly related to the so-called dimensional crossover phenomenon.

math-ph↗

Clustering and Cliques in P.A random graphs with edge insertion

In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between existing vertices. Specifically, at each time step $t$, either a new vertex is added with probability $f(t)$, or an edge is added between two existing vertices with probability $1-f(t)$. We establish concentration inequalities for the global clustering and clique number of the resulting graphs under the assumption that $f(t)$ is a regularly varying function at infinity with index of regular variation $-γ$, where $γ\in [0,1)$. We also demonstrate an inverse relation between these two statistics: the clique number is essentially the reciprocal of the global clustering coefficient.

math.PR↗

Constrained-degree percolation in random environment

We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint $κ_v$ which takes the value $j\in \{0,1,2,3\}$ with probability $ρ_j$. Each edge $e$ attempts to open at a random uniform time $U_e$ in $[0,1]$, independently of all other edges. It succeeds if at time $U_e$ both its end-vertices have degrees strictly smaller than their respectively attached constraints. We show that this model undergoes a non-trivial phase transition when $ρ_3$ is sufficiently large. The proof consists of a decoupling inequality, the continuity of the probability for local events, and a coarse-graining argument.

math.PR↗

Strict inequality for bond percolation on a dilute lattice with columnar disorder

We consider a dilute lattice obtained from the usual $\mathbb{Z}^3$ lattice by removing independently each of its columns with probability $1-ρ$. In the remaining dilute lattice independent Bernoulli bond percolation with parameter $p$ is performed. Let $ρ\mapsto p_c(ρ)$ be the critical curve which divides the subcritical and supercritical phases. We study the behavior of this curve near the disconnection threshold $ρ_c = p_c^{\text{site}}(\mathbb{Z}^2)$ and prove that, uniformly over $ρ$ it remains strictly below $1/2$ (the critical point for bond percolation on the square lattice $\mathbb{Z}^2)$.

math.PR↗

The Constrained-degree percolation model

In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open at time $U_e$, it succeeds if both its end-vertices would have degrees at most $k-1$. We prove a phase transition theorem for this model on the square lattice $\mathbb{L}^2$, as well as on the d-ary regular tree. We also prove that on the square lattice the infinite cluster is unique in the supercritical phase.

math.PR↗

Asymptotic behavior of extremals for fractional Sobolev inequalities associated with singular problems

Let $Ω$ be a smooth, bounded domain of $\mathbb{R}^{N}$, $ω$ be a positive, $L^{1}$-normalized function, and $0<s<1<p.$ We study the asymptotic behavior, as $p\rightarrow\infty,$ of the pair $\left( \sqrt[p]{Λ_{p}% },u_{p}\right) ,$ where $Λ_{p}$ is the best constant $C$ in the Sobolev type inequality \[ C\exp\left( \int_Ω(\log\left\vert u\right\vert ^{p})ω\mathrm{d}x\right) \leq\left[ u\right] _{s,p}^{p}\quad\forall\,u\in W_{0}^{s,p}(Ω) \] and $u_{p}$ is the positive, suitably normalized extremal function corresponding to $Λ_{p}$. We show that the limit pairs are closely related to the problem of minimizing the quotient $\left\vert u\right\vert _{s}/\exp\left( \int_Ω(\log\left\vert u\right\vert )ω\mathrm{d}x\right) ,$ where $\left\vert u\right\vert _{s}$ denotes the $s$-Hölder seminorm of a function $u\in C_{0}^{0,s}(\overlineΩ).$

math.AP↗

Dimensional Crossover in Anisotropic Percolation on $Z^{d+s}$

We consider bond percolation on $\Z^d\times \Z^s$ where edges of $\Z^d$ are open with probability $p<p_c(\Z^d)$ and edges of $\Z^s$ are open with probability $q$, independently of all others. We obtain bounds for the critical curve in $(p, q)$, with $p$ close to the critical threshold $p_c(\Z^d)$. The results are related to the so-called dimensional crossover from $\Z^d$ to $\Z^{d+s}$.

math.PR↗

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↗

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↗

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↗

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↗

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↗