Stable transports between stationary random measures
From MaRDI portal
(Redirected from Publication:303574)
Abstract: We give an algorithm to construct a translation-invariant transport kernel between ergodic stationary random measures and on , given that they have equal intensities. As a result, this yields a construction of a shift-coupling of an ergodic stationary random measure and its Palm version. This algorithm constructs the transport kernel in a deterministic manner given realizations and of the measures. The (non-constructive) existence of such a transport kernel was proved in [8]. Our algorithm is a generalization of the work of [3], in which a construction is provided for the Lebesgue measure and an ergodic simple point process. In the general case, we limit ourselves to what we call constrained densities and transport kernels. We give a definition of stability of constrained densities and introduce our construction algorithm inspired by the Gale-Shapley stable marriage algorithm. For stable constrained densities, we study existence, uniqueness, monotonicity w.r.t. the measures and boundedness.
Recommendations
Cited in
(6)- Transporting random measures on the line and embedding excursions into Brownian motion
- Transportation of diffuse random measures on \(\mathbb{R}^d\)
- Shift-coupling of random rooted graphs and networks
- Construction and characterization of stationary and mass-stationary random measures on \(\mathbb{R}^d\)
- Invariant transports of stationary random measures and mass-stationarity
- Central limit theorem for exponentially quasi-local statistics of spin models on Cayley graphs
This page was built for publication: Stable transports between stationary random measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q303574)