Minimum spanning trees of weighted scale-free networks

@inproceedings{Macdonald2005MinimumST,
  title={Minimum spanning trees of weighted scale-free networks},
  author={Patrick J. Macdonald and Eivind Almaas and A. L. Barab{\'a}si},
  year={2005}
}
– A complete characterization of real networks requires us to understand the consequences of the uneven interaction strengths between a system’s components. Here we use minimum spanning trees (MSTs) to explore the effect of correlations between link weights and network topology on scale-free networks. Solely by changing the nature of the correlations between weights and network topology, the structure of the MSTs can change from scale-free to exponential. Additionally, for some choices of… CONTINUE READING
Highly Cited
This paper has 49 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Taking into account the degreedegree correlations of our model [ 25 ] , we find the same w  1 limiting behavior as that of eqs

  • L. KrapivskyP., S. Redner
  • 2001

The Structure and Growth of Networks

  • S H.Strogatz
  • Nature,
  • 2001
1 Excerpt

Introduction to Mathematical Statistics, 5th edition (Macmillan

  • R V.Hogg, A T.Craig
  • 1995
1 Excerpt

Introduction to Percolation Theory (CRC

  • D. Stauffer, A. Aharony
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…