Related papers: Local Statistics of the $M_n$-Dimer Model
We study the dynamics of a bimeromorphic selfmap of a compact complex K\"ahler surface $X$. Under a natural geometric hypothesis, we construct an invariant probability measure, which is mixing, hyperbolic and of maximal entropy. The proof…
Conditions are presented for different types of identifiability of discrete variable models generated over an undirected graph in which one node represents a binary hidden variable. These models can be seen as extensions of the latent class…
Let m be a positive integer and let G be a cubic graph of order 2n. We consider the problem of covering the edge-set of G with the minimum number of matchings of size m. This number is called excessive [m]-index of G in literature. The case…
We study the normal matrix model, also known as the two-dimensional one-component plasma at a specific temperature, with merging singularity. As the number $n$ of particles tends to infinity we obtain the limiting local correlation kernel…
We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$. The dynamics of this…
In this article for a finite typed random geometric graph we define the empirical locality distribution, which records the number of nodes of a given type linked to a given number of nodes of each type. We find large deviation principle…
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…
Most of real-world graphs are dynamic, i.e., they change over time by a sequence of update operations. While the regression problem has been studied for static graphs and temporal graphs, it is not investigated for general dynamic graphs.…
Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
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…
We study the classical dimer model on rhombic Penrose tilings, whose edges and vertices may be identified with those of a bipartite graph. We find that Penrose tilings do not admit perfect matchings (defect-free dimer coverings). Instead,…
Community detection in networks refers to the process of seeking strongly internally connected groups of nodes which are weakly externally connected. In this work, we introduce and study a community definition based on internal edge…
Given a set $A$ of $n$ points (vertices) in general position in the plane, the \emph{complete geometric graph} $K_n[A]$ consists of all $\binom{n}{2}$ segments (edges) between the elements of $A$. It is known that the edge set of every…
In this paper we review the asymptotic matching conjectures for $r$-regular bipartite graphs, and their connections in estimating the monomer-dimer entropies in $d$-dimensional integer lattice and Bethe lattices. We prove new rigorous upper…
This paper completes the comprehensive study of the dimer model on infinite minimal graphs with Fock's weights [arXiv:1503.00289] initiated in [arXiv:2007.14699]: the latter article dealt with the elliptic case, i.e., models whose…
Numerous networks in the real world change over time, in the sense that nodes and edges enter and leave the networks. Various dynamic random graph models have been proposed to explain the macroscopic properties of these systems and to…
Basing on our recent results on the $1/n$-expansion in unitary invariant random matrix ensembles, known as matrix models, we prove that the local eigenvalue statistic, arising in a certain neighborhood of the edges of the support of the…
We investigate a class of random graph ensembles based on the Feynman graphs of multidimensional integrals, representing statistical-mechanical partition functions. We show that the resulting ensembles of random graphs strongly resemble…
Consider the random process in which the edges of a graph $G$ are added one by one in a random order. A classical result states that if $G$ is the complete graph $K_{2n}$ or the complete bipartite graph $K_{n,n}$, then typically a perfect…