2011 International Conference on Advances in Social Networks Analysis and Mining 2011
DOI: 10.1109/asonam.2011.77
|View full text |Cite
|
Sign up to set email alerts
|

Community Detection in Dynamic Social Networks: A Random Walk Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…Community detection in dynamic networks [5] is a challenging task since such networks are multi-graphs and a pair of nodes can have links appearing or disappearing at different time points. Instability of link configurations leads to constant changes in graph partitions between slices of a multi-graph which make community detection difficult in dynamic networks.…”
Section: Figmentioning
confidence: 99%
“…Community detection in dynamic networks [5] is a challenging task since such networks are multi-graphs and a pair of nodes can have links appearing or disappearing at different time points. Instability of link configurations leads to constant changes in graph partitions between slices of a multi-graph which make community detection difficult in dynamic networks.…”
Section: Figmentioning
confidence: 99%