Related papers: Limits of sparse hypergraphs
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
Subgraph counts - in particular the number of occurrences of small shapes such as triangles - characterize properties of random networks, and as a result have seen wide use as network summary statistics. However, subgraphs are typically…
We work out the graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function $W(x,y)$ on the unit square, with $x$ and $y$ uniform on the interval $(0,1)$.…
The main goal of this paper is to build a measurable analogue to the theory of weighted networks on infinite graphs. Our basic setting is an infinite $\sigma$-finite measure space $(V, \mathcal B, \mu)$ and a symmetric measure $\rho$ on…
Subgraph densities have been defined, and served as basic tools, both in the case of graphons (limits of dense graph sequences) and graphings (limits of bounded-degree graph sequences). While limit objects have been described for the…
Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which…
We study the compactness problem for moduli spaces of holomorphic supercurves which, being motivated by supergeometry, are perturbed such as to allow for transversality. We give an explicit construction of limiting objects for sequences of…
Forbidden Patterns Problems (FPPs) are a proper generalisation of Constraint Satisfaction Problems (CSPs). However, we show that when the input is connected and belongs to a class which has low tree-depth decomposition (e.g. structure of…
High dimensional, sparsely populated data spaces have been characterized in terms of ultrametric topology. This implies that there are natural, not necessarily unique, tree or hierarchy structures defined by the ultrametric topology. In…
We investigate structural properties of large, sparse random graphs through the lens of "sampling convergence" (Borgs et. al. (2017)). Sampling convergence generalizes left convergence to sparse graphs, and describes the limit in terms of a…
Compact locally maximal hyperbolic sets are studied via geometrically defined functional spaces that take advantage of the smoothness of the map in a neighborhood of the hyperbolic set. This provides a self-contained theory that not only…
We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…
In 2013, Bollob\'as, Mitsche, and Pralat at gave upper and lower bounds for the likely metric dimension of random Erd\H{o}s-R\'enyi graphs $G(n,p)$ for a large range of expected degrees $d=pn$. However, their results only apply when $d \ge…
Many physical systems -- such as optical waveguide lattices and dense neuronal or vascular networks -- can be modeled by metric graphs, where slender "wires" (edges) support wave or diffusion equations subject to Kirchhoff conditions at the…
We revisit the concept of minimal rigidity as applied to soft repulsive, frictionless sphere packings in two-dimensions with the introduction of the jamming graph. Minimal rigidity is a purely combinatorial property encoded via Laman's…
The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
Cuts in graphs are a fundamental object of study, and play a central role in the study of graph algorithms. The problem of sparsifying a graph while approximately preserving its cut structure has been extensively studied and has many…