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
Proceedings ArticleDOI
Detecting Cash-out Users via Dense Subgraphs
TL;DR: This paper develops ANTICO, a class of metrics to capture suspicious signals of the activities and a greedy algorithm to spot suspicious blocks by optimizing the proposed metric, and shows a provable upper bound of ANTico on the effectiveness of detecting cash-out users.
Journal ArticleDOI
Dense Sub-networks Discovery in Temporal Networks
TL;DR: In this paper, a heuristic based on the local search technique was proposed to identify dense subgraphs in a temporal network and the experimental results show that the heuristic provides mostly better solutions (denser solutions).
Posted Content
Exact recovery of Planted Cliques in Semi-random graphs.
TL;DR: An alternate SDP based rounding algorithm (with matching guarantees) for solving the Planted Clique problem in a random graph and is able to solve a special case of the D$k$SReg$(n, k, d, \delta, \gamma)$ model introduced in [KL20], when the planted subgraph $G[S]$ is a clique.
Journal ArticleDOI
K-Connected Cores Computation in Large Dual Networks
TL;DR: A k-connected core ($$k\text {-}CCO$$k-CCO) model in dual graphs is formulated and an index-based approach to efficiently answer the query for any given parameter k is proposed.
Proceedings Article
Towards an Expressive and Scalable Twitter's Users Profiles.
TL;DR: This paper proposes a scalable and extensible way of building content-based user profiles using a tractable algorithm to build user profiles out of their tweets, and presents a graph of terms cooccurency, driven by the fact that user sharing similar interests will share similar terms.
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.