A linked-cluster expansion for the free energy in the petit canonical ensemble is presented and proved. It has the advantage of avoiding the introduction of the unknown chemical potential in the perturbation series. As a consequence of correlations among the population numbers
n(K), additional linkages representing these correlations appear. The result is used to find the ground-state energy of a many-body fermion system. This expression reduces to the Brueckner-Goldstone expansion only in the case of central forces in an isotropic system, a theorem due to Kohn, Luttinger, and Ward. It is also shown that in the random phase approximation, correlation bonds do not contribute. Finally the relation of our formalism to the Bloch-De Dominicis expansion for the grand partition function is discussed.
We discuss the application of numerical linked cluster expansions (NLCEs) to study one dimensional lattice systems in thermal equilibrium and after quantum quenches from thermal equilibrium states. For the former, we calculate observables in the grand canonical ensemble, and for the latter we calculate observables in the diagonal ensemble. When converged, NLCEs provide results in the thermodynamic limit. We use two different NLCEs: a maximally connected expansion introduced in previous works and a site-based expansion. We compare the effectiveness of both NLCEs. The site-based NLCE is found to work best for systems in thermal equilibrium. However, in thermal equilibrium and after quantum quenches, the site-based NLCE can diverge when the maximally connected one converges. We relate this divergence to the exponentially large number of clusters in the site-based NLCE and the behavior of the weights of observables in those clusters. We discuss the effectiveness of resummations to cure the divergence. Our NLCE calculations are compared to exact diagonalization ones in lattices with periodic boundary conditions. NLCEs are found to outperform exact diagonalization in periodic systems for all quantities studied.
We generalize the technique of linked cluster expansions on hypercubic lattices to actions that couple fields at lattice sites which are not nearest neighbors. We show that in this case the graphical expansion can be arranged in such a way that the classes of graphs to be considered are identical to those of the pure nearest neighbor interaction. The only change then concerns the computation of lattice imbedding numbers. All the complications that arise can be reduced to a generalization of the notion of free random walks, including hopping beyond nearest neighbor. Explicit expressions for combinatorical numbers of the latter are given. We show that under some general conditions the linked cluster expansion series have a nonvanishing radius of convergence.