Truss-based Structural Diversity Search in Large Graphs

by   Jinbin Huang, et al.

Social decisions made by individuals are easily influenced by information from their social neighborhoods. A key predictor of social contagion is the multiplicity of social contexts inside the individual's contact neighborhood, which is termed structural diversity. However, the existing models have limited decomposability for analyzing large-scale networks, and suffer from the inaccurate reflection of social context diversity. In this paper, we propose a new truss-based structural diversity model to overcome the weak decomposability. Based on this model, we study a novel problem of truss-based structural diversity search in a graph G, that is, to find the r vertices with the highest truss-based structural diversity and return their social contexts. o tackle this problem, we propose an online structural diversity search algorithm in O(ρ(m+𝒯)) time, where ρ, m, and 𝒯 are respectively the arboricity, the number of edges, and the number of triangles in G. To improve the efficiency, we design an elegant and compact index, called TSD-index, for further expediting the search process. We further optimize the structure of TSD-index into a highly compressed GCT-index. Our GCT-index-based structural diversity search utilizes the global triangle information for fast index construction and finds answers in O(m) time. Extensive experiments demonstrate the effectiveness and efficiency of our proposed model and algorithms, against state-of-the-art methods.



There are no comments yet.


page 15

page 17


Parameter-free Structural Diversity Search

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

Reliable Community Search in Dynamic Networks

Local community search is an important research topic to support complex...

NEW: A Generic Learning Model for Tie Strength Prediction in Networks

Tie strength prediction, sometimes named weight prediction, is vital in ...

Diversifying Multi-aspect Search Results Using Simpson's Diversity Index

In search and recommendation, diversifying the multi-aspect search resul...

A compressed dynamic self-index for highly repetitive text collections

We present a novel compressed dynamic self-index for highly repetitive t...

Accurate and Fast Retrieval for Complex Non-metric Data via Neighborhood Graphs

We demonstrate that a graph-based search algorithm-relying on the constr...

Finding Effective Geo-Social Group for Impromptu Activity with Multiple Demands

Geo-social group search aims to find a group of people proximate to a lo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.