Related papers: Limit shapes for Domain-Wall (colored) vertex mode…
The six-vertex model is an important toy-model in statistical mechanics for two-dimensional ice with a natural parameter $\Delta$. When $\Delta = 0$, the so-called free-fermion point, the model is in natural correspondence with domino…
We introduce and explore a family of vertex-coloring problems which, surprisingly enough, have not been considered before despite stemming from the problem of Wi-Fi channel assignment. Given a spectrum of colors, endowed with a matrix of…
We present several new results on the feasibility of inferring the hidden states in strongly-connected trackable weak models. Here, a weak model is a directed graph in which each node is assigned a set of colors which may be emitted when…
We analyze the propagation of two-dimensional dispersive and relativistic wavepackets localized in the vicinity of the zero level set $\Gamma$ of a domain wall. The main applications we consider are a topologically non-trivial Dirac model…
NAC-colourings of graphs correspond to flexible quasi-injective realisations in $\mathbb {R} ^2$. A special class of NAC-colourings are those that arise from stable cuts. We give sharp thresholds for the random graph to have no stable cut…
In this paper, we derive sharp bounds on the semigroup of the linearized incompressible Navier-Stokes equations near a stationary shear layer in the half plane and in the half space ($\mathbb{R}_+^2$ or $\mathbb{R}_+^3$), with Dirichlet…
We numerically investigate critically delocalized wavefunctions in models of 2D Dirac fermions, subject to vector potential disorder. These describe the surface states of 3D topological superconductors, and can also be realized through…
A {\bf $\mathbf{k}$-majority coloring} of a digraph $D=(V,A)$ is a coloring of $V$ with $k$ colors so that each vertex $v\in V$ has at least as many out-neighbours of color different from its own color as it has out-neighbours with the same…
A mixed graph contains (undirected) edges as well as (directed) arcs, thus generalizing undirected and directed graphs. A proper coloring $c$ of a mixed graph $G$ assigns a positive integer to each vertex such that $c(u)\neq c(v)$ for every…
We consider dimer models on growing Aztec diamonds, which are certain domains in the square lattice, with edge weights of the form $\nu(\,\cdot\,)^\beta$, where $\nu(\,\cdot\,)$ is a doubly periodic function on the edges of the lattice and…
We study the pinning transition in a (1+1)-dimensional lattice model of a fluctuating interface interacting with a corrugated impenetrable wall. The interface is modeled as an $N$-step directed one-dimensional random walk on the half-line…
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most $b$ and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for…
In this paper we study the Navier-Stokes equations with a Navier-type boundary condition that has been proposed as an alternative to common near wall models. The boundary condition we study, involving a linear relation between the…
This paper introduces a new variant of domination-related coloring of graphs, which is a combination of their dominator coloring and equitable coloring called the equitable dominator coloring. An equitable coloring is a proper coloring in…
An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…
We study quark confinement in a system of two parallel domain walls interpolating different color dielectric media. We use the phenomenological approach in which the confinement of quarks appears considering the QCD vacuum as a color…
Groves are spanning forests of a finite region of the triangular lattice that are in bijection with Laurent monomials that arise in solutions of the cube recurrence. We introduce a large class of probability measures on groves for which we…
Conditional independence models associated with directed acyclic graphs (DAGs) may be characterized in at least three different ways: via a factorization, the global Markov property (given by the d-separation criterion), and the local…
A vertex colouring of a given graph $G$ can be considered as a random experiment. A discrete random variable $X$, corresponding to this random experiment, can be defined as the colour of a randomly chosen vertex of $G$ and a probability…
Recently B. Derrida [Phys. Rev. E 55, 3705 (1997)] introduced a numerical technique that allows one to measure the fraction of persistent spins in a coarsening nonequilibrium system at finite temperature. In the present work we extend this…