Related papers: Partition functions and graphs: A combinatorial ap…
We describe an efficient practical procedure for enumerating and regrouping vacuum Feynman graphs of a given order in perturbation theory. The method is based on a combination of Schwinger-Dyson equations and the two-particle-irreducible…
The problem of integer partitions is addressed using the microcanonical approach which is based on the analogy between this problem in the number theory and the calculation of microstates of a many-boson system. For ordinary…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
We describe a rich family of binary variables statistical mechanics models on a given planar graph which are equivalent to Gaussian Grassmann Graphical models (free fermions) defined on the same graph. Calculation of the partition function…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
We examine "partition zeta functions" analogous to the Riemann zeta function but summed over subsets of integer partitions. We prove an explicit formula for a family of partition zeta functions already shown to have nice properties -- those…
Partition of unity methods (PUMs) on graphs are simple and highly adaptive auxiliary tools for graph signal processing. Based on a greedy-type metric clustering and augmentation scheme, we show how a partition of unity can be generated in…
MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…
Normal factor graph duality offers new possibilities for Monte Carlo algorithms in graphical models. Specifically, we consider the problem of estimating the partition function of the ferromagnetic Ising and Potts models by Monte Carlo…
The key problem of statistical physics standing over one hundred years is how to exactly calculate the partition function (or free energy) of many-body interaction systems, which severely hinders application of the theory for realistic…
Ewens-Pitman's partition structure arises as a system of sampling consistent probability distributions on set partitions induced by the Pitman-Yor process. It is widely used in statistical applications, particularly in species sampling…
Number partitioning is an NP-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy from the hard to solve instances and that reflects the…
In quantum electrodynamics, optical processes are theoretically described by double-sided Feynman diagrams. This formalism is powerful in the case of molecules but proves inappropriate to account for light-matter interactions within complex…
Can we use machine learning to compress graph data? The absence of ordering in graphs poses a significant challenge to conventional compression algorithms, limiting their attainable gains as well as their ability to discover relevant…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…
We consider a simple model of the dynamics of a single electron in a crystal lattice. Although this is a standard problem in condensed matter physics, alternative ways of evaluating a partition function for such a system lead to equalities,…
Buryak, Feigin and Nakajima computed a generating function for a family of partition statistics by using the geometry of the $Z/cZ$ fixed point sets in the Hilbert scheme of points on $C^2$. Loehr and Warrington had already shown how a…
Ferrers graphs and tables of partitions are treated as vectors. Matrix operations are used for simple proofs of identities concerning partitions. Interpreting partitions as vectors gives a possibility to generalize partitions on negative…
We prove a neat factorization property of Feynman graphs in covariant perturbation theory. The contribution of the graph to the effective action is written as a product of a massless scalar momentum integral that only depends on the basic…
Number partitioning is one of the classical NP-hard problems of combinatorial optimization. It has applications in areas like public key encryption and task scheduling. The random version of number partitioning has an "easy-hard" phase…