### Abstract

Original language | English |
---|---|

Pages (from-to) | 297-298 |

Journal | Electronic Communications in Probability |

Volume | 15 |

Publication status | Published - 2010 |

### Fingerprint

### Cite this

*Electronic Communications in Probability*,

*15*, 297-298.

}

*Electronic Communications in Probability*, vol. 15, pp. 297-298.

**Upper bound on the expected size of the intrinsic ball.** / Sapozhnikov, A.

Research output: Contribution to journal › Article › Academic › peer-review

TY - JOUR

T1 - Upper bound on the expected size of the intrinsic ball

AU - Sapozhnikov, A.

PY - 2010

Y1 - 2010

N2 - We give a short proof of Theorem 1.2(i) from [5]. We show that the expected size of the intrinsic ball of radius r is at most Cr if the susceptibility exponent ¿ is at most 1. In particular, this result follows if the so-called triangle condition holds.

AB - We give a short proof of Theorem 1.2(i) from [5]. We show that the expected size of the intrinsic ball of radius r is at most Cr if the susceptibility exponent ¿ is at most 1. In particular, this result follows if the so-called triangle condition holds.

M3 - Article

VL - 15

SP - 297

EP - 298

JO - Electronic Communications in Probability

JF - Electronic Communications in Probability

SN - 1083-589X

ER -