Related papers: Limits of Dense Simplicial Complexes

We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

In this paper, using the concept of natural density, we have introduced the ideas of statistical and rough statistical convergence in an $S$-metric space. We have investigated some of their basic properties. We have defined statistical…

This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in…

The paper surveys recent progress in understanding geometric, topological and combinatorial properties of large simplicial complexes, focusing mainly on ampleness, connectivity and universality. In the first part of the paper we concentrate…

We consider mesh functions which are discrete convex in the sense that their central second order directional derivatives are positive. Analogous to the case of a uniformly bounded sequence of convex functions, we prove that the uniform…

In this paper, we consider a fixed metric space (possibly an oriented Riemannian manifold with boundary) with an increasing sequence of distance functions and a uniform upper bound on diameter. When the metric space endowed with the…

Graphons have traditionally served as limit objects for dense graph sequences, with the cut distance serving as the metric for convergence. However, sparse graph sequences converge to the trivial graphon under the conventional definition of…

We prove the following monotonicity result for the holonomy group: Given a sequence of metric connections converging in $C^0$ such that all its members have holonomy contained in a closed group $H$, also their limit connection needs to have…

Consider a holomorphic foliation with singularities of a 2-dimensional complex manifold. In this article we prove a new sufficient condition for this foliation to have countably many homologically independent complex limit cycles. In…

We study the recently introduced problem of finding dense common subgraphs: Given a sequence of graphs that share the same vertex set, the goal is to find a subset of vertices $S$ that maximizes some aggregate measure of the density of the…

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…

To illustrate that the notion of convergence of submodular function sequences fits reasonably into the limit theory of graphs, we describe several classes of matroids and other submodular setfunctions for which convergence of appropriate…

Several recent works have identified patterns that must exist in dense subsets of either the vertices or the edges of a large hypercube. We introduce a framework, based on the concept of series-parallel graphs, that unifies and generalizes…

We establish a regular sampling theory in the range of the analysis operator of a continuous frame having a unitary structure. The unitary structure is related with a unitary representation of a locally compact abelian group on a separable…

Convergence spaces are a generalization of topological spaces. The category of convergence spaces is well-suited for Algebraic Topology, one of the reasons is the existence of exponential objects provided by continuous convergence. In this…

In two recent papers by Veitch and Roy and by Borgs, Chayes, Cohn, and Holden, a new class of sparse random graph processes based on the concept of graphexes over $\sigma$-finite measure spaces has been introduced. In this paper, we…

Summarizing data samples by quantitative measures has a long history, with descriptive statistics being a case in point. However, as natural language processing methods flourish, there are still insufficient characteristic metrics to…

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

We show that the homogeneous approximation property and the comparison theorem hold for arbitrary coherent frames. This observation answers some questions about the density of frames that are not covered by the theory of Balan, Casazza,…