Related papers: Asymptotics of the partial $n$-fold dimer model

This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…

An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges incident with each vertex v are colored by d_{G}(v) consecutive…

We consider the dimer problem on a non-bipartite graph $G$, where there are two types of dimers one of which we regard impurities. Results of simulations using Markov chain seem to indicate that impurities are tend to distribute on the…

We investigate Fair and Tolerant (FAT) graph colorings, a coloring framework in which each vertex is allowed to share its color with a prescribed fraction of its neighbors, while the remaining neighbors are required to be distributed evenly…

We formulate and prove a variational principle (in the sense of thermodynamics) for random domino tilings, or equivalently for the dimer model on a square grid. This principle states that a typical tiling of an arbitrary finite region can…

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…

Erd\H{o}s, Gy\'arf\'as and Pyber showed that every $r$-edge-coloured complete graph $K_n$ can be covered by $25 r^2 \log r$ vertex-disjoint monochromatic cycles (independent of $n$). Here, we extend their result to the setting of binomial…

Graphical model selection is a seemingly impossible task when many pairs of variables are never jointly observed; this requires inference of conditional dependencies with no observations of corresponding marginal dependencies. This…

The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum…

In multivariate statistics, acyclic mixed graphs with directed and bidirected edges are widely used for compact representation of dependence structures that can arise in the presence of hidden (i.e., latent or unobserved) variables. Indeed,…

We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…

We propose a new model that describes the dynamics of epidemic spreading on connected graphs. Our model consists in a PDE-ODE system where at each vertex of the graph we have a standard SIR model and connexions between vertices are given by…

We study planar "vertex" models, which are probability measures on edge subsets of a planar graph, satisfying certain constraints at each vertex, examples including dimer model, and 1-2 model, which we will define. We express the local…

We derived here in a systematic way, and for a large class of scaling regimes, asymptotic models for the propagation of internal waves at the interface between two layers of immiscible fluids of different densities, under the rigid lid…

We propose a simple geometric recipe for constructing phase diagrams for a general class of vertex models obeying the ice rule. The disordered phase maps onto the intersecting loop model which is interesting in its own right and is related…

In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…

This Letter introduces a generalization of known duplication-divergence models for growing random graphs. This general duplication-divergence model includes a new coupled divergence asymmetry rate, which allows to obtain the structure of…

In this paper, we introduce tiled graphs as models of learning and maturing processes. We show how tiled graphs can combine graphs of learning spaces or antimatroids (partial hypercubes) and maturity models (total orders) to yield models of…

We consider the problem of online graph multi-coloring with advice. Multi-coloring is often used to model frequency allocation in cellular networks. We give several nearly tight upper and lower bounds for the most standard topologies of…

We discuss a general parametrization for vertices of quantum graphs and show, in particular, how the $\delta'_s$ and $\delta'$ coupling at an $n$ edge vertex can be approximated by means of $n+1$ couplings of the $\delta$ type provided the…