Related papers: Relatively exchangeable structures
It is often convenient to represent a process for randomly generating a graph as a graphon. (More precisely, these give \emph{vertex exchangeable} processes -- those processes in which each vertex is treated the same way.) Other structures…
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…
Trait allocations are a class of combinatorial structures in which data may belong to multiple groups and may have different levels of belonging in each group. Often the data are also exchangeable, i.e., their joint distribution is…
We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…
We study continuous homomorphisms between algebras of iterated Laurent series over a commutative ring. We give a full description of such homomorphisms in terms of a discrete data determined by the images of parameters. In similar terms, we…
De Finetti's classical result of [18] identifying the law of an exchangeable family of random variables as a mixture of i.i.d. laws was extended to structure theorems for more complex notions of exchangeability by Aldous [1,2,3], Hoover…
This paper defines and examines the basic properties of noncommutative analogues of almost complex structures, integrable almost complex structures, holomorphic curvature, cohomology, and holomorphic sheaves. The starting point is a…
In this paper, we mainly study structure of multiplicative simple Hom-Jordan algebras. We talk about equivalent conditions for multiplicative Hom-Jordan algebras being solvable, simple and semi-simple. As an application, we give a theorem…
We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their…
A relational structure is homomorphism-homogeneous if every homomorphism between finite substructures extends to an endomorphism of the structure. This notion was introduced recently by Cameron and Ne\v{s}et\v{r}il. In this paper we…
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…
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…
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
Let $f: M \to M$ be a $C^{1+\alpha}$ map/diffeomorphism of a compact Riemannian manifold $M$ and $\mu$ be an expanding/hyperbolic ergodic $f$-invariant Borel probability measure on $M$. Assume $f$ is average conformal expanding/hyperbolic…
Standard clustering techniques assume a common configuration for all features in a dataset. However, when dealing with multi-view or longitudinal data, the clusters' number, frequencies, and shapes may need to vary across features to…
We start an analysis of geometric properties of a structure relative to a reduct. In particular, we look at definability of groups and fields in this context. In the relatively one-based case, every definable group is isogenous to a…
A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…
Consider a (possibly infinite) exchangeable sequence X={X_n:1\leqn<N}, where N\in N\cup {\infty}, with values in a Borel space (A,A), and note X_n=(X_1,...,X_n). We say that X is Hoeffding decomposable if, for each n, every square…
The $r$-KdV-CH hierarchy is a generalization of the Korteweg-de Vries and Camassa-Holm hierarchies parametrized by $r+1$ constants. In this paper we clarify some properties of its multi-Hamiltonian structures, prove the semisimplicity of…
Let $S$ be a Polish space and $(X_n:n\geq1)$ an exchangeable sequence of $S$-valued random variables. Let $\alpha_n(\cdot)=P(X_{n+1}\in \cdot\mid X_1,\...,X_n)$ be the predictive measure and $\alpha$ a random probability measure on $S$ such…