Geometry of minimum spanning trees on scale-free networks

The minimum spanning trees on scale-free graphs are shown to be scale-free as well, in the presence of random edge weights. The probability distribution of the weights on the tree differs from regular lattices reflecting the typically short distances (small-world property). We consider also the trees in the absence of such randomness and the ensuing massive degeneracy, which is analyzed with graph theoretical arguments.

MoreLess

Year of publication:	2003
Authors:	Szabó, Gábor J. ; Alava, Mikko ; Kertész, János
Published in:	Physica A: Statistical Mechanics and its Applications. - Elsevier, ISSN 0378-4371. - Vol. 330.2003, 1, p. 31-36
Publisher:	Elsevier
Subject:	Minimum spanning trees \| Random networks \| Global optimization

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011061078