= Charles M. Newman
{c}
Charles M. Newman studied critical behavior in <percolation> with <Michael Aizenman>. Their tree-diagram inequalities bound multipoint connection probabilities using two-point functions. A diagrammatic convergence criterion gives mean-field behavior for the <percolation susceptibility exponent>, connecting the geometry of large clusters with quantitative critical scaling.<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
