z-logo
open-access-imgOpen Access
Metric projection for dynamic multiplex networks
Author(s) -
Giuseppe Jurman
Publication year - 2016
Publication title -
heliyon
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.455
H-Index - 28
ISSN - 2405-8440
DOI - 10.1016/j.heliyon.2016.e00136
Subject(s) - multiplex , computer science , metric (unit) , series (stratigraphy) , graph , simple (philosophy) , complex network , projection (relational algebra) , theoretical computer science , data mining , algorithm , engineering , epistemology , paleontology , world wide web , operations management , biology , philosophy , bioinformatics
Evolving multiplex networks are a powerful model for representing the dynamics along time of different phenomena, such as social networks, power grids, biological pathways. However, exploring the structure of the multiplex network time series is still an open problem. Here we propose a two-step strategy to tackle this problem based on the concept of distance (metric) between networks. Given a multiplex graph, first a network of networks is built for each time step, and then a real valued time series is obtained by the sequence of (simple) networks by evaluating the distance from the first element of the series. The effectiveness of this approach in detecting the occurring changes along the original time series is shown on a synthetic example first, and then on the Gulf dataset of political events.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom