Strong laws for Euclidean graphs with general edge weights
✍ Scribed by Raúl Jiménez; J.E. Yukich
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 123 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
✦ Synopsis
Consider a random Euclidean graph G with a vertex set consisting of i.i.d. random variables with a common density f. Let the edge lengths |e|; e ∈ G, be weighted by a function . We provide su cient conditions on G and guaranteeing that the total edge length functional e∈G (|e|) satisÿes a strong law of large numbers. The limiting constant is shown to depend explicitly on f and .
📜 SIMILAR VOLUMES
Let \(\left\{X, X_{n} ; \vec{n} \in \mathbb{N}^{d}\right\}\) be a field of independent identically distributed real random variables, \(0<p<2\), and \(\left\{a_{\bar{n}, \bar{k}} ;(\bar{n}, \bar{k}) \in \mathbb{N}^{d} \times \mathbb{N}^{d}, \bar{k} \leqslant \bar{n}\right\}\) a triangular array of r