Statistics of weighted treelike networks
Statistics of weighted treelike networks
We study the statistics of growing networks with a tree topology in which each link carries a weight ${({k}_{i}{k}_{j})}^{\ensuremath{\theta}}$, where ${k}_{i}$ and ${k}_{j}$ are the node degrees at the end points of link $ij$. Network growth is governed by preferential attachment in which a newly added node attaches to a …