Related papers: The condensation phase transition in random graph …
We study a new variant of graph coloring by adding a connectivity constraint. A path in a vertex-colored graph is called conflict-free if there is a color that appears exactly once on its vertices. A connected graph $G$ is said to be…
The energy level statistics of uniform random graphs are studied, by treating the graphs as random tight-binding lattices. The inherent random geometry of the graphs and their dynamical spatial dimensionality, leads to various quantum…
Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matching. So far coloring problems are mostly studied on static…
Let $G=G(d)$ be a random graph with a given degree sequence $d$, such as a random $r$-regular graph where $r\ge 3$ is fixed and $n=|G|\to\infty$. We study the percolation phase transition on such graphs $G$, i.e., the emergence as $p$…
Recent studies have indicated that the coarse grained dynamics of a large class of traffic models and driven-diffusive systems may be described by urn models. We consider a class of one-dimensional urn models whereby particles hop from an…
Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number $k$, we seek a vertex ordering such every vertex can (weakly respectively strongly) reach in $k$ steps only few vertices with…
Graph Coloring consists in assigning colors to vertices ensuring that two adjacent vertices do not have the same color. In dynamic graphs, this notion is not well defined, as we need to decide if different colors for adjacent vertices must…
The best current estimates of the thresholds for the existence of solutions in random constraint satisfaction problems ('CSPs') mostly derive from the first and the second moment method. Yet apart from a very few exceptional cases these…
I review recent developments in determining the QCD phase diagram by means of lattice simulations. Since the invention of methods to side-step the sign problem a few years ago, a number of additional variants have been proposed, and…
Many combinatorial problems can be formulated as "Can I transform configuration 1 into configuration 2, if certain transformations only are allowed?". An example of such a question is: given two k-colourings of a graph, can I transform the…
In recent years, quantum phase transitions have attracted the interest of both theorists and experimentalists in condensed matter physics. These transitions, which are accessed at zero temperature by variation of a non-thermal control…
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…
In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
In this conference proceeding, I discuss in detail the deconfinement to quark matter that takes place at large densities and/or temperatures. The first-order phase transition that is assumed to appear beyond a critical point gives rise to…
We propose quasi-stable coloring, an approximate version of stable coloring. Stable coloring, also called color refinement, is a well-studied technique in graph theory for classifying vertices, which can be used to build compact, lossless…
We study several basic problems about colouring the $p$-random subgraph $G_p$ of an arbitrary graph $G$, focusing primarily on the chromatic number and colouring number of $G_p$. In particular, we show that there exist infinitely many…
A local order parameter which is important in the analysis of phase transitions in frustrated combinatorial problems is the probability that a node is frozen in a particular state. There is a percolative transition when an infinite…
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…