Optimal search strategies on complex multi-linked networks

Abstract : In this paper we consider the problem of optimal search strategies on multi-linked networks, i.e. graphs whose nodes are endowed with several independent sets of links. We focus preliminarily on agents randomly hopping along the links of a graph, with the additional possibility of performing non-local hops to randomly chosen nodes with a given probability. We show that an optimal combination of the two jump rules exists that maximises the efficiency of target search, the optimum reflecting the topology of the network. We then generalize our results to multi-linked networks with an arbitrary number of mutually interfering link sets.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02072243
Contributor : Laëtitia Legoupil <>
Submitted on : Tuesday, March 19, 2019 - 8:57:38 AM
Last modification on : Tuesday, August 13, 2019 - 11:06:19 AM

Links full text

Identifiers

Collections

Citation

Francesca Di Patti, Duccio Fanelli, Francesco Piazza. Optimal search strategies on complex multi-linked networks. Scientific Reports, Nature Publishing Group, 2015, 5 (1), ⟨10.1038/srep09869⟩. ⟨hal-02072243⟩

Share

Metrics

Record views

26