Search arXivSearch

arXiv · 2603.22562

Moment bounds and exclusion processes on random Delaunay triangulations with conductances

Abstract

We consider the Voronoi tessellation associated to a stationary simple point process on $\mathbb{R}^d$ with finite and positive intensity. We introduce the Delaunay triangulation as its dual graph, i.e.~the graph with vertex set given by the point process and with edges between vertices whose Voronoi cells share a $(d-1)$-dimensional face. We also attach to each edge a random weight, called conductance. We provide sufficient conditions ensuring the integrability w.r.t. the Palm distribution of several quantities as weighted degrees and associated moments. These integrability properties are crucial in applications, as they allow to apply existing results on random walks, resistor networks and the symmetric simple exclusion processes with random conductances (cf. [1,11,12,13,14,15]). For the latter, while the moment bounds ensure its well definiteness and several properties, the same does not hold when the jump rates are not symmetric, i.e. for a generic simple exclusion process. In this case, by using a criterion from [13], we recover construction and properties of the simple exclusion process whenever the simple point process has finite range of dependence and the conductances are uniformly upper bounded. This last result relies on a suitable analysis of Bernoulli bond percolation on the Delaunay triangulation inspired by [2,3]. All the above results remain valid if the simple point process is stationary with respect to integer translations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. Faggionato, C. Tagliaferri. 2026-03-23. Moment bounds and exclusion processes on random Delaunay triangulations with conductances. https://arxiv.org/abs/2603.22562

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

KEEP EXPLORING

Related papers

The extremal process of a cascading family of branching Brownian motion

We study the asymptotic behaviour of the extremal process of a cascading family of branching Brownian motions. This is a particle system on the real line such that each particle has a type in addition to his position. Particles of type $1$ move on the real line according to Brownian motions and branch at rate $1$ into two children of type $1$. Furthermore, at rate $α$, they give birth to children too of type $2$. Particles of type $2$ move according to standard Brownian motion and branch at rate $1$, but cannot give birth to descendants of type $1$. We obtain the asymptotic behaviour of the extremal process of particles of type $2$.

math.PR

Breuer-Major Theorems for Hilbert Space-Valued Random Variables

Let $\{X_k\}_{k\in\mathbb Z}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal H_1$, and let $G:\mathcal H_1\to\mathcal H_2$ be a measurable map into another separable Hilbert space $\mathcal H_2$. We derive a central limit theorem for the centered normalized partial sums of the Hilbert space-valued subordinated process $\{G[X_k]\}_{k\in\mathbb Z}$. Our result holds under either of two sets of sufficient conditions, formulated in terms of the transformation $G$ and the temporal and cross-sectional dependence structure of $\{X_k\}_{k\in\mathbb Z}$. These conditions coincide in finite dimensions but lead to genuinely different phenomena in the infinite-dimensional setting. The proof relies on the recently developed Fourth Moment Theorem on Hilbert spaces, leveraging tools from the infinite-dimensional Malliavin-Stein framework. We also provide continuous-time and quantitative versions of the central limit theorem. In a series of examples, we recover and strengthen limit theorems for a wide array of statistics relevant in functional data analysis, and present, as an application of our result, a novel limit theorem in the framework of neural operators.

math.PR

Controlled rough SDEs, pathwise stochastic control and dynamic programming principles

We study stochastic optimal control of rough stochastic differential equations (RSDEs). This is in the spirit of the pathwise control problem (Lions--Souganidis 1998, Buckdahn--Ma 2007; also Davis--Burstein 1992), with renewed interest and recent works drawing motivation from filtering, SPDEs, and reinforcement learning. Results include regularity of rough value functions, validity of a rough dynamic programming principles and new rough stability results for HJB equations, removing excessive regularity demands previously imposed by flow transformation methods. Measurable selection is used to relate RSDEs to "doubly stochastic" SDEs under conditioning. In contrast to previous works, Brownian statistics for the to-be-conditioned-on noise are not required, aligned with the "pathwise" intuition that these should not matter upon conditioning. Depending on the chosen class of admissible controls, the involved processes may also be anticipating. The resulting stochastic value functions coincide in great generality for different classes of controls. RSDE theory offers a powerful and unified perspective on this problem class.

math.PR