Demon: a local-first discovery method for overlapping communities
Community discovery in complex networks is an interesting problem with a number of
applications, especially in the knowledge extraction task in social and information networks …
applications, especially in the knowledge extraction task in social and information networks …
On random walk based graph sampling
Random walk based graph sampling has been recognized as a fundamental technique to
collect uniform node samples from a large graph. In this paper, we first present a …
collect uniform node samples from a large graph. In this paper, we first present a …
Walking on a graph with a magnifying glass: stratified sampling via weighted random walks
Our objective is to sample the node set of a large unknown graph via crawling, to accurately
estimate a given metric of interest. We design a random walk on an appropriately defined …
estimate a given metric of interest. We design a random walk on an appropriately defined …
A general framework for estimating graphlet statistics via random walk
Graphlets are induced subgraph patterns and have been frequently applied to characterize
the local topology structures of graphs across various domains, eg, online social networks …
the local topology structures of graphs across various domains, eg, online social networks …
{SEAL}: Storage-efficient causality analysis on enterprise logs with query-friendly compression
Causality analysis automates attack forensic and facilitates behavioral detection by
associating causally related but temporally distant system events. Despite its proven …
associating causally related but temporally distant system events. Despite its proven …
Efficiently estimating motif statistics of large networks
Exploring statistics of locally connected subgraph patterns (also known as network motifs)
has helped researchers better understand the structure and function of biological and Online …
has helped researchers better understand the structure and function of biological and Online …
Estimating clustering coefficients and size of social networks via random walk
SJ Hardiman, L Katzir - … of the 22nd international conference on World …, 2013 - dl.acm.org
Online social networks have become a major force in today's society and economy. The
largest of today's social networks may have hundreds of millions to more than a billion users …
largest of today's social networks may have hundreds of millions to more than a billion users …
Midas: Representative sampling from real-world hypergraphs
Graphs are widely used for representing pairwise interactions in complex systems. Since
such real-world graphs are large and often evergrowing, sampling a small representative …
such real-world graphs are large and often evergrowing, sampling a small representative …
Sampling online social networks
As online social networking emerges, there has been increased interest to utilize the
underlying network structure as well as the available information on social peers to improve …
underlying network structure as well as the available information on social peers to improve …
On estimating the average degree
Networks are characterized by nodes and edges. While there has been a spate of recent
work on estimating the number of nodes in a network, the edge-estimation question appears …
work on estimating the number of nodes in a network, the edge-estimation question appears …