Аннотация
The connections in many networks are not merely binary entities, either
present or not, but have associated weights that record their strengths
relative to one another. Recent studies of networks have, by and large, steered
clear of such weighted networks, which are often perceived as being harder to
analyze than their unweighted counterparts. Here we point out that weighted
networks can in many cases be analyzed using a simple mapping from a weighted
network to an unweighted multigraph, allowing us to apply standard techniques
for unweighted graphs to weighted ones as well. We give a number of examples of
the method, including an algorithm for detecting community structure in
weighted networks and a new and simple proof of the max-flow/min-cut theorem.
Пользователи данного ресурса
Пожалуйста,
войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)