= Michael Aizenman
{c}
Michael Aizenman coauthored tree-diagram inequalities for <percolation> with <Charles M. Newman>. Their work controls multipoint connectivity and gives a condition for the <percolation susceptibility exponent> to take its mean-field value. The method relates large-scale critical behavior to convergence properties of diagrams built from pairwise connection probabilities.<Tree graph inequalities and critical behavior in percolation models by Michael Aizenman and Charles M. Newman>[Abstract of the original article]{ref}
Back to article page
