Decompositions of finite high-dimensional random arrays

A $d$-dimensional random array on a nonempty set $I$ is a stochastic process $\boldsymbol{X}=\langle X_s:s\in {I\choose d}\rangle$ indexed by the set ${I\choose d}$ of all $d$-element subsets of $I$. We obtain structural decompositions of finite, high-dimensional random arrays whose distribution is invariant under certain symmetries. Our first main result is a distributional decomposition of finite, (approximately) spreadable, high-dimensional random arrays whose entries take values in a finite set; the two-dimensional case of this result is the finite version of an infinitary decomposition due to Fremlin and Talagrand. Our second main result is a physical decomposition of finite, spreadable, high-dimensional random arrays with square-integrable entries which is the analogue of the Hoeffding/Efron--Stein decomposition. All proofs are effective. We also present applications of these decompositions in the study of concentration of functions of finite, high-dimensional random arrays.

Authors

Publication Details

Journal
Fundamenta Mathematicae
Published
2024-12-27
DOI
https://doi.org/10.4064/fm221004-6-11
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decompositions of finite high-dimensional random arrays

Petros Valettas, Pandelis Dodos, Konstantinos Tyros
Fundamenta Mathematicae
Limits and Structures in Graph Theory
article

Decompositions of finite high-dimensional random arrays

Petros Valettas, Pandelis Dodos, Konstantinos Tyros
article en

Abstract

A $d$-dimensional random array on a nonempty set $I$ is a stochastic process $\boldsymbol{X}=\langle X_s:s\in {I\choose d}\rangle$ indexed by the set ${I\choose d}$ of all $d$-element subsets of $I$. We obtain structural decompositions of finite, high-dimensional random arrays whose distribution is invariant under certain symmetries. Our first main result is a distributional decomposition of finite, (approximately) spreadable, high-dimensional random arrays whose entries take values in a finite set; the two-dimensional case of this result is the finite version of an infinitary decomposition due to Fremlin and Talagrand. Our second main result is a physical decomposition of finite, spreadable, high-dimensional random arrays with square-integrable entries which is the analogue of the Hoeffding/Efron--Stein decomposition. All proofs are effective. We also present applications of these decompositions in the study of concentration of functions of finite, high-dimensional random arrays.

Fundamenta MathematicaeVol. 268(2)
Openalex Percentile: Top 99%
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.