相关论文: Asymptotic Behavior of Partition Functions with Gr…

We compute the partition function of the $q$-states Potts model on a random planar lattice with $p\leq q$ allowed, equally weighted colours on a connected boundary. To this end, we employ its matrix model representation in the planar limit,…

In this article we study the notion of capacity of a vertex for infinite graphs over non-Archimedean fields. In contrast to graphs over the real field monotone limits do not need to exist. Thus, in our situation next to positive and null…

We study the high-dimensional limit of the free energy associated with the inference problem of a rank-one nonsymmetric matrix. The matrix is expressed as the outer product of two vectors, not necessarily independent. The distributions of…

We consider Laplace operators on periodic discrete graphs perturbed by guides, i.e., graphs which are periodic in some directions and finite in other ones. The spectrum of the Laplacian on the unperturbed graph is a union of a finite number…

We study a new class of matrix models, formulated on a lattice. On each site are $N$ states with random energies governed by a Gaussian random matrix Hamiltonian. The states on different sites are coupled randomly. We calculate the density…

This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…

Borrowing ideas from the relation between simply laced Lie algebras and Dynkin diagrams, a weighted graph theory representation of quantum information is addressed. In this way, the density matrix of a quantum state can be interpreted as a…

This paper develops a method to carry out the large-$N$ asymptotic analysis of a class of $N$-dimensional integrals arising in the context of the so-called quantum separation of variables method. We push further ideas developed in the…

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

Graphity models are characterized by configuration spaces in which states correspond to graphs and Hamiltonians that depend on local properties of graphs such as the degrees of vertices and numbers of short cycles. As statistical systems,…

We study properties of spectral minimal partitions of metric graphs within the framework recently introduced in [Kennedy et al, Calc. Var. 60 (2021), 61]. We provide sharp lower and upper estimates for minimal partition energies in…

In this article, various aspects of Laplacian spectra of power graphs of finite cyclic, dicyclic and finite $p$-groups are studied. Algebraic connectivity of power graphs of the above groups are considered and determined completely for that…

Let $G$ be a simple graph with the Laplacian matrix $L(G)$ and let $e(G)$ be the number of edges of $G$. A conjecture by Brouwer and a conjecture by Grone and Merris state that the sum of the $k$ largest Laplacian eigenvalues of $G$ is at…

The monopole-dimer model is a signed variant of the monomer-dimer model which has determinantal structure. We extend the monopole-dimer model for planar graphs (Math. Phys. Anal. Geom., 2015) to Cartesian products thereof and show that the…

We determine the asymptotic behaviour of the number of the Eulerian circuits in undirected simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). We also prove some new properties of the…

For a simple connected graph $ G $ of order $ n $, the normalized Laplacian is a square matrix of order $ n $, defined as $\mathcal{L}(G)= D(G)^{-\frac{1}{2}}L(G)D(G)^{-\frac{1}{2}}$, where $ D(G)^{-\frac{1}{2}} $ is the diagonal matrix…

We consider a Random Graph Model on $\mathbb{Z}^{d}$ that incorporates the interplay between the statistics of the graph and the underlying space where the vertices are located. Based on a graphical construction of the model as the…

Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…

We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…

Let $(X,g)$ be a closed, connected surface, with variable negative curvature. We consider the distribution of eigenvalues of the Laplacian on random covers $X_n\to X$ of degree $n$. We focus on the ensemble variance of the smoothed number…