相关论文: The Aldous$\unicode{x2013}$Hoover Theorem in Categ…
We show that the Aldous--Hoover Theorem, giving representations for exchangeable arrays of Borel-valued random variables, extends to random variables where the common distribution of the random variables is Radon, or even merely compact, a…
In an array of random variables, each row can be regarded as a single, sequence-valued random variable. In this way, the array is seen as a sequence of sequences. Such an array is said to be row exchangeable if each row is an exchangeable…
We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is…
We resume the results from \cite{Vershik FA} on the classification of measurable functions in several variables, with some minor corrections of purely technical nature, and give a partial solution to the characterization problem of…
In this paper we generalize the Aldous-Hoover-Kallenberg theorem concerning representations of distributions of exchangeable arrays via collections of measurable maps. We give criteria when such a representation theorem exists for arrays…
Many statistical methods for network data parameterize the edge-probability by attributing latent traits to the vertices such as block structure and assume exchangeability in the sense of the Aldous-Hoover representation theorem. Empirical…
Statistical network modeling has focused on representing the graph as a discrete structure, namely the adjacency matrix, and considering the exchangeability of this array. In such cases, the Aldous-Hoover representation theorem (Aldous,…
Many popular network models rely on the assumption of (vertex) exchangeability, in which the distribution of the graph is invariant to relabelings of the vertices. However, the Aldous-Hoover theorem guarantees that these graphs are dense or…
We consider (self-adjoint) families of infinite matrices of noncommutative random variables such that the joint distribution of their entries is invariant under conjugation by a free quantum group. For the free orthogonal and…
We consider the notion of the matrix (tensor) distribution of a measurable function of several variables. On the one hand, it is an invariant of this function with respect to a certain group of transformations of variables; on the other…
Aldous-Broder algorithm is a famous algorithm used to sample a uniform spanning tree of any finite connected graph $G$, but it is more general: given an irreducible and reversible Markov chain $M$ on $G$ started at $r$, the tree rooted at…
We present a novel proof of de Finetti's Theorem characterizing permutation-invariant probability measures of infinite sequences of variables, so-called exchangeable measures. The proof is phrased in the language of Markov categories, which…
In his 1985 survey of notions of exchangeability, Aldous introduced a form of exchangeability corresponding to the symmetries of the infinite discrete cube, and asked whether these exchangeable probability measures enjoy a representation…
We present a detailed proof of the Dovbysh-Sudakov representation for symmetric positive definite weakly exchangeable infinite random arrays, called Gram-de Finetti matrices, which is based on the representation result of Aldous and Hoover…
Conditional independence and Markov properties are powerful tools allowing expression of multidimensional probability distributions by means of low-dimensional ones. As multidimensional possibilistic models have been studied for several…
A random phase property establishing a link between quasi-one-dimensional random Schroedinger operators and full random matrix theory is advocated. Briefly summarized it states that the random transfer matrices placed into a normal system…
The two components for infinite exchangeability of a sequence of distributions $(P_n)$ are (i) consistency, and (ii) finite exchangeability for each $n$. A consequence of the Aldous-Hoover theorem is that any node-exchangeable,…
A sequence of random variables is called \textit{exchangeable} if its joint distribution is invariant under permutations of indices. The original formulation of de Finetti's theorem roughly says that any exchangeable sequence of…
Markov categories have recently turned out to be a powerful high-level framework for probability and statistics. They accommodate purely categorical definitions of notions like conditional probability and almost sure equality, as well as…