Related papers: Limits of sparse hypergraphs
Sparsity-constrained optimization is an important and challenging problem that has wide applicability in data mining, machine learning, and statistics. In this paper, we focus on sparsity-constrained optimization in cases where the cost…
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…
The Constraint Satisfaction Problem (CSP) and its counting counterpart appears under different guises in many areas of mathematics, computer science, and elsewhere. Its structural and algorithmic properties have demonstrated to play a…
In this paper the problem of finding various spanning structures in random hypergraphs is studied. We notice that a general result of Riordan [Spanning subgraphs of random graphs, Combinatorics, Probability & Computing 9 (2000), no. 2,…
The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of…
We study planar "vertex" models, which are probability measures on edge subsets of a planar graph, satisfying certain constraints at each vertex, examples including dimer model, and 1-2 model, which we will define. We express the local…
Recent works of Alon-Shapira and R\"odl-Schacht have demonstrated that every hereditary property of undirected graphs or hypergraphs is testable with one-sided error; informally, this means that if a graph or hypergraph satisfies that…
An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP…
In this paper authors consider representations of graphs in Hilbert spaces applying a restriction of local scalarity on them. It enables to obtain a theory, similar to the classical theory of representations of graphs in vector spaces. In…
Two directions in algorithms and complexity involve: (1) classifying which optimization problems can be solved in polynomial time, and (2) understanding which computational problems are hard to solve \emph{on average} in addition to the…
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter $\lambda$, each matching $M$ is assigned a weight $\lambda^{|M|}$. The counting…
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…
Cut and spectral sparsification of graphs have numerous applications, including e.g. speeding up algorithms for cuts and Laplacian solvers. These powerful notions have recently been extended to hypergraphs, which are much richer and may…
We study expansions near the boundary of solutions to the Dirichlet problem for minimal graphs in the hyperbolic space and prove the local convergence of such expansions if the boundary is locally analytic. As a consequence, we prove a…
The notion of nowhere denseness is one of the central concepts of the recently developed theory of sparse graphs. We study the properties of nowhere dense graph classes by investigating appropriate limit objects defined using the…
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…
The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…
Controlling real-world networked systems, including ecological, biomedical, and engineered networks that exhibit higher-order interactions, remains challenging due to inherent nonlinearities and large system scales. Despite extensive…
We study the local evolution of Prim's algorithm on large finite weighted graphs. When performed for $n$ steps, where $n$ is the size of the graph, Prim's algorithm will construct the minimal spanning tree (MST). We assume that our graphs…
The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…