Persistence of centrality in random growing trees

RANDOM STRUCTURES & ALGORITHMS, no. 1.0 (2018): 136.0-157.0

Cited by: 11|Views7
EI

Abstract:

We investigate properties of node centrality in random growing tree models. We focus on a measure of centrality that computes the maximum subtree size of the tree rooted at each node, with the most central node being the tree centroid. For random trees grown according to a preferential attachment model, a uniform attachment model, or a di...More

Code:

Data:

ZH
Your rating :
0

 

Tags
Comments