Cargando…

Optimal search strategies on complex multi-linked networks

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-loc...

Descripción completa

Detalles Bibliográficos
Autores principales: Di Patti, Francesca, Fanelli, Duccio, Piazza, Francesco
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group 2015
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4423499/
https://www.ncbi.nlm.nih.gov/pubmed/25950716
http://dx.doi.org/10.1038/srep09869
_version_ 1782370224181346304
author Di Patti, Francesca
Fanelli, Duccio
Piazza, Francesco
author_facet Di Patti, Francesca
Fanelli, Duccio
Piazza, Francesco
author_sort Di Patti, Francesca
collection PubMed
description 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.
format Online
Article
Text
id pubmed-4423499
institution National Center for Biotechnology Information
language English
publishDate 2015
publisher Nature Publishing Group
record_format MEDLINE/PubMed
spelling pubmed-44234992015-05-13 Optimal search strategies on complex multi-linked networks Di Patti, Francesca Fanelli, Duccio Piazza, Francesco Sci Rep Article 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. Nature Publishing Group 2015-05-07 /pmc/articles/PMC4423499/ /pubmed/25950716 http://dx.doi.org/10.1038/srep09869 Text en Copyright © 2015, Macmillan Publishers Limited. All rights reserved http://creativecommons.org/licenses/by/4.0/ This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article's Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder in order to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/
spellingShingle Article
Di Patti, Francesca
Fanelli, Duccio
Piazza, Francesco
Optimal search strategies on complex multi-linked networks
title Optimal search strategies on complex multi-linked networks
title_full Optimal search strategies on complex multi-linked networks
title_fullStr Optimal search strategies on complex multi-linked networks
title_full_unstemmed Optimal search strategies on complex multi-linked networks
title_short Optimal search strategies on complex multi-linked networks
title_sort optimal search strategies on complex multi-linked networks
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4423499/
https://www.ncbi.nlm.nih.gov/pubmed/25950716
http://dx.doi.org/10.1038/srep09869
work_keys_str_mv AT dipattifrancesca optimalsearchstrategiesoncomplexmultilinkednetworks
AT fanelliduccio optimalsearchstrategiesoncomplexmultilinkednetworks
AT piazzafrancesco optimalsearchstrategiesoncomplexmultilinkednetworks