Related papers: Natural quasirandomness properties
If quantum mechanics is taken for granted the randomness derived from it may be vacuous or even delusional, yet sufficient for many practical purposes. "Random" quantum events are intimately related to the emergence of both space-time as…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
We show that for infinite planar unimodular random rooted maps, many global geometric and probabilistic properties are equivalent, and are determined by a natural, local notion of average curvature. This dichotomy includes properties…
Mixing (or quasirandom) properties of the natural transition matrix associated to a graph can be quantified by its distance to the complete graph. Different mixing properties correspond to different norms to measure this distance. For dense…
We present a few combinatorial identities which were encountered in our work on the spectral theory of quantum graphs. They establish a new connection between the theory of random matrix ensembles and combinatorics.
We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
Most real-world networks are endowed with the small-world property, by means of which the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. The evidence sparkled a wealth of studies…
In this paper we explore maximal deviations of large random structures from their typical behavior. We introduce a model for a high-dimensional random graph process and ask analogous questions to those of Vapnik and Chervonenkis for…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
By studying the commuting graphs of conjugacy classes of the sequence of Heisenberg groups $H_{2n+1}(p)$ and their limit $H_\infty(p)$ we find pseudo-random behavior (and the random graph in the limiting case). This makes a nice case study…
Homophily is the seemingly ubiquitous tendency for people to connect and interact with other individuals who are similar to them. This is a well-documented principle and is fundamental for how society organizes. Although many social…
We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…
Diversities have recently been developed as multiway metrics admitting clear and useful notions of hyperconvexity and tight span. In this note we consider the analytic properties of diversities, in particular the generalizations of uniform…
We study a random field obtained by counting the number of balls containing each point, when overlapping balls are thrown at random according to a Poisson random measure. We are particularly interested in the local asymptotical…
Given a hereditary graph property $\mathcal{P}$, consider distributions of random orderings of vertices of graphs $G\in\mathcal{P}$ that are preserved under isomorphisms and under taking induced subgraphs. We show that for many properties…
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…