Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-06T23:57:26.074Z Has data issue: false hasContentIssue false

On strongly rigid hyperfluctuating random measures

Published online by Cambridge University Press:  15 August 2022

Michael Andreas Klatt*
Affiliation:
Heinrich-Heine-University Düsseldorf
Günter Last*
Affiliation:
Karlsruhe Institute of Technology
*
*Postal address: Institut für Theoretische Physik II: Weiche Materie, Heinrich-Heine-Universität Düsseldorf, 40225 Düsseldorf, Germany; Experimental Physics, Saarland University, Center for Biophysics, 66123 Saarbrücken, Germany. Email address: klattm@hhu.de
**Postal address: Karlsruhe Institute of Technology, Institute for Stochastics, 76131 Karlsruhe, Germany. Email address: guenter.last@kit.edu
Rights & Permissions [Opens in a new window]

Abstract

In contrast to previous belief, we provide examples of stationary ergodic random measures that are both hyperfluctuating and strongly rigid. Therefore we study hyperplane intersection processes (HIPs) that are formed by the vertices of Poisson hyperplane tessellations. These HIPs are known to be hyperfluctuating, that is, the variance of the number of points in a bounded observation window grows faster than the size of the window. Here we show that the HIPs exhibit a particularly strong rigidity property. For any bounded Borel set B, an exponentially small (bounded) stopping set suffices to reconstruct the position of all points in B and, in fact, all hyperplanes intersecting B. Therefore the random measures supported by the hyperplane intersections of arbitrary (but fixed) dimension, are also hyperfluctuating. Our examples aid the search for relations between correlations, density fluctuations, and rigidity properties.

Information

Type
Original Article
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

Figure 1. Samples of Poisson hyperplane processes $\eta$ in ${\mathbb R}^2$ (a, b) and ${\mathbb R}^3$ (c) and the corresponding intersection processes $\Phi$ (dots) for two directional distributions: only three possible directions (a) and isotropic (b, c).

Figure 1

Figure 2. Reconstruction algorithm of $\eta\cap [K]$. Given a convex domain K, the algorithm recursively scans the points in $\Phi\cap K_{T_n}$ (solid circles). At step $n=16$, three hyperplanes are reconstructed (a). At step $n=112$, three polygons $P_1$, $P_2$, $P_3$ are reconstructed within $K_{T_n}$ (b). Hence all hyperplanes in $\eta\cap [K]$ (dashed lines) can be reconstructed (c).