Upper bound on the expected size of the intrinsic ball

A. Sapozhnikov

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)
42 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)297-298
JournalElectronic Communications in Probability
Volume15
Publication statusPublished - 2010

Fingerprint

Susceptibility
Triangle
Ball
Exponent
Radius
Upper bound
Theorem
Intrinsic

Cite this

@article{1049bec46f774bad9ddb8541ccc35880,
title = "Upper bound on the expected size of the intrinsic ball",
abstract = "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.",
author = "A. Sapozhnikov",
year = "2010",
language = "English",
volume = "15",
pages = "297--298",
journal = "Electronic Communications in Probability",
issn = "1083-589X",
publisher = "Institute of Mathematical Statistics",

}

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

In: Electronic Communications in Probability, Vol. 15, 2010, p. 297-298.

Research output: Contribution to journalArticleAcademicpeer-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 -