相关论文: Matrix Models on Large Graphs

Following some recent work by Gross, we consider the partition function for QCD on a two dimensional torus and study its stringiness. We present strong evidence that the free energy corresponds to a sum over branched surfaces with small…

We present exact calculations of the Potts model partition function $Z(G,q,v)$ for arbitrary $q$ and temperature-like variable $v$ on $n$-vertex square-lattice strip graphs $G$ for a variety of transverse widths $L_t$ and for arbitrarily…

We consider homogeneous factor models on uniformly sparse graph sequences converging locally to a (unimodular) random tree $T$, and study the existence of the free energy density $\phi$, the limit of the log-partition function divided by…

We show that there are two classes of finite size effects for dynamic models taking place on a scale-free topology. Some models in finite networks show a behavior that depends only on the system size N. Others present an additional distinct…

We consider a simple model to describe the widths of the mode locked intervals for the critical circle map. Using two different partitions of the rational numbers, based on Farey series and Farey tree levels respectively, we calculate the…

We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported, we show that the S-matrix for all energies in any open set in the continuous…

Answering some questions of Gutman, we show that, except for four specific trees, every connected graph G of order n, with no cycle of order 4 and with maximum degree at most 3, has energy greater that its order. Here, the energy of a graph…

In N=1 supersymmetric SO(N)/USp(2N) gauge theories with the tree-level superpotential W(\Phi) that is an arbitrary polynomial of the adjoint matter \Phi, the massless fluctuations about each quantum vacuum are described by U(1)^n gauge…

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…

Colored tensor models generalize matrix models in arbitrary dimensions yielding a statistical theory of random higher dimensional topological spaces. They admit a 1/N expansion dominated by graphs of spherical topology. The simplest tensor…

We establish the existence of free energy limits for several combinatorial models on Erd\"{o}s-R\'{e}nyi graph $\mathbb {G}(N,\lfloor cN\rfloor)$ and random $r$-regular graph $\mathbb {G}(N,r)$. For a variety of models, including…

We consider an Ising model with quenched surface disorder, the disorder average of the free energy is the main object of interest. Explicit expressions for the free energy distribution are difficult to obtain if the quenched surface spins…

Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…

All intelligence is collective intelligence, in the sense that it is made of parts which must align with respect to system-level goals. Understanding the dynamics which facilitate or limit navigation of problem spaces by aligned parts thus…

We study how to establish $\textit{spectral independence}$, a key concept in sampling, without relying on total influence bounds, by applying an $\textit{approximate inverse}$ of the influence matrix. Our method gives constant upper bounds…

We study the Potts spin glass model, which generalizes the Sherrington-Kirkpatrick model to the case when spins take more than two values but their interactions are counted only if the spins are equal. We obtain the analogue of the Parisi…

The estimation of various matrix integrals as the size of the matrices goes to infinity is motivated by theoretical physics, geometry and free probability questions. On a rigorous ground, only integrals of one matrix or of several matrices…

We prove tight upper and lower bounds on the internal energy per particle (expected number of monochromatic edges per vertex) in the anti-ferromagnetic Potts model on cubic graphs at every temperature and for all $q \ge 2$. This immediately…

We consider dimer model on a hexagonal lattice. This model can be seen as a "pile of cubes in the box". The energy of configuration is given by the volume of the pile and the partition function is computed by the classical MacMahon formula…

Let $R$ be a Hermitian matrix. The energy of $R$, $\mathcal{E}(R)$, corresponds to the sum of the absolute values of its eigenvalues. In this work it is obtained two lower bounds for $\mathcal{E}(R).$ The first one generalizes a lower bound…