λ∞, Vertex isoperimetry and concentration

Combinatorica

Volumn 20, Issue 2, 2000, Pages 153-172

  Bobkov, S ^a   Houdre C ^b   Tetali, P ^b  

^a SYKTYVKAR STATE UNIVERSITY   (Russian Federation)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034355104     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930070018     Document Type: Article

References (16)

1. M. AJTAI, J. KOMLÓS and E. SZEMERÉDI: Sorting in c log n parallel steps, Combinatorica, 3 (1983), 1-19.
2. N. ALON: Eigenvalues and expanders, Combinatorica, 6 (1986), 83-96.
3. N. ALON, R. BOPPANA, and J. SPENCER: An asymptotic isoperimetric inequality, Geom. and Funct. Anal., 8 (1998), 411-436.
4. 1, Isoperimetric inequalities for graphs, and superconcentrators, J. Combinatorial Theory Ser. B, 38 (1985), 73-88.
5. M. BLUM, R. M. KARP, O. VORNBERGER, C. H. PAPADIMITRIOU, and M. YANNAKAKIS: The complexity of testing whether a graph is a superconcentrator, Inform. Process. Letters, 13 (1981), 164-167.
6. S. G. BOBKOV and C. HOUDRÉ: Variance of Lipschitz and an isoperimetric problem for a class of product measure, Bernoulli, 2 (1996), 249-255.
7. S. G. BOBKOV and M. LEDOUX: Poincaré inequalities and Talagrand's concentration phenomenon for the exponential measure, Probab. Theory Relat. Fields, 107 (1997), 383-400.
8. J. CHEEGER: A lower bound for the smallest eigenvalue of the Laplacian, in: Problems in Analysis (edited by R.C. Gunning), Princeton University Press, New Jersey (1970), 195-199.
9. M. FIEDLER: A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory, Czech. Math. J., 25 (1975), 619-633.
10. O. GABBER and Z. GALIL: Explicit construction of linear sized superconcentrators, J. Comput. System Sci., 22 (1981), 407-420.
11. C. HOUDRÉ and P. TETALI: Isoperimetric invariants for product Markov chains and graph products, Preprint (1996).
12. C. HOUDRÉ and P. TETALI: Concentration of measure for products of Markov kernels and graph products via functional inequalities, Combin. Probab. Comput., (to appear).
13. J. JA'JA: Time space tradeoffs for some algebraic problems, Proc. 12th Annual ACM Symposium on Theory of Computing, (1980), 339-350.
14. N. PIPPENGER: Superconcentrators, SIAM J. Computing, 6 (1977), 298-304.
15. M. TOMPA: Time space tradeoffs for computing functions using connectivity properties of their circuits, J. Comput. System Sci., 20 (1980), 118-132.
16. L. G. VALIANT: Graph theoretic properties in computational complexity, J. Comput. System Sci., 13 (1976), 278-285.