Related papers: Limit shapes for Domain-Wall (colored) vertex mode…
Colored graphical models provide a parsimonious approach to modeling high-dimensional data by exploiting symmetries in the model parameters. In this work, we introduce the notion of coloring for extremal graphical models on multivariate…
Domain warping is a technique commonly used in creative coding to distort graphics and add visual interest to a work. The approach has the potential to be used in 3D art as mesh vertices can be efficiently warped using a vertex shader in a…
We suggest a diagrammatic model of computation based on an axiom of distributivity. A diagram of a decorated coloured tangle, similar to those that appear in low dimensional topology, plays the role of a circuit diagram. Equivalent diagrams…
Colouring the vertices of a graph $G$ according to certain conditions can be considered as a random experiment and a discrete random variable $X$ can be defined as the number of vertices having a particular colour in the proper colouring of…
An $n$-vertex graph is equitably $k$-colorable if there is a proper coloring of its vertices such that each color is used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil n/k \right\rceil$ times. While classic Vertex Coloring is…
Coloured graphical models are Gaussian statistical models determined by an undirected coloured graph. These models can be described by linear spaces of symmetric matrices. We outline a relationship between the symmetries of the graph and…
In this paper, we consider a weighted generalization of the chromatic number of a Binomial random graph~\(G.\) We equip each edge with a random weight and then colour the vertices in such a way that the absolute colour difference between…
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…
We investigate domain walls between topologically ordered phases in two spatial dimensions and present a simple but general framework from which their degrees of freedom can be understood. The approach we present exploits the results on…
In this paper we investigate the colorful components framework, motivated by applications emerging from comparative genomics. The general goal is to remove a collection of edges from an undirected vertex-colored graph $G$ such that in the…
We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles. We give the first classification of the problem in terms of…
A {\em restraint} on a (finite undirected) graph $G = (V,E)$ is a function $r$ on $V$ such that $r(v)$ is a finite subset of ${\mathbb N}$; a proper vertex colouring $c$ of $G$ is {\em permitted} by $r$ if $c(v) \not\in r(v)$ for all…
We study a chaotic particle-conserving kinetically constrained model, with a single parameter which allows us to break reflection symmetry. Through extensive numerical simulations we find that the domain wall state shows a variety of…
A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition of vertices is called equitable. We note that a number of…
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points. The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the…
We address the scaling limits of random curves arising from, e.g., planar lattice models, especially in rough domains. The well-known precompactness conditions of Kemppainen and Smirnov show that certain crossing probability estimates…
Based on a technique of Barvinok and Barvinok and Sober\'on we identify a class of edge-coloring models whose partition functions do not evaluate to zero on bounded degree graphs. Subsequently we give a quasi-polynomial time approximation…
The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of…
The modulation is analyzed from the analytical properties of zeros of free fermionic partition function on the complex plane of wave numbers. It is shown how these properties are related to the oscillations of correlation functions. This…
The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that $k$-colorability of a graph $G$ is equivalent to the condition $1 \in…