Searcharxiv⌕ Search

arXiv · 2610.22417

Strict monotonicity of weighted inhomogeneous percolation thresholds under covering maps

Abstract

We study Bernoulli bond percolation under weak covering maps for a class of weighted inhomogeneous product measures such that each edge $e$ carries a positive weight $w(e)$ and is open at intensity $λ\geq 0$ with probability $1-\exp(-λw(e))$. We prove a strict monotonicity of the weighted critical intensities $λ_c$ in the covering compatibility setting under bounded degree, uniform ellipticity, tame fibre and disjoint tree-lifting. While for the weighted uniform connection thresholds $λ_{\mathrm{conn}}$, we establish their strict monotonicity for non-injective weak covering maps under bounded degree, covering compatibility, uniform ellipticity, bounded-fibre and disjoint tree-lifting. Moreover, we verify a general-profile theorem on strict monotonicities of the two thresholds $λ_c$ and $λ_{\mathrm{conn}}$ respectively under explicit compact-interval finite-energy, derivative bounds and aforementioned geometric conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jing Liu, Kainan Xiang, Lang Zou. 2026-10-15. Strict monotonicity of weighted inhomogeneous percolation thresholds under covering maps. https://arxiv.org/abs/2610.22417

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Graph-diameter criteria and sharp dissipation in discrete Wasserstein-Fisher geometry

We study the probability simplex of a finite connected weighted graph with an Onsager operator combining logarithmic-mean transport and mass-conserving Fisher reaction. For every fixed positive reaction parameter, we prove that the entropy Hessian has a finite global lower bound if and only if the original transport graph has diameter at most two. Near a boundary probability, the corresponding criterion is that its positive support reaches every vertex in at most two steps. The proof controls all potential directions under arbitrary multiscale boundary degeneration. For graphs of diameter at most two, the optimal lower bound is Lipschitz on bounded parameter intervals, including the pure-transport endpoint. We also determine the largest instantaneous logarithmic-amplitude dissipation function depending only on the graph and the current amplitude, and construct two-level probabilities attaining it. Its positivity has the same two-step criterion. As consequences, we obtain graph-dependent entropy-decay estimates and exact projective contraction bounds without assuming nonnegative entropic curvature.

math.PR↗

Two-neighbor lattice percolation percolates in all dimensions

It is trivial that $1$-dimensional $2$-neighbor lattice percolation percolates. Coupier, Henry, Jahnel and Köppl proved the $2$-neighbor lattice percolation percolates in dimension 2; and then for sufficiently large dimensions, Bäumler, Jahnel, Köppl, Lodewijks, Reeves and Tóbiás showed this is still true. In this paper, we verify that the $2$-neighbor lattice percolation percolates in all dimensions $d\ge 3.$

math.PR↗

Strong approximations for dependent random fields

We establish strong Gaussian approximations for centered stationary random fields on $\mathbb Z^d$, $d\ge2$, represented as measurable functions of i.i.d.\ innovations. Under finite $p$th moments, $p>2$, and sufficiently fast decay of spatial dependence, we construct a single coupling of the field with an i.i.d.\ Gaussian field. Its partial sums, scaled by the long-run standard deviation, approximate those of the original field almost surely, uniformly over all rectangular prefixes and all observation scales. Over a cube of side length $n$, the approximation error is $O_{\mathrm{a.s.}}(n^{\max\{d/p,(d-1)/2\}})$ up to logarithmic factors. While $d/p$ is the familiar moment term, the surface term $(d-1)/2$, absent for independent planar arrays, emerges as a cost of dependence, and cannot be removed even for finite-range Gaussian fields. The assumptions accommodate nonlinear and noncausal fields without imposing mixing. The proof combines a permanent dyadic blocking, a local Gaussian coupling in tensor Haar coordinates driven by a Doob martingale with vanishing conditional third moments, and a comparison of the resulting dependent Gaussian blocks with white noise.

math.PR↗