Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-27T22:12:01.833Z Has data issue: false hasContentIssue false
  • English
  • Français

Concentration on the Discrete Torus Using Transportation

Published online by Cambridge University Press:  01 September 2009

M. SAMMER  and
P. TETALI
M. SAMMER
Affiliation:
The Turing Center, University of Washington, Seattle, WA, USA (e-mail: marcus.sammer@gmail.com)
P. TETALI
Affiliation:
School of Mathematics and School of Computer Science, Georgia Institute of Technology, Atlanta, GA 30332, USA (e-mail: tetali@math.gatech.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

The sub-Gaussian constant of a graph arises naturally in bounding the moment-generating function of Lipschitz functions on the graph, with a given probability measure on the set of vertices. The closely related spread constant of a graph measures the maximal variance over all Lipschitz functions on the graph. As such they are both useful (as demonstrated in the works of Bobkov, Houdré and Tetali and Alon, Boppana and Spencer) for describing the concentration of measure phenomenon in product graphs. An equivalent formulation of the sub-Gaussian constant using a transportation inequality, introduced by Bobkov and Götze, is investigated here in depth, leading to a new way of bounding the sub-Gaussian constant. A tight concentration result for the discrete torus is given as a concrete application. An infinite family of graphs is also provided here to demonstrate that, typically, the spread and the sub-Gaussian constants differ by an order of magnitude.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 18 , Issue 5: New Directions in Algorithms, Combinatorics and Optimization , September 2009 , pp. 835 - 860
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Alon, N. (1986) Eigenvalues and expanders. Combinatorica 6 83–96.CrossRefGoogle Scholar
[2]Alon, N., Boppana, R. and Spencer, J. (1998) An asymptotic isoperimetric inequality. Geom. Funct. Anal. 8 411–436.CrossRefGoogle Scholar
[3]Alon, N. and Milman, V. D. (1985) λ1, isoperimetric inequalities for graphs, and superconcentrators. J. Combin. Theory Ser. B 38 73–88.CrossRefGoogle Scholar
[4]Bobkov, S. G. and Götze, F. (1999) Exponential integrability and transportation cost related to logarithmic Sobolev inequalities. J. Funct. Anal. 163 1–28.CrossRefGoogle Scholar
[5]Bobkov, S. G., Houdré, C. and Tetali, P. (2006) The subgaussian constant and concentration inequalities. Israel J. Math. 156 255–283.CrossRefGoogle Scholar
[6]Bollobás, B. and Leader, I. (1990) An isoperimetric inequality on the discrete torus. SIAM J. Discrete Math. 3 32–37.CrossRefGoogle Scholar
[7]Bollobás, B. and Leader, I. (1991) Compressions and isoperimetric inequalities. J. Combin. Theory Ser. A 56 47–62.CrossRefGoogle Scholar
[8]Chen, G.-Y. and Sheu, Y.-C. (2003) On the log-Sobolev constant for the simple random walk on the n-cycle: The even cases. J. Funct. Anal. 202 473–485.CrossRefGoogle Scholar
[9]Chvatal, V. (1983) Linear Programming, Freeman.Google Scholar
[10]Gangbo, W. and McCann, R. J. (1996) The geometry of optimal transportation. Acta Math. 177 113–161.CrossRefGoogle Scholar
[11]Kantorovich, L. V. (1942) On the translocation of masses. Dokl. Akad. Nauk SSSR 37 227–229.Google Scholar
[12]Ledoux, M. (2001) The Concentration of Measure Phenomenon, Vol. 89 of Mathematical Surveys and Monographs, AMS, Providence, RI.Google Scholar
[13]Riordan, O. (1998) An ordering on the even discrete torus. SIAM J. Discrete Math. 11 110–127 (electronic).CrossRefGoogle Scholar