Skip to main content

General Scheme of Cluster Expansion

  • Chapter
Gibbs Random Fields

Part of the book series: Mathematics and Its Applications () ((MASS,volume 44))

Abstract

The technique to be developed here is related to random fields in a countable set T. We note that to use this technique for point and functional fields, they first have to be reduced to fields in a countable set, as explained in . There is, however, a special technique for point fields.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Malyshev, V.A., Minlos, R.A. (1991). General Scheme of Cluster Expansion. In: Gibbs Random Fields. Mathematics and Its Applications (Soviet Series), vol 44. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3708-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-3708-9_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-5649-6

  • Online ISBN: 978-94-011-3708-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics