activity
20012025
most citedAre randomly grown graphs really random?

453 citations · 1.5k across the 44 of their papers we have counts for

collaborators
Showing cs.SIShow all

12 papers · 1 filter

cs.SI2022

HoSIM: Higher-order Structural Importance based Method for Multiple Local Community Detection

Boyu Li, Meng Wang, John E. Hopcroft +1

Local community detection has attracted much research attention recently, and many methods have been proposed for the single local community detection that finds a community contai…

cs.SI2021

Uncovering the Local Hidden Community Structure in Social Networks

Meng Wang, Boyu Li, Kun He +1

Hidden community is a useful concept proposed recently for social network analysis. To handle the rapid growth of network scale, in this work, we explore the detection of hidden co…

cs.SI2021

Structure Amplification on Multi-layer Stochastic Block Models

Xiaodong Xin, Kun He, Jialu Bao +2

Much of the complexity of social, biological, and engineered systems arises from a network of complex interactions connecting many basic components. Network analysis tools have bee…

cs.SI2020

Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Perspective

Jialu Bao, Kun He, Xiaodong Xin +2

Hidden community is a new graph-theoretical concept recently proposed [4], in which the authors also propose a meta-approach called HICODE (Hidden Community Detection) for detectin…

cs.SI2017★ 1 cited

Krylov Subspace Approximation for Local Community Detection in Large Networks

Kun He, Pan Shi, David Bindel +1

Community detection is an important information mining task to uncover modular structures in large networks. For increasingly common large network data sets, global community detec…

cs.SI2017★ 2 cited

Hidden Community Detection in Social Networks

Kun He, Yingru Li, Sucheta Soundarajan +1

We introduce a new paradigm that is important for community detection in the realm of network analysis. Networks contain a set of strong, dominant communities, which interfere with…

cs.SI2016★ 33 cited

In a World That Counts: Clustering and Detecting Fake Social Engagement at Scale

Yixuan Li, Oscar Martinez, Xing Chen +2

How can web services that depend on user generated content discern fake social engagement activities by spammers from legitimate ones? In this paper, we focus on the social site of…

cs.SI2015

The Lifecycle and Cascade of WeChat Social Messaging Groups

Jiezhong Qiu, Yixuan Li, Jie Tang +5

Social instant messaging services are emerging as a transformative form with which people connect, communicate with friends in their daily life - they catalyze the formation of soc…

cs.SI2015★ 18 cited

Detecting Overlapping Communities from Local Spectral Subspaces

Kun He, Yiwei Sun, David Bindel +2

Based on the definition of local spectral subspace, we propose a novel approach called LOSP for local overlapping community detection. Instead of using the invariant subspace spann…

cs.SI2015★ 6 cited

Overlapping Community Detection via Local Spectral Clustering

Yixuan Li, Kun He, David Bindel +1

Large graphs arise in a number of contexts and understanding their structure and extracting information from them is an important research area. Early algorithms on mining communit…

cs.SI2015★ 27 cited

Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach

Yixuan Li, Kun He, David Bindel +1

Large graphs arise in a number of contexts and understanding their structure and extracting information from them is an important research area. Early algorithms on mining communit…

cs.SI2015★ 27 cited

Revealing Multiple Layers of Hidden Community Structure in Networks

Kun He, Sucheta Soundarajan, Xuezhi Cao +2

We introduce a new conception of community structure, which we refer to as hidden community structure. Hidden community structure refers to a specific type of overlapping community…