Related papers: Combinatorial approach to the interpolation method…
While most classical NP-hard graph problems cannot be solved in time $2^{o(n)}$ on general graphs under the Exponential Time Hypothesis (ETH), many exhibit the square-root phenomenon and admit optimal algorithms running in time…
Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3-colorable, hamiltonian, etc.) if and only…
Consider a critical Erd\"os-R\'enyi random graph: $n$ is the number of vertices, each one of the $\binom{n}{2}$ possible edges is kept in the graph independently from the others with probability $n^{-1}+\lambda n^{-4/3}$, $\lambda$ being a…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
We study the connections between the notions of combinatorial discrepancy and graph degeneracy. In particular, we prove that the maximum discrepancy over all subgraphs $H$ of a graph $G$ of the neighborhood set system of $H$ is sandwiched…
We study large $n$ expansions for the partition function of a Coulomb gas $$Z_n=\frac 1 {\pi^n}\int_{\mathbb{C}^n}\prod_{1\le i<j\le n}|z_i-z_j|^2\prod_{i=1}^n e^{-nQ(z_i)}\, d^2 z_i,$$ where $Q$ is a radially symmetric confining potential…
Let $n, r, k$ be positive integers such that $3\leq k < n$ and $2\leq r \leq k-1$. Let $m(n, r, k)$ denote the maximum number of edges an $r$-uniform hypergraph on $n$ vertices can have under the condition that any collection of $i$ edges,…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
The family of visibility algorithms were recently introduced as mappings between time series and graphs. Here we extend this method to characterize spatially extended data structures by mapping scalar fields of arbitrary dimension into…
We present a new combinatorial approach to the Ising model incorporating arbitrary bond weights on planar graphs. In contrast to existing methodologies, the exact free energy is expressed as the determinant of a set of ordered and…
We study the directed polymer of length $t$ in a random potential with fixed endpoints in dimension 1+1 in the continuum and on the square lattice, by analytical and numerical methods. The universal regime of high temperature $T$ is…
Combinatorial optimization problems near algorithmic phase transitions represent a fundamental challenge for both classical algorithms and machine learning approaches. Among them, graph coloring stands as a prototypical constraint…
The estimation of various matrix integrals as the size of the matrices goes to infinity is motivated by theoretical physics, geometry and free probability questions. On a rigorous ground, only integrals of one matrix or of several matrices…
We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.' (1) If the constraint is specified by a monadic…
In this paper we consider graph algorithms in models of computation where the space usage (random accessible storage, in addition to the read only input) is sublinear in the number of edges $m$ and the access to input data is constrained.…
We solve the loop equations to all orders in $1/N^2$, for the Chain of Matrices matrix model (with possibly an external field coupled to the last matrix of the chain). We show that the topological expansion of the free energy, is, like for…
A theoretical model for polydisperse systems of hard spheres is said to be truncatable when the excess free energy depends on the size distribution through a finite number $K$ of moments. This Note proves an exact scaling relation for…
We consider the interacting Bose gas in the thermodynamic limit in a large box in $\R^d$ at positive temperature $1/\beta\in(0,\infty)$ with particle density $\sim\rho\in(0,\infty)$. We follow a path-integral approach and adopt from \cite…
Number partitioning is a classical problem from combinatorial optimisation. In physical terms it corresponds to a long range anti-ferromagnetic Ising spin glass. It has been rigorously proven that the low lying energies of number…
We introduce the notion of combinatorial encoding of continuous dynamical systems and suggest the first examples, which are the most interesting and important, namely, the combinatorial encoding of a Bernoulli process with continuous state…