Related papers: The condensation phase transition in random graph …
Random constraint satisfaction problems play an important role in computer science and combinatorics. For example, they provide challenging benchmark instances for algorithms and they have been harnessed in probabilistic constructions of…
The phase diagram of strongly interacting matter is explored as a function of temperature and baryon number density. We investigate the possible simultaneous formation of condensates in the conventional quark--anti-quark channel (breaking…
We introduce a new notion of resilience for constraint satisfaction problems, with the goal of more precisely determining the boundary between NP-hardness and the existence of efficient algorithms for resilient instances. In particular, we…
In this paper, we show how one may (efficiently) construct two types of extremal combinatorial objects whose existence was previously conjectural. (*) Panchromatic Graphs: For fixed integer k, a k-panchromatic graph is, roughly speaking, a…
An odd $k$-edge-coloring of a graph $G$ is a (not necessarily proper) edge-coloring with at most $k$ colors such that each non-empty color class induces a graph in which every vertex is of odd degree; similarly, if more than one color per…
This paper investigates the semi-streaming complexity of \textit{$k$-partial coloring}, a generalization of proper graph coloring. For $k \geq 1$, a $k$-partial coloring requires that each vertex $v$ in an $n$-node graph is assigned a color…
The problem of vertex coloring in random graphs is studied using methods of statistical physics and probability. Our analytical results are compared to those obtained by exact enumeration and Monte-Carlo simulations. We critically discuss…
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the…
For a positive integer $k$, a $k$-colouring of a graph $G=(V,E)$ is a mapping $c: V\rightarrow\{1,2,...,k\}$ such that $c(u)\neq c(v)$ whenever $uv\in E$. The Colouring problem is to decide, for a given $G$ and $k$, whether a $k$-colouring…
We consider a natural variant of the Erd\H{o}s-R\'enyi random graph process in which $k$ vertices are special and are never put into the same connected component. The model is natural and interesting on its own, but is actually inspired by…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any…
We consider the problem of $q$-colouring a $k$-uniform random hypergraph, where $q,k \geq 3$, and determine the rigidity threshold. For edge densities above the rigidity threshold, we show that almost all solutions have a linear number of…
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…
Random $k$-SAT is the single most intensely studied example of a random constraint satisfaction problem. But despite substantial progress over the past decade, the threshold for the existence of satisfying assignments is not known precisely…
Bose condensed light can form new phases [1] in a dye filled cavity due to the presence of the orientational disorder created by dye molecules which are essentially frozen on the time scale of the photonic thermalization (few ps). At longer…
We study condensation transitions in the steady state of a zero-range process with two species of particles. The steady state is exactly soluble -- it is given by a factorised form provided the dynamics satisfy certain constraints -- and we…
We review recent progress on the statiscal physics study of the problem of coloring random graphs with q colors. We discuss the existence of a threeshold at connectivity c_q=2q log q-log q-1+o(1) separting two phases which are respectivily…
Since the early 2000s physicists have developed an ingenious but non-rigorous formalism called the cavity method to put forward precise conjectures on phase transitions in random problems [Mezard, Parisi, Zecchina: Science 2002]. The cavity…
We predict a condensation phenomenon in an overall neutral system, consisting of a single charged plate and its oppositely charged counterions. Based on the ``two-fluid'' model, in which the counterions are divided into a ``free'' and a…