Reliable Community Search in Dynamic Networks

by   Yifu Tang, et al.

Local community search is an important research topic to support complex network data analysis in various scenarios like social networks, collaboration networks, and cellular networks. The evolution of networks over time has motivated several recent studies to identify local communities from dynamic networks. However, they only utilized the aggregation of disjoint structural information to measure the quality of communities, which ignores the reliability of communities in a continuous time interval. To fill this research gap, we propose a novel (θ,k)-core reliable community (CRC) model in the weighted dynamic networks, and define the problem of the most reliable community search that couples the desirable properties of connection strength, cohesive structure continuity, and the maximal member engagement. To solve this problem, we first develop an online CRC search algorithm by proposing a definition of eligible edge set and deriving the eligible edge set based pruning rules. that, we devise a Weighted Core Forest-Index and index-based dynamic programming CRC search algorithm, which can prune a large number of insignificant intermediate results according to the maintained weight and structure information in the index, as well as the proposed upper bound properties. Finally, we conduct extensive experiments to verify the efficiency of our proposed algorithms and the effectiveness of our proposed community model on eight real datasets under different parameter settings.


page 3

page 4

page 5

page 6

page 7

page 8

page 10

page 13


CS-TGN: Community Search via Temporal Graph Neural Networks

Searching for local communities is an important research challenge that ...

Topic-based Community Search over Spatial-Social Networks (Technical Report)

Recently, the community search problem has attracted significant attenti...

Parameter-free Structural Diversity Search

The problem of structural diversity search is to nd the top-k vertices w...

Truss-based Structural Diversity Search in Large Graphs

Social decisions made by individuals are easily influenced by informatio...

An Optimal and Progressive Approach to Online Search of Top-k Influential Communities

Community search over large graphs is a fundamental problem in graph ana...

Top-k Community Similarity Search Over Large-Scale Road Networks (Technical Report)

With the urbanization and development of infrastructure, the community s...

Constant State of Change: Engagement Inequality in Temporal Dynamic Networks

The temporal changes in complex systems of interactions have excited the...

Please sign up or login with your details

Forgot password? Click here to reset