2021
DOI: 10.1002/rsa.21068
|View full text |Cite
|
Sign up to set email alerts
|

Gaussian approximation for rooted edges in a random minimal directed spanning tree

Abstract: We study the total 𝛼-powered length of the rooted edges in a random minimal directed spanning tree -first introduced in Bhatt and Roy ( 2004) -on a Poisson process with intensity s β‰₯ 1 on the unit cube [0, 1] 𝑑 for 𝑑 β‰₯ 3. While a Dickman limit was proved in Penrose and Wade (2004) in the case of 𝑑 = 2, in dimensions three and higher, Bai, Lee and Penrose (2006) showed a Gaussian central limit theorem when 𝛼 = 1, with a rate of convergence of the order (log s) βˆ’(π‘‘βˆ’2)βˆ•4 (log log s) (𝑑+1)βˆ•2 . In this artic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 22 publications
0
6
0
Order By: Relevance
“…where for y ∈ X, M s (y) := max{M s (y) 2 , M s (y) 4 } and hs (y) := max{h s (y) 2/(4+p/2) , h s (y) 4/(4+p/2) }.…”
Section: Notation and Main Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…where for y ∈ X, M s (y) := max{M s (y) 2 , M s (y) 4 } and hs (y) := max{h s (y) 2/(4+p/2) , h s (y) 4/(4+p/2) }.…”
Section: Notation and Main Resultsmentioning
confidence: 99%
“…Also, (A2) holds with p = 1 and M 1,1 (x) = w(x), while (2.4) holds with r(x, y) = 4 for x ∈ Z while q(x 1 , x 2 ) ≀ 4e βˆ’4 for x 1 , x 2 ∈ Z 2 with x 2 βˆ’ x 1 ∈ B + B and q(x 1 , x 2 ) = 0 otherwise. Noticing that max{w(x) 2 , w(x) 4 , w(x) 9/2 } = w(x) 2 , we obtain that for all Ξ± > 0, there exists a constant C Ξ± such that…”
Section: Non-diffuse Intensity Measures and Unbounded Scoresmentioning
confidence: 99%
See 2 more Smart Citations
“…To that end, we study the upper large deviations of the sum of power-weighted edge lengths, i.e., , where the sum is taken over all network edges in a growing sampling window and denotes the power considered. This is a fundamental characteristic for spatial random networks, which has already been studied in detail for the Gilbert graph and the directed spanning forest [5, 18].…”
Section: Introductionmentioning
confidence: 99%