Hyperuniformity in regular trees

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Byléhn, Mattias
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913503871238144
author Byléhn, Mattias
author_facet Byléhn, Mattias
contents We study notions of hyperuniformity for invariant locally square-integrable point processes in regular trees. We show that such point processes are never geometrically hyperuniform, and if the diffraction measure has support in the complementary series then the process is geometrically hyperfluctuating along all subsequences of radii. A definition of spectral hyperuniformity and stealth of a point process is given in terms of vanishing of the complementary series diffraction and sub-Poissonian decay of the principal series diffraction near the endpoints of the principal spectrum. Our main contribution is providing examples of stealthy invariant random lattice orbits in trees whose number variance grows strictly slower than the volume along some unbounded sequence of radii. These random lattice orbits are constructed from the fundamental groups of complete graphs and the Petersen graph.
format Preprint
id arxiv_https___arxiv_org_abs_2409_10998
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Hyperuniformity in regular trees
Byléhn, Mattias
Probability
Dynamical Systems
Group Theory
Primary: 60G55. Secondary: 43A90, 05C48
We study notions of hyperuniformity for invariant locally square-integrable point processes in regular trees. We show that such point processes are never geometrically hyperuniform, and if the diffraction measure has support in the complementary series then the process is geometrically hyperfluctuating along all subsequences of radii. A definition of spectral hyperuniformity and stealth of a point process is given in terms of vanishing of the complementary series diffraction and sub-Poissonian decay of the principal series diffraction near the endpoints of the principal spectrum. Our main contribution is providing examples of stealthy invariant random lattice orbits in trees whose number variance grows strictly slower than the volume along some unbounded sequence of radii. These random lattice orbits are constructed from the fundamental groups of complete graphs and the Petersen graph.
title Hyperuniformity in regular trees
topic Probability
Dynamical Systems
Group Theory
Primary: 60G55. Secondary: 43A90, 05C48
url https://arxiv.org/abs/2409.10998