Related papers: Combinatorial approach to the interpolation method…
For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…
In two papers Franz, Leone and Toninelli proved bounds for the free energy of diluted random constraints satisfaction problems, for a Poisson degree distribution [5] and a general distribution [6]. Panchenko and Talagrand [16] simplified…
In the random geometric graph $G(n,r_n)$, $n$ vertices are placed randomly in Euclidean $d$-space and edges are added between any pair of vertices distant at most $r_n$ from each other. We establish strong laws of large numbers (LLNs) for a…
We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…
Many problems in extremal combinatorics can be reduced to determining the independence number of a specific auxiliary hypergraph. We present two such problems, one from discrete geometry and one from hypergraph Tur\'an theory. Using results…
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…
The study of spins and particles on graphs has broad applications, from the dynamics of interacting systems on networks to combinatorial problems. Here, we study the large-$n$ limit of the $O(n)$ model on graphs, which is considerably more…
We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…
We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…
The perturbative expansion introduced by Zwanzig [R. W. Zwanzig, J. Chem. Phys. {\bf 22}, 1420 (1954)] expresses the difference in Helmholtz free energy between a system of interest and that of a reference system as series of cumulants…
We introduce a diagrammatic formulation for a cavity field expansion around the critical temperature. This approach allows us to obtain a theory for the overlap's fluctuations and, in particular, the linear part of the Ghirlanda-Guerra…
Finding independent sets of maximum size in fixed graphs is well known to be an NP-hard task. Using scaling limits, we characterise the asymptotics of sequential degree-greedy explorations and provide sufficient conditions for this…
This paper studies $k$-claw-free graphs, exploring the connection between an extremal combinatorics question and the power of a convex program in approximating the maximum-weight independent set in this graph class. For the extremal…
Many natural computational problems, including e.g. Max Weight Independent Set, Feedback Vertex Set, or Vertex Planarization, can be unified under an umbrella of finding the largest sparse induced subgraph, that satisfies some property…
Combinatorial optimization problems are pervasive across science and industry. Modern deep learning tools are poised to solve these problems at unprecedented scales, but a unifying framework that incorporates insights from statistical…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
Interdiction problems ask about the worst-case impact of a limited change to an underlying optimization problem. They are a natural way to measure the robustness of a system, or to identify its weakest spots. Interdiction problems have been…
Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…
The two-star random graph is the simplest exponential random graph model with nontrivial interactions between the graph edges. We propose a set of auxiliary variables that control the thermodynamic limit where the number of vertices N tends…
Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for…