1998
DOI: 10.1007/s003579900022
|View full text |Cite
|
Sign up to set email alerts
|

Indexed Dendrograms on random Dissimilarities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0
1

Year Published

2004
2004
2009
2009

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(13 citation statements)
references
References 0 publications
0
12
0
1
Order By: Relevance
“…In the latter case, arguments that entirely parallel those applied to unlabeled trees give us that z → F (z, u/2) has no singularity on |z| = 1 2 . This implies, for u ∈ , the exponential smallness of ϕ n (u/2), as defined in (18), resulting in an estimate that parallels (21). Theorem IX.14 of [8] again enables us to conclude as to the existence of a local limit law.…”
Section: Definitionmentioning
confidence: 75%
See 3 more Smart Citations
“…In the latter case, arguments that entirely parallel those applied to unlabeled trees give us that z → F (z, u/2) has no singularity on |z| = 1 2 . This implies, for u ∈ , the exponential smallness of ϕ n (u/2), as defined in (18), resulting in an estimate that parallels (21). Theorem IX.14 of [8] again enables us to conclude as to the existence of a local limit law.…”
Section: Definitionmentioning
confidence: 75%
“…As expressed by Theorem IX.14 of [8], the existence of a quasi-powers approximation (when u is near 1), as in (16) and (17), and of the exponentially small bound (when u ∈ is away from 1), as provided by (21), suffices to ensure the existence of a local limit law. (The reasoning corresponding to Theorem IX.14 of [8] is simple: start from…”
Section: Definitionmentioning
confidence: 99%
See 2 more Smart Citations
“…A region that remains isolated for a long time may be significantly different from the other. With respect to the ID's, the discrete survival time of a singleton r (original catchment basins) [15] is the integer l(l) defined by r 2P lK1 and r ;P l (3)…”
Section: Overview Of the Algorithmmentioning
confidence: 99%