Singularities in the entropy of asymptotically large simple graphs
Combinatorics
2015-08-31 v2
Abstract
We prove that the asymptotic entropy of large simple graphs, as a function of fixed edge and triangle densities, is nondifferentiable along a certain curve.
Cite
@article{arxiv.1302.3531,
title = {Singularities in the entropy of asymptotically large simple graphs},
author = {Charles Radin and Lorenzo Sadun},
journal= {arXiv preprint arXiv:1302.3531},
year = {2015}
}
Comments
Several new results are added. Future versions will be available at http://www.ma.utexas.edu/users/radin/papers.html