2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | G.1.6 | ||
| Paper Title | Temporal Ordered Clustering in Dynamic Networks | ||
| Authors | Krzysztof Turowski, Jagiellonian University, Poland; Jithin Sreedharan, Wojciech Szpankowski, Purdue University, United States | ||
| Session | G.1: Graph Analytics | ||
| Presentation | Lecture | ||
| Track | Graphs, Games, Sparsity, and Signal Processing | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract |
Given a single snapshot of a dynamic network in which nodes arrived at distinct time instants along with edges, we aim at inferring a partial order $\sigma$ between the node pairs such that $u <_{\sigma}v$ indicates node $u$ arrived earlier than node $v$ in the graph. The inferred partial order can be deduced to a natural clustering of the nodes into $K$ ordered clusters $\C_1 \prec \cdots \prec \C_K$ such that for $i | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
