Abstract.
We prove a large deviation principle for a process indexed by cubes of the multidimensional integer lattice or Euclidean space, under approximate additivity and regularity hypotheses. The rate function is the convex dual of the limiting logarithmic moment generating function. In some applications the rate function can be expressed in terms of relative entropy. The general result applies to processes in Euclidean combinatorial optimization, statistical mechanics, and computational geometry. Examples include the length of the minimal tour (the traveling salesman problem), the length of the minimal matching graph, the length of the minimal spanning tree, the length of the k-nearest neighbors graph, and the free energy of a short-range spin glass model.
Author information
Authors and Affiliations
Additional information
Received: 3 April 1999 / Revised version: 23 June 1999 / Published online: 8 May 2001
Rights and permissions
About this article
Cite this article
Seppäläinen, T., Yukich, J. Large deviation principles for Euclidean functionals and other nearly additive processes. Probab Theory Relat Fields 120, 309–345 (2001). https://doi.org/10.1007/PL00008785
Issue Date:
DOI: https://doi.org/10.1007/PL00008785
- Mathematics Subject Classification (2000): 60F10, 05C80, 60D05
- Key words or phrases: Large deviation principles – Random graphs – Combinatorial optimization – Statistical mechanics – Spin glass model