Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition

Amitava Datta, Andrew Michael Gozzard, Max Hector Ward-Graham

    Research output: Contribution to journalArticle

    • 1 Citations

    Abstract

    The average path length in a network is an important parameter for measuring the end-to-end delay for message delivery. The delay between an arbitrary pair of nodes is smaller if the average path length is low. It is possible to reduce the average path length of a network by adding one or more additional links between pairs of nodes. However, a naïve algorithm is often very expensive for determining which additional link can reduce the average path length in a network the most. In this paper, we present two efficient algorithms to minimize the average network path length by link addition. Our algorithms can process significantly larger networks compared to the naïve algorithm. We present simple implementations of our algorithms, as well as performance studies.
    LanguageEnglish
    Pages282-289
    Number of pages8
    JournalInformation Sciences
    Volume422
    DOIs
    StatePublished - Jan 2018

    Fingerprint

    Small-world networks
    Small-world Network
    Network Algorithms
    Path Length
    Fast Algorithm
    End-to-end Delay
    Vertex of a graph
    Efficient Algorithms
    Small-world network
    Minimise
    Arbitrary

    Cite this

    @article{0998d03e2f2c4f868fd9d69cfa61b530,
    title = "Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition",
    abstract = "The average path length in a network is an important parameter for measuring the end-to-end delay for message delivery. The delay between an arbitrary pair of nodes is smaller if the average path length is low. It is possible to reduce the average path length of a network by adding one or more additional links between pairs of nodes. However, a na{\"i}ve algorithm is often very expensive for determining which additional link can reduce the average path length in a network the most. In this paper, we present two efficient algorithms to minimize the average network path length by link addition. Our algorithms can process significantly larger networks compared to the na{\"i}ve algorithm. We present simple implementations of our algorithms, as well as performance studies.",
    author = "Amitava Datta and Gozzard, {Andrew Michael} and Ward-Graham, {Max Hector}",
    year = "2018",
    month = "1",
    doi = "10.1016/j.ins.2017.09.020",
    language = "English",
    volume = "422",
    pages = "282--289",
    journal = "Information Sciences",
    issn = "0020-0255",
    publisher = "Elsevier",

    }

    Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition. / Datta, Amitava; Gozzard, Andrew Michael; Ward-Graham, Max Hector.

    In: Information Sciences, Vol. 422, 01.2018, p. 282-289.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition

    AU - Datta,Amitava

    AU - Gozzard,Andrew Michael

    AU - Ward-Graham,Max Hector

    PY - 2018/1

    Y1 - 2018/1

    N2 - The average path length in a network is an important parameter for measuring the end-to-end delay for message delivery. The delay between an arbitrary pair of nodes is smaller if the average path length is low. It is possible to reduce the average path length of a network by adding one or more additional links between pairs of nodes. However, a naïve algorithm is often very expensive for determining which additional link can reduce the average path length in a network the most. In this paper, we present two efficient algorithms to minimize the average network path length by link addition. Our algorithms can process significantly larger networks compared to the naïve algorithm. We present simple implementations of our algorithms, as well as performance studies.

    AB - The average path length in a network is an important parameter for measuring the end-to-end delay for message delivery. The delay between an arbitrary pair of nodes is smaller if the average path length is low. It is possible to reduce the average path length of a network by adding one or more additional links between pairs of nodes. However, a naïve algorithm is often very expensive for determining which additional link can reduce the average path length in a network the most. In this paper, we present two efficient algorithms to minimize the average network path length by link addition. Our algorithms can process significantly larger networks compared to the naïve algorithm. We present simple implementations of our algorithms, as well as performance studies.

    U2 - 10.1016/j.ins.2017.09.020

    DO - 10.1016/j.ins.2017.09.020

    M3 - Article

    VL - 422

    SP - 282

    EP - 289

    JO - Information Sciences

    T2 - Information Sciences

    JF - Information Sciences

    SN - 0020-0255

    ER -