For $ G $ a closed subgroup of $ S_ {\infty} $, we provide a precise combinatorial
characterization of when the universal minimal flow $ M (G) $ is metrizable. In particular …

We study semantic models of probabilistic programming languages over graphs, and
establish a connection to graphons from graph theory and combinatorics. We show that …

METRIZABLE UNIVERSAL MINIMAL FLOWS OF POLISH GROUPS HAVE A COMEAGRE
ORBIT Itaı Ben Yaacov, Julien Melleray and Todor Tsankov Page 1 Geom. Funct. Anal. Vol. 27 …

We prove that if the universal minimal flow of a Polish group is metrizable and contains a
orbit, then it is isomorphic to the completion of the homogeneous space and show how this …

We study automorphism groups of sparse graphs from the viewpoint of topological dynamics
and the Kechris, Pestov, Todorčević correspondence. We investigate amenable and …

We show that every free amalgamation class of finite structures with relations and
(symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of …

Let M be an ℵ0-categorical structure and assume that M has no algebraicity and has weak
elimination of imaginaries. Generalizing classical theorems of de Finetti and Ryll …

It seems that combinatorics, and graph theory in particular, reached mathematical maturity
relatively recently. Perhaps as a result of this there are not too many essential stories which …

The space of chains on a compact connected space encodes all the different ways of
continuously growing out of a point until exhausting the space. A chain is generic if its orbit …

Cocycles are a key object in Antolín Camarena and Szegedy's theory of nilspaces. We
introduce variants of these cocycles, named nilcycles, enabling us to give conditions which …