How much do increasing events occur disjointly?

Pierre Tesio

Home/Archive/arXiv

arXiv · 2610.32658

How much do increasing events occur disjointly?

Pierre Tesio

View original source ↗Read source document ↗Export metadata ↓

Abstract

We establish two general quantitative lower bounds on the gap in the classical BK inequality for increasing events. The first is an analogue of Talagrand's quantitative FKG inequality (1996) and depends on the influences. The second is specific to the BK inequality and involves both the influences and the probabilities of symmetric disjoint pivots.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Pierre Tesio. 2026-10-23. How much do increasing events occur disjointly?. https://arxiv.org/abs/2610.32658

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

KEEP EXPLORING

Related papers

arXiv2026

Optimal local laws and CLT for the circular Riesz gas

We study the circular Riesz gas, a one-dimensional system of particles with long-range power-law repulsion. We establish near-optimal rigidity estimates for the gaps at all scales. We then prove a quantitative central limit theorem for linear statistics, combining Stein's method with a mean-field transport. The main difficulty is to control the fluctuations of the local error terms left by the transport, which we do using the rigidity estimates, convexity and monotonicity. In particular, a comparison principle for the Helffer--Sjöstrand equation allows us to treat test functions with low regularity, including indicators of intervals.

math.PR↗

arXiv2026

Construction and sample path properties of diffusion house-moving between two curves

This study aims to construct a stochastic process called ``diffusion house-moving,'' which is a diffusion bridge conditioned to stay between its starting point and its ending point. To construct this process, statements are prepared on the weak convergence of conditioned diffusion processes, and conditioned diffusion bridges. Moreover, the sample path properties of diffusion house-moving are studied as well.

math.PR↗

arXiv2026

General diffusions on metric graphs as limits of space-time Markov chains

We introduce the Space-Time Markov Chain Approximation (STMCA) for a general diffusion process on a finite metric graph $Γ$. The STMCA is a doubly asymmetric (in both time and space) random walk defined on subdivisions of $Γ$, with transition probabilities and conditional transition times that match, in expectation, those of the target diffusion. We derive bounds on the $p$-Wasserstein distances between a non-explosive diffusion and its STMCA in terms of a thinness quantifier of the subdivision. An extension to absorbed diffusions uses a boundary-adapted Green-kernel thinness that remains finite even at certain singular exit boundaries. Under the stated regularity and subdivision hypotheses, this gives convergence at any rate strictly less than $\frac14\wedge\frac1p$ in the appropriate thinness quantifier. For suitably adapted subdivisions satisfying a quadratic thinness bound, we show that the rate is doubled: we achieve any rate strictly less than $\frac12\wedge\frac2p$ in terms of the maximum cell size. Additionally, we provide explicit analytical formulas for transition probabilities and times, enabling practical implementation of the STMCA, as well as easily verifiable sufficient non-explosion conditions for the bounds to hold. Numerical experiments illustrate our results.

math.PR↗