Efficient sampling algorithms for approximate temporal motif counting

Efficient sampling algorithms for approximate temporal motif counting

A great variety of complex systems ranging from user interactions in communication networks to transactions in financial markets can be modeled as temporal graphs, which consist of a set of vertices and a series of timestamped and directed edges. Temporal motifs in temporal graphs are generalized fr...

Full description

Saved in:
Bibliographic Details
Main Authors: WANG, Jingjing, WANG, Yanhao, JIANG, Wenjun, LI, Yuchen, TAN, Kian-Lee
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2020
Subjects:
Temporal networks
Motif counting
Random sampling
Numerical Analysis and Scientific Computing
Theory and Algorithms
Online Access:https://ink.library.smu.edu.sg/sis_research/5934
https://ink.library.smu.edu.sg/context/sis_research/article/6937/viewcontent/3340531.3411862.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/5934
https://ink.library.smu.edu.sg/context/sis_research/article/6937/viewcontent/3340531.3411862.pdf

Similar Items