More is different in real-world multilayer networks

M De Domenico - Nature Physics, 2023 - nature.com
The constituents of many complex systems are characterized by non-trivial connectivity
patterns and dynamical processes that are well captured by network models. However, most …

[HTML][HTML] Modern temporal network theory: a colloquium

P Holme - The European Physical Journal B, 2015 - Springer
The power of any kind of network approach lies in the ability to simplify a complex system so
that one can better understand its function as a whole. Sometimes it is beneficial, however …

Stream graphs and link streams for the modeling of interactions over time

M Latapy, T Viard, C Magnien - Social Network Analysis and Mining, 2018 - Springer
Graph theory provides a language for studying the structure of relations, and it is often used
to study interactions over time too. However, it poorly captures the intrinsically temporal and …

[图书][B] A guide to temporal networks

N Masuda, R Lambiotte - 2016 - World Scientific
A network is a collection of nodes and edges, where an edge connects two nodes. Many
social, natural and engineered systems can be represented as networks. Examples include …

Path problems in temporal graphs

H Wu, J Cheng, S Huang, Y Ke, Y Lu, Y Xu - Proceedings of the VLDB …, 2014 - dl.acm.org
Shortest path is a fundamental graph problem with numerous applications. However, the
concept of classic shortest path is insufficient or even flawed in a temporal graph, as the …

Graph metrics for temporal networks

V Nicosia, J Tang, C Mascolo, M Musolesi, G Russo… - Temporal networks, 2013 - Springer
Temporal networks, ie, networks in which the interactions among a set of elementary units
change over time, can be modelled in terms of time-varying graphs, which are time-ordered …

Social networks–the future for health care delivery

F Griffiths, J Cave, F Boardman, J Ren… - Social science & …, 2012 - Elsevier
With the rapid growth of online social networking for health, health care systems are
experiencing an inescapable increase in complexity. This is not necessarily a drawback; self …

[HTML][HTML] Time-dependent graphs: Definitions, applications, and algorithms

Y Wang, Y Yuan, Y Ma, G Wang - Data Science and Engineering, 2019 - Springer
A time-dependent graph is, informally speaking, a graph structure dynamically changes with
time. In such graphs, the weights associated with edges dynamically change over time, that …

Random walks on temporal networks

M Starnini, A Baronchelli, A Barrat… - Physical Review E …, 2012 - APS
Many natural and artificial networks evolve in time. Nodes and connections appear and
disappear at various time scales, and their dynamics has profound consequences for any …

Efficient algorithms for temporal path computation

H Wu, J Cheng, Y Ke, S Huang… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
Shortest path is a fundamental graph problem with numerous applications. However, the
concept of classic shortest path is insufficient. In this paper, we study various concepts of …