A combinatorial proof of tree decay of semi-invariants

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We consider finite range Gibbs fields and provide a purely combinatorial proof of the exponential tree decay of semi--invariants, supposing that the logarithm of the partition function can be expressed as a sum of suitable local functions of the boundary conditions. This hypothesis holds for completely analytical Gibbs fields; in this context the tree decay of semi--invariants has been proven via analyticity arguments. However the combinatorial proof given here can be applied also to the more complicated case of disordered systems in the so called Griffiths' phase when analyticity arguments fail.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A combinatorial proof of tree decay of semi-invariants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A combinatorial proof of tree decay of semi-invariants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A combinatorial proof of tree decay of semi-invariants will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-375786

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.