Asymptotic Behavior of Partition Functions with Graph Laplacian
| dc.creator | Khorunzhiy, Oleksiy | |
| dc.date | 2006-07-23 | |
| dc.date | 2006-11-23 | |
| dc.date.accessioned | 2026-07-07T07:20:34Z | |
| dc.date.available | 2026-07-07T07:20:34Z | |
| dc.description | We introduce the matrix sums that represent a discrete analog of the matrix models with quartic potential. The probability space is given by the set of all simple n-vertex graphs with the Gibbs weight determined by the graph Laplacian. We study the large-n limit of the free energy per site and show that it is determined by the number of connected acyclic diagrams on the set of two-valent vertices. | |
| dc.description | 18 pages, 3 figures; misprints corrected, minor improvements of the text, one reference added | |
| dc.identifier | https://arxiv.org/abs/math-ph/0607050 | |
| dc.identifier | http://arxiv.org/abs/math-ph/0607050 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/114992 | |
| dc.subject | Mathematical Physics | |
| dc.subject | Combinatorics | |
| dc.subject | 05C80;15A52;60F99 | |
| dc.title | Asymptotic Behavior of Partition Functions with Graph Laplacian | |
| dc.type | text |