Related papers: Local Statistics of Realizable Vertex Models
The number of dimer-monomers (matchings) of a graph $G$ is an important graph parameter in statistical physics. Following recent research, we study the asymptotic behavior of the number of dimer-monomers $m(G)$ on the Towers of Hanoi graphs…
Based on our previous graph covering method, we introduce weighted graph covering models and flexible graph covering models that are almost equivalent to the well-known Bratteli--Vershik models. These models play important roles in showing…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
We study partition functions for the dimer model on families of finite graphs converging to infinite self-similar graphs and forming approximation sequences to certain well-known fractals. The graphs that we consider are provided by actions…
We study the monomer--dimer partition function on the configuration model of random $d$-regular, $l$-uniform hypergraphs. For fixed $d,l\ge2$, we prove quenched free-energy limits in explicit parameter regimes. The proof combines…
The hyperbolicity of a graph, informally, measures how close a graph is (metrically) to a tree. Hence, it is intuitively similar to treewidth, but the measures are formally incomparable. Motivated by the broad study of algorithms and…
In classic distributed graph problems, each instance on a graph specifies a space of feasible solutions (e.g. all proper ($\Delta+1$)-list-colorings of the graph), and the task of distributed algorithm is to construct a feasible solution…
A new approach to the local and global explanation is proposed. It is based on selecting a convex hull constructed for the finite number of points around an explained instance. The convex hull allows us to consider a dual representation of…
We study properties of Hamiltonian integrable systems with random initial data by considering their Lax representation. Specifically, we investigate the spectral behaviour of the corresponding Lax matrices when the number $N$ of degrees of…
Real ecosystems are characterized by sparse and asymmetric interactions, posing a major challenge to theoretical analysis. We introduce a new method to study the generalized Lotka-Volterra model with stochastic dynamics on sparse graphs. By…
Spatial-temporal linear model and the corresponding likelihood-based statistical inference are important tools for the analysis of spatial-temporal lattice data. In this paper, we study the asymptotic properties of maximum likelihood…
We propose a fast method to determine the local curvature in two-dimensional (2D) systems with arbitrary shape. The curvature information, combined with elastic constants obtained for a planar system, provides an accurate estimate of the…
The $k$-dimensional Weisfeiler-Leman algorithm is a powerful tool in graph isomorphism testing. For an input graph $G$, the algorithm determines a canonical coloring of $s$-tuples of vertices of $G$ for each $s$ between 1 and $k$. We say…
The 1-2 model on the hexagonal lattice is a model of statistical mechanics in which each vertex is constrained to have degree either $1$ or $2$. There are three types of edge, and three corresponding parameters $a$, $b$, $c$. It is proved…
A class of random graph models is considered, combining features of exponential-family models and latent structure models, with the goal of retaining the strengths of both of them while reducing the weaknesses of each of them. An open…
For a general statistical model, we introduce the notion of data dependent measure (DDM) on the model parameter. Typical examples of DDM are the posterior distributions. Like for posteriors, the quality of a DDM is characterized by the…
In order to study a one-dimensional analogue of the spontaneous curvature model for two-component lipid bilayer membranes we consider planar curves that are made of a material with two phases. Each phase induces a preferred curvature to the…
We consider ergodic translation-invariant Gibbs measures for the dimer model (i.e. perfect matchings) on the hexagonal lattice. The complement to a dimer configuration is a fully-packed loop configuration: each vertex has degree two. This…
We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the "cavity" prediction for…
Determining the maximal density $m_1(\mathbb{R}^2)$ of planar sets without unit distances is a fundamental problem in combinatorial geometry. This paper investigates lower bounds for this quantity. We introduce a novel approach to…