Related papers: Local Statistics of Realizable Vertex Models
The dimer model is an exactly solvable model of planar statistical mechanics. In its critical phase, various aspects of its scaling limit are known to be described by the Gaussian free field. For periodic graphs, criticality is an algebraic…
We present results of the Monte-Carlo simulations for scaling of the free energy in dimers on the hexagonal lattice. The traditional Markov-chain Metropolis algorithm and more novel non-Markov Wang-Landau algorithm are applied. We compare…
Graphs are a powerful way to model interactions and relationships in data from a wide variety of application domains. In this setting, entities represented by vertices at the "center" of the graph are often more important than those…
We study a model of colored multiwebs, which generalizes the dimer model to allow each vertex to be adjacent to \(n_v\) edges. These objects can be formulated as a random tiling of a graph with partial dimer covers. We examine the case of a…
Fully developed turbulence is analised with the lattice model employing vortex tube representation which is introduced recently by the authors. Several characteric features observed in experiments and direct numeric integrations are…
We study the local geometry of empirical risks in high dimensions via the spectral theory of their Hessian and information matrices. We focus on settings where the data, $(Y_\ell)_{\ell =1}^n \in \mathbb{R}^d$, are i.i.d. draws of a…
We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with $n$ vertices and of bounded degree. We show that the relaxation time (defined as…
We study a large class of critical two-dimensional Ising models, namely critical Z-invariant Ising models. Fisher [Fis66] introduced a correspondence between the Ising model and the dimer model on a decorated graph, thus setting dimer…
We consider the five-vertex model on a rectangular domain of the square lattice, with the so-called `scalar-product' boundary conditions. We address the evaluation of the free-energy density of the model in the scaling limit, that is when…
We propose a geometric counterpart of the dimer model on bipartite graphs. A state of our model consists of a choice of a point for each white vertex and hyperplane for each black vertex. This data is subject to certain conditions…
The polymer model framework is a classical tool from statistical mechanics that has recently been used to obtain approximation algorithms for spin systems on classes of bounded-degree graphs; examples include the ferromagnetic Potts model…
The classic technique of Baker [J. ACM '94] is the most fundamental approach for designing approximation schemes on planar, or more generally topologically-constrained graphs, and it has been applied in a myriad of different variants and…
In this paper authors consider representations of graphs in Hilbert spaces applying a restriction of local scalarity on them. It enables to obtain a theory, similar to the classical theory of representations of graphs in vector spaces. In…
Exponential random graph models have become increasingly important in the study of modern networks ranging from social networks, economic networks, to biological networks. They seek to capture a wide variety of common network tendencies…
In this paper, we introduce a family of observables for the dimer model on a bi-periodic bipartite planar graph, called pattern density fields. We study the scaling limit of these objects for liquid and gaseous Gibbs measures of the dimer…
We study dynamic planar graphs with $n$ vertices, subject to edge deletion, edge contraction, edge insertion across a face, and the splitting of a vertex in specified corners. We dynamically maintain a combinatorial embedding of such a…
We address the issue of the proximity of interacting diffusion models on large graphs with a uniform degree property and a corresponding mean field model, i.e. a model on the complete graph with a suitably renormalized interaction…
The local streamline topology classification method of Chong et al. (1990) is adapted and extended to describe the geometry of infinitesimal vortex lines. Direct numerical simulation (DNS) data of forced isotropic turbulence reveals that…
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum dominating set problem and the maximum matching problem in…
Temporal graphs are graphs whose topology is subject to discrete changes over time. Given a static underlying graph $G$, a temporal graph is represented by assigning a set of integer time-labels to every edge $e$ of $G$, indicating the…