Deakin University
Browse

File(s) under permanent embargo

Centrality measure in weighted networks based on an amoeboid algorithm

journal contribution
posted on 2012-02-01, 00:00 authored by Y Zhang, Zili ZhangZili Zhang, D Wei, Y Deng
Within network analysis, various measures of node centrality have been developed. In this paper, for weighted networks, a new centrality measure based on an amoeboid algorithm is proposed, which is called Physarum centrality. The measure not only focuses on shortest paths, but also includes contributions from competing paths. With the amoeboid algorithm, each edge is endowed with a flux and edges on shorter paths are of greater flux. By defining flux as criticality of edges, Physarum centrality of a node can be easily calculated as summing up the criticality of edges attached to it. Examples and applications are given to show the effective of our proposed measure in weighted networks. Copyright © 2012 Binary Information Press.

History

Journal

Journal of Information and Computational Science

Volume

9

Pagination

369-376

Location

Norwalk, Conn.

ISSN

1548-7741

Language

eng

Publication classification

C2.1 Other contribution to refereed journal

Copyright notice

2012, Binary Information Press

Issue

2

Publisher

Binary Information Press

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC