Related papers: Color representations of Ising models

An edge-coloring of a graph $G$ with colors $1,...,t$ is called an interval $t$-coloring if all colors are used, and the colors of edges incident to any vertex of $G$ are distinct and form an interval of integers. In 1991 Erd\H{o}s…

The classical theorem of Vizing states that every graph of maximum degree $d$ admits an edge-coloring with at most $d+1$ colors. Furthermore, as it was earlier shown by K\H{o}nig, $d$ colors suffice if the graph is bipartite. We investigate…

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…

In this paper, based on the contributions of Tucker (1983) and Seb{\H{o}} (1992), we generalize the concept of a sequential coloring of a graph to a framework in which the algorithm may use a coloring rule-base obtained from suitable…

We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…

We introduce a one dimensional disordered Ising model which at zero temperature is characterized by a non-trivial, non-self-averaging, overlap probability distribution when the impurity concentration vanishes in the thermodynamic limit. The…

We prove a full measurable version of Vizing's theorem for bounded degree Borel graphs, that is, we show that every Borel graph $\mathcal{G}$ of degree uniformly bounded by $\Delta\in \mathbb{N}$ defined on a standard probability space…

Let $k \ge 1$ be an integer and let $G$ be a nonempty simple graph. An \emph{edge-$k$-coloring} $\varphi$ of $G$ is an assignment of colors from $\{1,\ldots,k\}$ to the edges of $G$ such that no two adjacent edges receive the same color.…

We construct discrete holomorphic observables in the Ising model at criticality and show that they have conformally covariant scaling limits (as mesh of the lattice tends to zero). In the sequel those observables are used to construct…

Consider a graph G with n nodes and m edges, which represents a social network, and assume that initially each node is blue or white. In each round, all nodes simultaneously update their color to the most frequent color in their…

A \emph{mixed interval graph} is an interval graph that has, for every pair of intersecting intervals, either an arc (directed arbitrarily) or an (undirected) edge. We are particularly interested in scenarios where edges and arcs are…

The problem of chromatic thresholds seeks for minimum degree conditions that ensure $H$-free graphs to have a bounded chromatic number, or equivalently a bounded size homomorphic image. The strengthened homomorphism thresholds problem…

Veit Elser proposed a random graph model for percolation in which physical dimension appears as a parameter. Studying this model combinatorially leads naturally to the consideration of numerical graph invariants which we call \emph{Elser…

We study graphical representations for two related models. The first model is the transverse field quantum Ising model, an extension of the original Ising model which was introduced by Lieb, Schultz and Mattis in the 1960's. The second…

We present and rigorously analyze the behavior of a distributed, stochastic algorithm for separation and integration in self-organizing particle systems, an abstraction of programmable matter. Such systems are composed of individual…

We first consider the following problem. We are given a fixed perfect matching $M$ of $[n]$ and we add random edges one at a time until there is a Hamilton cycle containing $M$. We show that w.h.p. the hitting time for this event is the…

The usual interaction energy of the random field Ising model in statistical physics is modified by complementing the random field by added to the energy of the usual Ising model a nonlinear term S^n were S is the sum of the neighbor spins,…

We initiate the study of total-coloring extensions, and focus our attention on planar graphs, asking: ``When can a total-$k$-coloring of some subgraph $H$ of a planar graph $G$ be extended to a total-$k$-coloring of $G$?'' We prove that if…

We consider Ising model on edge-dual of uncorrelated random networks with arbitrary degree distribution. These networks have a finite clustering in the thermodynamic limit. High and low temperature expansions of Ising model on the edge-dual…

We consider proper colorings of planar graphs embedded in the annulus, such that vertices on one rim can take Q_s colors, while all remaining vertices can take Q colors. The corresponding chromatic polynomial is related to the partition…