Related papers: Combinatorial approach to the interpolation method…
We prove that a formula predicted on the basis of non-rigorous physics arguments [Zdeborova and Krzakala: Phys. Rev. E (2007)] provides a lower bound on the chromatic number of sparse random graphs. The proof is based on the interpolation…
In this paper we study multi-matrix models whose potentials are perturbations of the quadratic potential associated with independent GUE random matrices. More precisely, we compute the free energy and the expectation of the trace of…
We consider a binary system of small and large spheres of finite size in a continuous medium interacting via a non-negative potential. We work in the canonical ensemble and compute upper and lower bound for the free energy at finite and…
We study Extremal Combinatorics problems where local properties are used to derive global properties. That is, we consider a given configuration where every small piece of the configuration satisfies some restriction, and use this local…
We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on recent deep results in combinatorial group theory. It applies to both regular and irregular random graphs. Let G be a random…
Systems with many interacting stochastic constituents are fully characterized by their free energy. Computing this quantity is therefore the objective of various approaches, notably perturbative expansions, which are applied in problems…
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…
We obtain an explicit expression for the multipoint energy correlations of a non solvable two-dimensional Ising models with nearest neighbor ferromagnetic interactions plus a weak finite range interaction of strength $\lambda$, in a scaling…
Using the theory of $L^p$-graphons (Borgs et al, 2014), we derive and rigorously justify the continuum limit for systems of differential equations on sparse random graphs. Specifically, we show that the solutions of the initial value…
In this paper, we study convergence of coupled dynamical systems on convergent sequences of graphs to a continuum limit. We show that the solutions of the initial value problem for the dynamical system on a convergent graph sequence tend to…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
Combinatorial optimization is a fundamental problem found in many fields. In many real life situations, the constraints and the objective function forming the optimization problem are naturally distributed amongst different sites in some…
The planar rigidity problem asks, given a set of m pairwise distances among a set P of n unknown points, whether it is possible to reconstruct P, up to a finite set of possibilities (modulo rigid motions of the plane). The celebrated…
We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For…
A central problem in extremal graph theory is to estimate, for a given graph $H$, the number of $H$-free graphs on a given set of $n$ vertices. In the case when $H$ is not bipartite, fairly precise estimates on this number are known. In…
In this note we consider a more general version of local sparsity introduced recently by Anderson, Kuchukova, and the author. In particular, we say a graph $G = (V, E)$ is $(k, r)$-locally-sparse if for each vertex $v \in V(G)$, the…
We study the finite size corrections to the free energy density in disorder spin systems on sparse random graphs, using both replica theory and cavity method. We derive an analytical expressions for the $O(1/N)$ corrections in the replica…
In this work we show that there is a direct relationship between a graph's topology and the free energy of a spin system on the graph. We develop a method of separating topological and enthalpic contributions to the free energy, and find…
Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer $L$, an {\em $L$-bounded flow} is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the {\em maximum $L$-bounded flow…
We consider gradient models on the lattice $\mathbb{Z}^d$. These models serve as effective models for interfaces and are also known as continuous Ising models. The height of the interface is modelled by a random field with an energy which…