Related papers: Spectral Independence via Stability and Applicatio…
Analysis of algorithms on time-varying networks (often called evolving graphs) is a modern challenge in theoretical computer science. The edge-Markovian is a relatively simple and comprehensive model of evolving graphs: every pair of…
We present a randomized algorithm that takes as input an undirected $n$-vertex graph $G$ with maximum degree $\Delta$ and an integer $k > 3\Delta$, and returns a random proper $k$-coloring of $G$. The distribution of the coloring is…
We study one of the simplest integrable two-dimensional quantum field theories with a boundary: $N$ free non-compact scalars in the bulk, constrained non-linearly on the boundary to lie on an $(N-1)$-sphere of radius $1/\sqrt{g}$. The $N=1$…
We consider the problem of sampling from the Ising model when the underlying interaction matrix has eigenvalues lying within an interval of length $\gamma$. Recent work in this setting has shown various algorithmic results that apply…
A highly influential result of Nikiforov states that if an $n$-vertex graph $G$ contains at least $\gamma n^h$ copies of a fixed $h$-vertex graph $H$, then $G$ contains a blowup of $H$ of order $\Omega_{\gamma,H}(\log n)$. While the…
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is also used to model more traditional CSPs relevant to AI,…
\emph{Strictly Chordality-$k$ graphs ($SC_k$)} are graphs which are either cycle-free or every induced cycle is of length exactly $k, k \geq 3$. Strictly chordality-3 and strictly chordality-4 graphs are well known chordal and chordal…
Using fermionic representation of spin degrees of freedom within the Popov-Fedotov approach we develop an algorithm for Monte Carlo sampling of skeleton Feynman diagrams for Heisenberg type models. Our scheme works without modifications for…
Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the…
Considering the worst-case scenario, junction tree algorithm remains the most general solution for exact MAP inference with polynomial run-time guarantees. Unfortunately, its main tractability assumption requires the treewidth of a…
Starting from the nonlinear ODE $z'' + f(t)\,z + g(t)\, z^{m}=0$ with $m>1$, we show that after a suitable normal-form reduction of any Hill equation one may, without loss of generality, fix the linear part as $f(t)\equiv \omega^{2}$ (with…
In this paper, we investigate the complexity of Maximum Independent Set (MIS) in the class of $H$-free graphs, that is, graphs excluding a fixed graph as an induced subgraph. Given that the problem remains $NP$-hard for most graphs $H$, we…
We study periodic spectral problems through their connection with supersymmetric gauge theories and two-dimensional conformal field theory. To characterize the associated stability chart, we develop a novel and systematic approach for…
We investigate the distributed complexity of maximal matching and maximal independent set (MIS) in hypergraphs in the LOCAL model. A maximal matching of a hypergraph $H=(V_H,E_H)$ is a maximal disjoint set $M\subseteq E_H$ of hyperedges and…
We generalize two main theorems of matching polynomials of undirected simple graphs, namely, real-rootedness and the Heilmann-Lieb root bound. Viewing the matching polynomial of a graph $G$ as the independence polynomial of the line graph…
In this paper, we consider algorithms for edge-coloring multigraphs $G$ of bounded maximum degree, i.e., $\Delta(G) = O(1)$. Shannon's theorem states that any multigraph of maximum degree $\Delta$ can be properly edge-colored with…
We study the approximability of the Maximum Independent Set (MIS) problem in $H$-free graphs (that is, graphs which do not admit $H$ as an induced subgraph). As one motivation we investigate the following conjecture: for every fixed graph…
A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in…
For an $n \times n$ nonnegative matrix $P$, an isomorphism is obtained between the lattice of initial subsets (of ${1,...,n}$) for $P$ and the lattice of $P$-invariant faces of the nonnegative orthant $\IR^{n}_{+}$. Motivated by this…
This paper addresses the existence and spectral stability of traveling fronts for nonlinear hyperbolic equations with a positive "damping" term and a reaction function of bistable type. Particular cases of the former include the relaxed…