English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/132857
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

Most probable paths in temporal weighted networks: An application to ocean transport

AuthorsSer-Giacomi, Enrico ; Vasile, Ruggero ; Hernández-García, Emilio ; López, Cristóbal
Issue Date27-Jul-2015
PublisherAmerican Physical Society
CitationPhysical Review E 92(1): 012818 (2015)
Abstract© 2015 American Physical Society. We consider paths in weighted and directed temporal networks, introducing tools to compute sets of paths of high probability. We quantify the relative importance of the most probable path between two nodes with respect to the whole set of paths and to a subset of highly probable paths that incorporate most of the connection probability. These concepts are used to provide alternative definitions of betweenness centrality. We apply our formalism to a transport network describing surface flow in the Mediterranean sea. Despite the full transport dynamics is described by a very large number of paths we find that, for realistic time scales, only a very small subset of high probability paths (or even a single most probable one) is enough to characterize global connectivity properties of the network.
Publisher version (URL)http://dx.doi.org/10.1103/PhysRevE.92.012818
URIhttp://hdl.handle.net/10261/132857
DOI10.1103/PhysRevE.92.012818
Identifierse-issn: 1550-2376
issn: 1539-3755
Appears in Collections:(IFISC) Artículos
Files in This Item:
File Description SizeFormat 
weighted_networks_Ser.pdf849,32 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.