Skip to main content

The Fundamental Conjectures

  • Chapter
  • 4540 Accesses

Abstract

In Chapter 12 we outlay a long range research program. We believe that it might well be true in considerable generality that “chaining explains all the part of the boundedness which is due to cancellation”. Even if this conjecture is true, there would remain to describe the “part of the boundedness which owes nothing to cancellation”, and for this part also we propose sweeping conjectures. At the heuristic level, the underlying idea of these conjectures is that ultimately, a bound for a stochastic process always arises from the use of the ‘union bound’ P(∪ n A n )≤∑ n P(A n ) in a simple situation, and the use of basic principles such as linearity and positivity, or combinations of these.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Publ. Math. IHÉS 81, 73–205 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. Talagrand, M.: Selector processes on classes of sets. Probab. Theory Relat. Fields 135(4), 471–486 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  3. Talagrand, M.: The Generic Chaining. Springer Monographs in Mathematics. Springer, Berlin (2005). viii+222 pp. ISBN: 3-540-24518-9

    MATH  Google Scholar 

  4. Talagrand, M.: Are many small sets explicitly small? In: STOC’10—Proceedings of the 2010 ACM International Symposium on Theory of Computing, pp. 13–35. ACM, New York (2010). Available at http://research.microsoft.com/apps/video/dl.aspx?id=137091

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Talagrand, M. (2014). The Fundamental Conjectures. In: Upper and Lower Bounds for Stochastic Processes. Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge / A Series of Modern Surveys in Mathematics, vol 60. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54075-2_12

Download citation

Publish with us

Policies and ethics