Related papers: Matrix Models on Large Graphs
We study the Potts model on locally tree-like random graphs of arbitrary degree distribution. Using a population dynamics algorithm we numerically solve the problem exactly. We confirm our results with simulations. Comparisons with a…
The complexity of highly interconnected systems is rooted in the interwoven architecture defined by its connectivity structure. In this paper, we develop matrix energy of the underlying connectivity structure as a measure of topological…
We investigate relations between spatial properties of the free energy and the radius of Gaussian curvature of the underlying curved lattice geometries. For this purpose we derive recurrence relations for the analysis of the free energy…
The surface free energy is the difference between the free energies for a system with open boundary conditions and the same system with periodic boundary conditions. We use the quantum transfer matrix formalism to express the surface free…
The Potts model is one of the most popular spin models of statistical physics. The prevailing majority of work done so far corresponds to the lattice version of the model. However, many natural or man-made systems are much better described…
We model the effects of a large number of zero modes for $N_f$ species of quarks at finite vacuum angle $\theta$, using a matrix model with gaussian weights constrained by the topological susceptibility and compressibility. The quenched…
We provide a new upper bound for the energy of graphs in terms of degrees and number of leaves. We apply this formula to study the energy of Erd\"os-R\'enyi graphs and Barabasi-Albert trees.
An exactly solvable lattice model with infinite-range potential is applied to uniaxial ferroelectrics. Asymptotically exact expression for free energy as a function of an order parameter at any temperatures is obtained. Effect of thermal…
The integration of heavy scalar fields is discussed in a class of BSM models, containing more that one representation for scalars and with mixing. The interplay between integrating out heavy scalars and the Standard Model decoupling limit…
We study the energy per vertex in regular graphs. For every k, we give an upper bound for the energy per vertex of a k-regular graph, and show that a graph attains the upper bound if and only if it is the disjoint union of incidence graphs…
We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…
The two-body t-matrix is calculated directly as function of two vector momenta for different Malfliet-Tjon type potentials. At a few hundred MeV projectile energy the total amplitude is quite a smooth function showing only a strong peak in…
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…
Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…
A phenomenological approach to the ferromagnetic two dimensional Potts model on square lattice is proposed. Our goal is to present a simple functional form that obeys the known properties possessed by the free energy of the q-state Potts…
In [arXiv:2311.08980], it was shown that if the limit of the free energy in a non-convex vector spin glass model exists, it must be a critical value of a certain functional. In this work, we extend this result to multi-species spin glass…
Amplitudes in open topological string theory may be described completely by certain A-infinity-categories. We detail a general construction of all cyclic minimal models for a given A-infinity-algebra and apply this result to the case of N=2…
The extended adjacency matrix of a graph with $n$ vertices is a real symmetric matrix of order $n\times n$ whose $(i,j)$-th entry is the average of the ratio of the degree of the vertex $i$ to that of the vertex $j$ and its reciprocal when…
We consider the two-matrix model with potentials whose derivative are arbitrary rational function of fixed pole structure and the support of the spectra of the matrices are union of intervals (hard-edges). We derive an explicit formula for…
We present a statistical mechanics approach for the description of complex networks. We first define an energy and an entropy associated to a degree distribution which have a geometrical interpretation. Next we evaluate the distribution…