Related papers: Natural quasirandomness properties
In this paper we show that in systems where the probability distribution of the the overlap is non trivial in the infinity volume limit, the property of ultrametricity can be proved in general starting from two very simple and natural…
We describe structure of quasihomomorphisms from arbitrary groups to discrete groups. We show that all quasihomomorphisms are 'constructible', i.e., are obtained via certain natural operations from homomorphisms to some groups and…
The notion of geometric version of an infinitely divisible law is introduced. Concepts parallel to attraction and partial attraction are developed and studied in the setup of geometric summing of random variables.
Hypergraphs have seen widespread application in network and data science communities in recent years. We present a survey of recent work to construct auxiliary structures from hypergraphs -- specifically simplicial, relative, and chain…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
Random recursive hypergraphs grow by adding, at each step, a vertex and an edge formed by joining the new vertex to a randomly chosen existing edge. The model is parameter-free, and several characteristics of emerging hypergraphs admit neat…
Probability theory can be modified in essentially one way while maintaining consistency with the basic Bayesian framework. This modification results in copies of standard probability theory for real, complex or quaternion probabilities.…
This paper is a contribution to the study of parity games and the recent constructions of three quasipolynomial time algorithms for solving them. We revisit a result of Czerwi\'nski, Daviaud, Fijalkow, Jurdzi\'nski, Lazi\'c, and Parys…
A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a $2$-colouring of the edges of a large complete graph is asymptotically minimized by a random colouring. It is well known that the disjoint union of…
The natural duality between "topological" and "regular," both considered as convergence space properties, extends naturally to p-regular convergence spaces, resulting in the new concept of a p-topological convergence space. Taking advantage…
Small-world graphs, which combine randomized and structured elements, are seen as prevalent in nature. Jon Kleinberg showed that in some graphs of this type it is possible to route, or navigate, between vertices in few steps even with very…
We describe a natural topological generalization of edge expansion for graphs to regular CW complexes and prove that this property holds with high probability for certain random complexes.
Given a finite relational language $\calL$, a hereditary $\calL$-property is a class of finite $\calL$-structures which is closed under isomorphism and model theoretic substructure. This notion encompasses many objects of study in extremal…
We prove analogues of several well-known results concerning rational morphisms between quadrics for the class of so-called quasilinear $p$-hypersurfaces. These hypersurfaces are nowhere smooth over the base field, so many of the geometric…
Graphs are used to represent and analyze data in domains as diverse as physics, biology, chemistry, planetary science, and the social sciences. Across domains, random graph models relate generative processes to expected graph properties,…
We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie with a certain radius. From a modelling…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
The normal forms of different one- and two- parametric solutions of Thirring model are connected with each other by making use of generalized conformal shift transformations. A new alternative sources of superselection rules are shown and…
We discuss an extension of classical combinatorics theory to the case of spatially distributed objects.