Related papers: Limits of Dense Simplicial Complexes
We study the dynamics of the metrics generated by measure preserving transformations. We consider a sequence of average metrics and define the corresponding sequence of $\epsilon$-entropies ({\it scaling sequence}) of the measure with…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
In this paper we describe a triple correspondence between graph limits, information theory and group theory. We put forward a new graph limit concept called log-convergence that is closely connected to dense graph limits but its main…
In this paper, we systematically develop the $m$-contiguity distance between simplicial maps as a discrete approximation framework for homotopical complexity in the category of simplicial complexes. We construct an increasing sequence of…
We find sharp upper bounds on the order of the automorphism group of a hypersurface in complex projective space in every dimension and degree. In each case, we prove that the hypersurface realizing the upper bound is unique up to…
We give a concrete sufficient condition for a simply-connected domain to be the image of the unit disk under a nonexpansive conformal map. This class of domains is also characterized by having sufficiently dense harmonic measure. The…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
We consider the geometry relaxation of an isolated point defect embedded in a homogeneous crystalline solid, within an atomistic description. We prove a sharp convergence rate for a periodic supercell approximation with respect to uniform…
We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…
We consider the problem of characterizing derived endomorphism algebras of simple objects in length categories up to quasi-isomorphism. We give such a characterization for module categories, abelian categories, exact categories, as well as,…
We show that s-convergence of graph sequences is equivalent to the convergence of certain compact sets, called shapes, of Borel probability measures. This result is analogous to the characterization of graphon convergence (with respect to…
We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…
In this paper we prove that various quasi-categories whose objects are $\infty$-categories in a very general sense are complete: admitting limits indexed by all simplicial sets. This result and others of a similar flavor follow from a…
Within the framework of hierarchical clustering scenarios, we investigate the consequences for the properties of virialized halos of the constraints provided by numerical simulations on the first few correlation functions. Thus, we show…
We say that an ideal I is homogeneous, if its restriction to any I-positive subset is isomorphic to I. The paper investigates basic properties of this notion -- we give examples of homogeneous ideals and present some applications to…
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 problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the $(d,k,t)$-model, and binary…
We generalize the fact that graphs with small VC-dimension can be approximated by rectangles, showing that hypergraphs with small VC_k-dimension (equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph) can be…
We introduce a general notion of covering property, of which many classical definitions are particular instances. Notions of closure under various sorts of convergence, or, more generally, under taking kinds of accumulation points, are…