Book ChapterDOI
Greedy approximation algorithms for finding dense components in a graph
Reads0
Chats0
TLDR
This paper gives simple greedy approximation algorithms for these optimization problems of finding subgraphs maximizing these notions of density for undirected and directed graphs and answers an open question about the complexity of the optimization problem for directed graphs.Abstract:
We study the problem of finding highly connected subgraphs of undirected and directed graphs. For undirected graphs, the notion of density of a subgraph we use is the average degree of the subgraph. For directed graphs, a corresponding notion of density was introduced recently by Kannan and Vinay. This is designed to quantify highly connectedness of substructures in a sparse directed graph such as the web graph. We study the optimization problems of finding subgraphs maximizing these notions of density for undirected and directed graphs. This paper gives simple greedy approximation algorithms for these optimization problems. We also answer an open question about the complexity of the optimization problem for directed graphs.read more
Citations
More filters
Journal ArticleDOI
A Study on Modularity Density Maximization: Column Generation Acceleration and Computational Complexity Analysis
TL;DR: Li et al. as mentioned in this paper reformulate the auxiliary problem to a sequence of $0$--$1$ linear programming problems, enabling them to compute its optimal value more efficiently and to get more diverse columns.
Posted Content
AugSplicing: Synchronized Behavior Detection in Streaming Tensors
TL;DR: This work proposes a fast streaming algorithm, AugSplicing, which can detect the top dense blocks by incrementally splicing the previous detection with the incoming ones in new tuples, avoiding re-runs over all the history data at every tracking time step.
Posted Content
An Optimal and Progressive Approach to Online Search of Top-k Important Communities.
TL;DR: This paper proposes an optimal online search algorithm LocalSearch whose time complexity is linearly proportional to the size of the smallest subgraph that a correct algorithm needs to access without index.
Journal ArticleDOI
Spade
TL;DR: In this paper , the authors introduce an incremental real-time fraud detection framework called Spade, which can detect fraudulent communities in hundreds of microseconds on million-scale graphs by incrementally maintaining dense subgraphs.
Proceedings ArticleDOI
A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications
Sara Ahmadian,Shahrzad Haddadan +1 more
TL;DR: Inspired by the concept of triadic closure, this paper proposed a probabilistic mechanism to model the evolution of these dynamic graphs and showed how to bound the growth rate of some characteristics of the graph, such as degree of vertices.
References
More filters
Proceedings ArticleDOI
Authoritative sources in a hyperlinked environment
TL;DR: This work proposes and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of \hub pages that join them together in the link structure, that has connections to the eigenvectors of certain matrices associated with the link graph.
Journal ArticleDOI
Trawling the Web for emerging cyber-communities
TL;DR: The subject of this paper is the systematic enumeration of over 100,000 emerging communities from a Web crawl, motivating a graph-theoretic approach to locating such communities, and describing the algorithms and algorithmic engineering necessary to find structures that subscribe to this notion.
Book ChapterDOI
The web as a graph: measurements, models, and methods
TL;DR: This paper describes two algorithms that operate on the Web graph, addressing problems from Web search and automatic community discovery, and proposes a new family of random graph models that point to a rich new sub-field of the study of random graphs, and raises questions about the analysis of graph algorithms on the Internet.
Proceedings ArticleDOI
Inferring Web communities from link topology
TL;DR: This investigation shows that although the process by which users of the Web create pages and links is very difficult to understand at a “local” level, it results in a much greater degree of orderly high-level structure than has typically been assumed.