Related papers: The condensation phase transition in random graph …
We introduce the notion of a network's conduciveness, a probabilistically interpretable measure of how the network's structure allows it to be conducive to roaming agents, in certain conditions, from one portion of the network to another.…
DP-coloring (also called correspondence coloring) of graphs is a generalization of list coloring that has been widely studied since its introduction by Dvo\v{r}\'{a}k and Postle in $2015$. Intuitively, DP-coloring generalizes list coloring…
Graph coloring is fundamental to distributed computing. We give the first general treatment of the coloring of virtual graphs, where the graph $H$ to be colored is locally embedded within the communication graph $G$. Besides generalizing…
A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the…
We show that the combinatorial matter of graph coloring is, in fact, quantum in the sense of satisfying the sum over all the possible intermediate state properties of a path integral. In our case, the topological field theory (TFT) with…
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…
For a given number of colors, $s$, the guessing number of a graph is the (base $s$) logarithm of the cardinality of the largest family of colorings of the vertex set of the graph such that the color of each vertex can be determined from the…
We consider turbulence in the Gross-Pitaevsky model and study the creation of a coherent condensate via an inverse cascade originated at small scales. The growth of the condensate leads to a spontaneous breakdown of symmetries of…
We study the strong spatial mixing (decay of correlation) property of proper $q$-colorings of random graph $G(n, d/n)$ with a fixed $d$. The strong spatial mixing of coloring and related models have been extensively studied on graphs with…
We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…
We study the edge deletion process of random graphs near a k-core percolation point. We find that the time-dependent number of edges in the process exhibits critically divergent fluctuations. We first show theoretically that the k-core…
A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a…
Condensation occurs in nonequilibrium steady states when a finite fraction of particles in the system occupies a single lattice site. We study condensation transitions in a one-dimensional zero-range process with a single defect site. The…
Constrained quantum annealing (CQA) is a quantum annealing approach that is designed so that constraints are satisfied without penalty terms. There is an analogy between the model for the CQA of graph coloring and a set of disordered spin…
The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups…
Condensation of fluctuations is an interesting phenomenon conceptually distinct from condensation on average. One stricking feature is that, contrary to what happens on average, condensation of fluctuations may occurr even in the absence of…
The conception of the conformal phase transiton (CPT), which is relevant for the description of non-perturbative dynamics in gauge theories, is introduced and elaborated. The main features of such a phase transition are established. In…
Here I will present an introduction to the results that have been recently obtained in constraint optimization of random problems using statistical mechanics techniques. After presenting the general results, in order to simplify the…
In the \textsc{Coloring Reconfiguration} problem, we are given two proper $k$-colorings of a graph and asked to decide whether one can be transformed into the other by repeatedly applying a specified recoloring rule, while maintaining a…
Let $G(n,m)$ be the random graph on $n$ vertices with $m$ edges. Let $d=2m/n$ be its average degree. We prove that $G(n,m)$ fails to be $k$-colorable with high probability if $d>2k\ln k-\ln k-1+o_k(1)$. This matches a conjecture put forward…