Related papers: The condensation phase transition in random graph …
Given a finite directed graph, a coloring of its edges turns the graph into a finite-state automaton. A k-synchronizing word of a deterministic automaton is a word in the alphabet of colors at its edges that maps the state set of the…
We analyse the motion of a system of particles subjected a random force fluctuating in both space and time, and experiencing viscous damping. When the damping exceeds a certain threshold, the system undergoes a phase transition: the…
We address the problem of sampling colorings of a graph $G$ by Markov chain simulation. For most of the article we restrict attention to proper $q$-colorings of a path on $n$ vertices (in statistical physics terms, the one-dimensional…
We revisit the problem of condensation for independent, identically distributed random variables with a power-law tail, conditioned by the value of their sum. For large values of the sum, and for a large number of summands, a condensation…
We study the $k$-core of a random (multi)graph on $n$ vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50--62] we used properties of empirical distributions of independent random variables…
Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. Non-rigorous statistical mechanics ideas have inspired a message passing algorithm called Belief Propagation Guided Decimation for finding satisfying…
Given a graph $G$ and color set $\{1, \ldots, k\}$, a $\textit{proper coloring}$ is an assignment of a color to each vertex of $G$ such that no two vertices connected by an edge are given the same color. The problem of drawing a proper…
The grand canonical thermodynamics of a bosonic system is studied in order to identify the footprint of its own high-density quantum phase transition. The phases displayed by the system at zero temperature establish recognizable patterns at…
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a…
We review a class of dynamical models in which top condensation occurs at the weak scale, giving rise to the large top quark mass and other phenomena. This typically requires a color embedding, $SU(3)_c \rightarrow SU(3)_1\times SU(3)_2$.…
The turbulent flow of a fluid carrying trace amounts of a condensable species through a differentially cooled vertical channel geometry is simulated using single-phase direct numerical simulations. The release of latent heat during…
We initiate the study of a new parameterization of graph problems. In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real line, with an edge between two vertices if and only if an…
We survey results concerning reconfigurations of colourings and dominating sets in graphs. The vertices of the $k$-colouring graph $\mathcal{C}_{k}(G)$ of a graph $G$ correspond to the proper $k$-colourings of a graph $G$, with two…
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction of edges are properly colored (i.e. their endpoints receive…
We study how the complexity of the graph colouring problems star colouring and restricted star colouring vary with the maximum degree of the graph. Restricted star colouring (in short, rs colouring) is a variant of star colouring. For $k\in…
In this note we study the phase transition for percolation on quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention probabilities. A quasi-transitive graph is an infinite graph with finitely many different "types" of…
Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…
A conserved generalized zero range process is considered in which two sites interact such that particles hop from the more populated site to the other with a probability $p$. The steady state particle distribution function $P(n)$ is…
We study the problem of counting $k$-hypergraphlets, an interesting but surprisingly ignored primitive, with the aim of understanding whether efficient algorithms exist. To this end, we consider color coding, a well-known technique for…
Set-coloring a graph means giving each vertex a subset of a fixed color set so that no two adjacent subsets have the same cardinality. When the graph is complete one gets a new distribution problem with an interesting generating function.…