Low-cost search in scale-free networks

Jieun Jeong, Piotr Berman

    Research output: Contribution to journalArticle

    6 Citations (Scopus)

    Abstract

    We study local search algorithms for networks with heterogeneous edge weights, testing them on scale-free and Erdös-Rényi networks. We assume that the location of the destination node is discovered when it is two edges away, and that the search cost is additive. It was previously shown that a search strategy preferring high-degree nodes reduces the average search cost over a simple random walk. In the prior work, for the case when the edge costs are randomly distributed, a different preference was investigated [high local betweenness centrality (LBC)], and was found to be superior to high-degree preference in scale-free networks, with the exception for the most sparse ones. We have found several preference criteria that are simpler and which, in all networks we tested, yield a lower cost than other criteria including high-degree, high-LBC, and low-edge cost.

    Original languageEnglish (US)
    Article number036104
    JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
    Volume75
    Issue number3
    DOIs
    StatePublished - Mar 5 2007

    Fingerprint

    Scale-free Networks
    costs
    Betweenness
    Centrality
    Costs
    Simple Random Walk
    Local Search Algorithm
    Search Strategy
    Vertex of a graph
    random walk
    Exception
    Testing

    All Science Journal Classification (ASJC) codes

    • Statistical and Nonlinear Physics
    • Statistics and Probability
    • Condensed Matter Physics

    Cite this

    @article{b3efa96f47e6449a9f78cd97f092ddfe,
    title = "Low-cost search in scale-free networks",
    abstract = "We study local search algorithms for networks with heterogeneous edge weights, testing them on scale-free and Erd{\"o}s-R{\'e}nyi networks. We assume that the location of the destination node is discovered when it is two edges away, and that the search cost is additive. It was previously shown that a search strategy preferring high-degree nodes reduces the average search cost over a simple random walk. In the prior work, for the case when the edge costs are randomly distributed, a different preference was investigated [high local betweenness centrality (LBC)], and was found to be superior to high-degree preference in scale-free networks, with the exception for the most sparse ones. We have found several preference criteria that are simpler and which, in all networks we tested, yield a lower cost than other criteria including high-degree, high-LBC, and low-edge cost.",
    author = "Jieun Jeong and Piotr Berman",
    year = "2007",
    month = "3",
    day = "5",
    doi = "10.1103/PhysRevE.75.036104",
    language = "English (US)",
    volume = "75",
    journal = "Physical Review E - Statistical, Nonlinear, and Soft Matter Physics",
    issn = "1539-3755",
    number = "3",

    }

    Low-cost search in scale-free networks. / Jeong, Jieun; Berman, Piotr.

    In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, Vol. 75, No. 3, 036104, 05.03.2007.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Low-cost search in scale-free networks

    AU - Jeong, Jieun

    AU - Berman, Piotr

    PY - 2007/3/5

    Y1 - 2007/3/5

    N2 - We study local search algorithms for networks with heterogeneous edge weights, testing them on scale-free and Erdös-Rényi networks. We assume that the location of the destination node is discovered when it is two edges away, and that the search cost is additive. It was previously shown that a search strategy preferring high-degree nodes reduces the average search cost over a simple random walk. In the prior work, for the case when the edge costs are randomly distributed, a different preference was investigated [high local betweenness centrality (LBC)], and was found to be superior to high-degree preference in scale-free networks, with the exception for the most sparse ones. We have found several preference criteria that are simpler and which, in all networks we tested, yield a lower cost than other criteria including high-degree, high-LBC, and low-edge cost.

    AB - We study local search algorithms for networks with heterogeneous edge weights, testing them on scale-free and Erdös-Rényi networks. We assume that the location of the destination node is discovered when it is two edges away, and that the search cost is additive. It was previously shown that a search strategy preferring high-degree nodes reduces the average search cost over a simple random walk. In the prior work, for the case when the edge costs are randomly distributed, a different preference was investigated [high local betweenness centrality (LBC)], and was found to be superior to high-degree preference in scale-free networks, with the exception for the most sparse ones. We have found several preference criteria that are simpler and which, in all networks we tested, yield a lower cost than other criteria including high-degree, high-LBC, and low-edge cost.

    UR - http://www.scopus.com/inward/record.url?scp=33847737789&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=33847737789&partnerID=8YFLogxK

    U2 - 10.1103/PhysRevE.75.036104

    DO - 10.1103/PhysRevE.75.036104

    M3 - Article

    VL - 75

    JO - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

    JF - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

    SN - 1539-3755

    IS - 3

    M1 - 036104

    ER -