Complex Sciences. First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1

Research Article

Analysing Weighted Networks: An Approach via Maximum Flows

Download
430 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-02466-5_109,
        author={Markus Brede and Fabio Boschetti},
        title={Analysing Weighted Networks: An Approach via Maximum Flows},
        proceedings={Complex Sciences. First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1},
        proceedings_a={COMPLEX PART 1},
        year={2012},
        month={5},
        keywords={Complex Networks Weighted Networks},
        doi={10.1007/978-3-642-02466-5_109}
    }
    
  • Markus Brede
    Fabio Boschetti
    Year: 2012
    Analysing Weighted Networks: An Approach via Maximum Flows
    COMPLEX PART 1
    Springer
    DOI: 10.1007/978-3-642-02466-5_109
Markus Brede1,*, Fabio Boschetti1
  • 1: CSIRO Marine and Athmospheric Research
*Contact email: Markus.Brede@Csiro.au

Abstract

We present an approach for analysing weighted networks based on maximum flows between nodes and generalize to weighted networks ‘global’ measures that are well-established for binary networks, such as pathlengths, component size or betweenness centrality. This leads to a generalization of the algorithm of Girvan and Newman for community identification. The application of the weighted network measures to two real-world example networks, the international trade network and the passenger flow network between EU member countries, demonstrates that further insights about the systems’ architectures can be gained this way.