Survival under random coverings of trees (Q1104333): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: John W. Moon / rank | |||
Property / reviewed by | |||
Property / reviewed by: Peter Kirschenhofer / rank | |||
Revision as of 07:40, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Survival under random coverings of trees |
scientific article |
Statements
Survival under random coverings of trees (English)
0 references
1988
0 references
Let \(v_ 1,...,v_ n\) be a random ordering of the nodes of a rooted tree \(T_ n\). If N(v) denotes the set of consisting of node v and all nodes joined to v, the nodes in \(N(v_ 1)\cup...\cup N(v_ j)\) are called ``j-covered'' and the remaining nodes ``j-survivors''. In the paper the expected number s(n,j) of j-survivors in the trees \(T_ n\) in some given family \({\mathcal F}\) of rooted trees is studied, as well as the expected value \(c_ r(n)\) of the least integer j such that the root r of \(T_ n\) is j-covered. The investigations are motivated by some problems arising in the context of security considerations for communication networks.
0 references
j-survivors
0 references
rooted trees
0 references
j-covered
0 references