相关论文: Matrix Models on Large Graphs

A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…

We present a study of M(atrix) theory from a purely canonical viewpoint. In particular, we identify free particle asymptotic states of the model corresponding to the supergraviton multiplet of eleven dimensional supergravity. These states…

We derive the phase diagram of the one-dimensional three-state Potts model with an additional mean-field interaction in the canonical ensemble. The free energy is obtained by mapping the model onto the spin-$1$ Blume-Emery-Griffiths model…

In this work we use matrix models to study the problem of strength distributions. This is motivated by noticing near exponential fall offs of strengths in calculated magnetic dipole excitations. We emphasize that the quality of the…

The Hubbard model describes a lattice system of quantum particles with local (on-site) interactions. Its free energy is analytic when \beta t is small, or \beta t^2/U is small; here, \beta is the inverse temperature, U the on-site repulsion…

With the aim of clarifying the eleven dimensional content of Matrix theory, we examine the dependence of a theory in the infinite momentum frame (IMF) on the (purely spatial) longitudinal compactification radius R. It is shown that in a…

We consider a model of fermions interacting via point interactions, defined via a certain weighted Dirichlet form. While for two particles the interaction corresponds to infinite scattering length, the presence of further particles…

We study the critical Ising model on the square lattice in bounded simply connected domains with + and free boundary conditions. We relate the energy density of the model to a fermionic observable and compute its scaling limit by discrete…

We determine explicit variational expressions for the free energy of mean-field spin glasses in a transversal magnetic field, whose glass interaction is given by a hierarchical Gaussian potential as in Derrida's Generalized Random Energy…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

We consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any…

The eccentricity matrix of a simple connected graph is derived from its distance matrix by preserving the largest non-zero distance in each row and column, while the other entries are set to zero. This article examines the…

Energy-minimizing constraint maps are a natural extension of the obstacle problem within a vectorial framework. Due to inherent topological constraints, these maps manifest a diverse structure that includes singularities similar to harmonic…

The partition function of the six-vertex model on a square lattice with domain wall boundary conditions (DWBC) is rewritten as a hermitean one-matrix model or a discretized version of it (similar to sums over Young diagrams), depending on…

We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree…

We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…

We show that large deviation properties of Erd\"os-R\'enyi random graphs can be derived from the free energy of the $q$-state Potts model of statistical mechanics. More precisely the Legendre transform of the Potts free energy with respect…

We give a bound for the graph energy with given maximal degree in terms of the second and fourth moments of a graph. In the case in which the graph is $d$-regular we obtain the bound that is given in Van Dam, E. et al. (2014). through…

We develop a generalized TAP approach for the multi-species version of the spherical mixed $p$-spin models. In particular, we prove a generalized TAP representation for the free energy at any overlap vector which is multi-samplable in an…

We consider gradient models on the lattice $\mathbb{Z}^d$. These models serve as effective models for interfaces and are also known as continuous Ising models. The height of the interface is modelled by a random field with an energy which…