Related papers: Algorithmic randomness and Ramsey properties of co…
In this review we discuss the relationship between random matrix theories and symmetric spaces. We show that the integration manifolds of random matrix theories, the eigenvalue distribution, and the Dyson and boundary indices characterizing…
We study algorithmic randomness and monotone complexity on product of the set of infinite binary sequences. We explore the following problems: monotone complexity on product space, Lambalgen's theorem for correlated probability,…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the…
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed…
We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…
We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…
We consider the space of countable structures with fixed underlying set in a given countable language. We show that the number of ergodic probability measures on this space that are $S_\infty$-invariant and concentrated on a single…
In this paper we investigate the connections between Ramsey properties of Fraisse classes K and the universal minimal flow M(G_K) of the automorphism group G_K of their Fraisse limits. As an extension of a result of Kechris, Pestov and…
We study a large class of amenable locally compact groups containing all solvable algebraic groups over a local field and their discrete subgroups. We show that the isoperimetric profile of these groups is in some sense optimal among…
Ramsey algebras is an attempt to investigate Ramsey spaces generated by algebras in a purely combinatorial fashion. Previous studies have focused on the basic properties of Ramsey algebras and the study of a few specific examples. In this…
The paper considers quantitative versions of different randomness notions: algorithmic test measures the amount of non-randomness (and is infinite for non-random sequences). We start with computable measures on Cantor space (and Martin-Lof…
Carlson introduced the notion of a Ramsey space as a generalization to the Ellentuck space. When a Ramsey space is induced by an algebra, Carlson suggested a study of its purely combinatorial version now called Ramsey algebra. Some basic…
There is a long history of studying Ramsey theory using the algebraic structure of the Stone-\v{C}ech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic…
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 vertices. This is a common strengthening of the…
We explore the properties of non-piecewise syndetic sets with positive upper density, which we call "discordant", in countably infinite amenable (semi)groups. Sets of this kind are involved in many questions of Ramsey theory and manifest…
In this paper, we consider robust control using randomized algorithms. We extend the existing order statistics distribution theory to the general case in which the distribution of population is not assumed to be continuous and the order…
We associate ergodic properties to some subsets of the natural numbers. For any given family of subsets of the natural numbers one may study the question of occurrence of certain "algebraic patterns" in every subset in the family. By…
We investigate individual fairness in generative probabilistic classifiers by analysing the robustness of posterior inferences to perturbations in private features. Building on established results in robustness analysis, we hypothesise a…