Community discovery in dynamic networks: a survey

G Rossetti, R Cazabet - ACM computing surveys (CSUR), 2018 - dl.acm.org
Several research studies have shown that complex networks modeling real-world
phenomena are characterized by striking properties:(i) they are organized according to …

A survey on embedding dynamic graphs

CDT Barros, MRF Mendonça, AB Vieira… - ACM Computing Surveys …, 2021 - dl.acm.org
Embedding static graphs in low-dimensional vector spaces plays a key role in network
analytics and inference, supporting applications like node classification, link prediction, and …

[HTML][HTML] Temporal properties of higher-order interactions in social networks

G Cencetti, F Battiston, B Lepri, M Karsai - Scientific reports, 2021 - nature.com
Human social interactions in local settings can be experimentally detected by recording the
physical proximity and orientation of people. Such interactions, approximating face-to-face …

[图书][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 …

[HTML][HTML] Finding temporal paths under waiting time constraints

A Casteigts, AS Himmel, H Molter, P Zschoche - Algorithmica, 2021 - Springer
Computing a (short) path between two vertices is one of the most fundamental primitives in
graph algorithmics. In recent years, the study of paths in temporal graphs, that is, graphs …

Consensus dynamics on temporal hypergraphs

L Neuhäuser, R Lambiotte, MT Schaub - Physical Review E, 2021 - APS
We investigate consensus dynamics on temporal hypergraphs that encode network systems
with time-dependent, multiway interactions. We compare these consensus processes with …

Influential nodes detection in dynamic social networks: A survey

N Hafiene, W Karoui, LB Romdhane - Expert Systems with Applications, 2020 - Elsevier
The influence maximization problem has gained increasing attention in recent years.
Previous research focuses on the development of algorithms to analyze static social …

Analyzing dynamic hypergraphs with parallel aggregated ordered hypergraph visualization

P Valdivia, P Buono, C Plaisant… - IEEE transactions on …, 2019 - ieeexplore.ieee.org
Parallel Aggregated Ordered Hypergraph (PAOH) is a novel technique to visualize dynamic
hypergraphs. Hypergraphs are a generalization of graphs where edges can connect several …

Randomized reference models for temporal networks

L Gauvin, M Génois, M Karsai, M Kivelä, T Takaguchi… - SIAM Review, 2022 - SIAM
Many dynamical systems can be successfully analyzed by representing them as networks.
Empirically measured networks and dynamic processes that take place in these situations …

[HTML][HTML] The complexity of finding small separators in temporal graphs

P Zschoche, T Fluschnik, H Molter… - Journal of Computer and …, 2020 - Elsevier
Temporal graphs have time-stamped edges. Building on previous work, we study the
problem of finding a small vertex set (the separator) whose removal destroys all temporal …