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

Enrico Ser-Giacomi, Ruggero Vasile, Emilio Hernández-García, and Cristóbal López
Phys. Rev. E 92, 012818 – Published 27 July 2015

Abstract

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.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 25 November 2014

DOI:https://doi.org/10.1103/PhysRevE.92.012818

©2015 American Physical Society

Authors & Affiliations

Enrico Ser-Giacomi1, Ruggero Vasile1,2, Emilio Hernández-García1, and Cristóbal López1

  • 1IFISC, Instituto de Física Interdisciplinar y Sistemas Complejos (CSIC-UIB), E-07122 Palma de Mallorca, Spain
  • 2Ambrosys GmbH, Albert-Einstein-Strasse 1-5, 14473 Potsdam, Germany

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 92, Iss. 1 — July 2015

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×