Related papers: Uncountable Graphs and Invariant Measures on the S…

We study the problem of when, given a countable homogeneous structure $M$ and a space $S$ of expansions of $M$, every $\mathrm{Aut}(M)$-invariant probability measure on $S$ is exchangeable (i.e. invariant under all permutations of the…

We prove a model-theoretic representation theorem for the distribution of an ergodic exchangeable $k$-uniform hypergraph: every such measure arises as the pushforward of the countably-iterated Morley product of a global Borel-definable…

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

We study a uniform, quantitative form of the amenability-hyperfiniteness paradigm for bounded-degree Borel graphs generating countable Borel equivalence relations. We introduce \emph{uniform Borel amenability} and prove that it is…

Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…

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…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…

A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…

A $k$-uniform hypergraph $M$ is set-homogeneous if it is countable (possibly finite) and whenever two finite induced subhypergraphs $U,V$ are isomorphic there is $g\in Aut(M)$ with $U^g=V$; the hypergraph $M$ is said to be homogeneous if in…

We consider the universality for the trace invariants of $c_1 N \times \cdots \times c_D N$ tensors with i.i.d. complex random elements. In the case $c_1 = \cdots = c_D$, Gurau derived the universality in the limit $N \to \infty$ by…

We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…

In the classical Erd\"os-R\'enyi random graph G(n,p) there are n vertices and each of the possible edges is independently present with probability p. The random graph G(n,p) is homogeneous in the sense that all vertices have the same…

We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…

We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of…

We introduce a model of the set of all Polish (=separable complete metric) spaces: the cone $\cal R$ of distance matrices, and consider geometric and probabilistic problems connected with this object. The notion of the universal distance…

We define an infinite graded graph of ordered pairs and a~canonical action of the group $\mathbb{Z}$ (the adic action) and of the infinite sum of groups of order two~$\mathcal{D}=\sum_1^{\infty} \mathbb{Z}/2\mathbb{Z}$ on the path space of…

Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric…

Let $\mathcal{E}$ denote the space of entire functions with the topology of uniform convergence on compact sets. The action of $\mathbb C$ by translations on $\mathcal E$ is defined by $T_zf(w) = f(w+z)$. Let $\mathcal{U}$ denote the set of…

Recall that the Rado graph is the unique countable graph that realizes all one-point extensions of its finite subgraphs. The Rado graph is well-known to be universal and homogeneous in the sense that every isomorphism between finite…