Ensemble equivalence for distinguishable particles
arXiv:1601.07794 · doi:10.3390/e18070259
Abstract
Statistics of distinguishable particles has become relevant in systems of colloidal particles and in the context of applications of statistical mechanics to complex networks. When studying these type of systems with the standard textbook formalism, non-physical results such as non-extensive entropies are obtained. In this paper, we will show that the commonly used expression for the partition function of a system of distinguishable particles leads to huge fluctuations of the number of particles in the grand canonical ensemble and, consequently, to non-equivalence of statistical ensembles. We will see how a new proposed definition for the entropy of distinguishable particles by Swendsen [J. Stat. Phys. 107, 1143 (2002)] solves the problem and restores ensemble equivalence. We also show that the new proposal for the partition function does not produce any inconsistency for a system of distinguishable localized particles, where the monoparticular partition function is not extensive.
References in corpus (8)
- The statistical mechanics of networks
- The entropy of network ensembles
- The entropy of randomized network ensembles
- The Gibbs Paradox and the Distinguishability of Identical Particles
- Testing the Foundations of Classical Entropy: Colloid Experiments
- Statistical Mechanics of Multi-Edge Networks
- The role of adjacency matrix degeneration in maximum entropy weighted network models
- Thermodynamics of the System of Distinguishable Particles