Related papers: Uncountable Graphs and Invariant Measures on the S…
In this article we give an explicit classification for the countably infinite graphs $\mathcal{G}$ which are, for some $k$, $\geq$$ k$-homogeneous. It turns out that a $\geq$$k-$homogeneous graph $\mathcal{M}$ is non-homogeneous if and only…
Given a set $A$ of $n$ points (vertices) in general position in the plane, the \emph{complete geometric graph} $K_n[A]$ consists of all $\binom{n}{2}$ segments (edges) between the elements of $A$. It is known that the edge set of every…
A subset of a topological space is said to be \emph{universally measurable} if it is measured by the completion of each countably additive $\sigma$-finite Borel measure on the space, and \emph{universally null} if it has measure zero for…
We describe the spectrum of an ergodic invariant measure by examining the behaviour of its generic points. We define regular Wiener--Wintner generic points for a measure to generalise the characterisation of generic points for discrete…
Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…
Singular statistical models arise whenever different parameter values induce the same distribution, leading to non-identifiability and a breakdown of classical asymptotic theory. While existing approaches analyze these phenomena in…
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,…
We consider the adjacency matrix of the ensemble of Erd\H{o}s-R\'enyi random graphs which consists of graphs on $N$ vertices in which each edge occurs independently with probability $p$. We prove that in the regime $pN \gg 1$ these matrices…
We classify invariant probability measures for non-elementary groups of automorphisms, on any compact K\"ahler surface X, under the assumption that the group contains a so-called "parabolic automorphism". We also prove that except in…
For a positive integer $k$ and a graph $H$ on $k$ vertices, we are interested in the inducibility of $H$, denoted $\mathrm{ind}(H)$, which is defined as the maximum possible probability that choosing $k$ vertices uniformly at random from a…
We define a class of continuous graded graphs similar to the graph of Gelfand--Tsetlin patterns, and describe the set of all ergodic central measures of discrete type on the path spaces of such graphs. The main observation is that an…
We consider Bratteli diagrams of finite rank (not necessarily simple) and ergodic invariant measures with respect to the cofinal equivalence relation on their path spaces. It is shown that every ergodic invariant measure (finite or…
We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…
WWe define the notion of a random metric space and prove that with probability one such a space is isometricto the Urysohn universal metric space. The main technique is the study of universal and random distance matrices; we relate the…
We consider an independent and identically distributed (i.i.d.) random dynamical system of simple linear transformations on the unit interval $T_{\beta}(x)=\beta x$ (mod $1$), $x\in[0,1]$, $\beta>0$, which are the so-called…
Random graphs are an important tool for modelling and analyzing the underlying properties of complex real-world networks. In this paper, we study a class of random graphs known as the inhomogeneous random K-out graphs which were recently…
Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). J\'anos Pach (1981) answered this question in the negative. We…
We prove an arithmetic removal result for all compact abelian groups, generalizing a finitary removal result of Kr\'al', Serra and the third author. To this end, we consider infinite measurable hypergraphs that are invariant under certain…
We study 3-random-like graphs, that is, sequences of graphs in which the densities of triangles and anti-triangles converge to 1/8. Since the random graph ${\mathcal G}_{n,1/2}$ is, in particular, 3-random-like, this can be viewed as a weak…
We show the existence of Lebesgue-equivalent conservative and ergodic $\sigma$-finite invariant measures for a wide class of one-dimensional random maps consisting of piecewise convex maps. We also estimate the size of invariant measures…