Premium
Convergent sequences of sparse graphs: A large deviations approach
Author(s) -
Borgs Christian,
Chayes Jennifer,
Gamarnik David
Publication year - 2017
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20694
Subject(s) - mathematics , convergence (economics) , bounded function , limit (mathematics) , random graph , convergence of random variables , similarity (geometry) , weak convergence , normal convergence , sequence (biology) , convergence tests , limit of a sequence , graph theory , large deviations theory , compact convergence , discrete mathematics , rate of convergence , graph , combinatorics , computer science , random variable , channel (broadcasting) , computer security , artificial intelligence , image (mathematics) , asset (computer security) , economic growth , mathematical analysis , computer network , biology , genetics , statistics , economics
ABSTRACT Models based on sparse graphs are of interest to many communities: they appear as basic models in combinatorics, probability theory, optimization, statistical physics, information theory, and more applied fields of social sciences and economics. Different notions of similarity (and hence convergence) of sparse graphs are of interest in different communities. In probability theory and combinatorics, the notion of Benjamini‐Schramm convergence, also known as left‐convergence, is used quite frequently. Statistical physicists are interested in the the existence of the thermodynamic limit of free energies, which leads naturally to the notion of right‐convergence. Combinatorial optimization problems naturally lead to so‐called partition convergence, which relates to the convergence of optimal values of a variety of constraint satisfaction problems. The relationship between these different notions of similarity and convergence is, however, poorly understood. In this paper we introduce a new notion of convergence of sparse graphs, which we call Large Deviations or LD‐convergence, and which is based on the theory of large deviations. The notion is introduced by “decorating” the nodes of the graph with random uniform i.i.d. weights and constructing corresponding random measures on [ 0 , 1 ] and[ 0 , 1 ] 2 . A graph sequence is defined to be converging if the corresponding sequence of random measures satisfies the Large Deviations Principle with respect to the topology of weak convergence on bounded measures on[ 0 , 1 ] d , d = 1 , 2 . The corresponding large deviations rate function can be interpreted as the limit object of the sparse graph sequence. In particular, we can express the limiting free energies in terms of this limit object. We then establish that LD‐convergence implies the other three notions of convergence discussed above, and at the same time establish several previously unknown relationships between the other notions of convergence. In particular, we show that partition‐convergence does not imply left‐ or right‐convergence, and that right‐convergence does not imply partition‐convergence. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 52–89, 2017