The densest subgraph problem in sparse random graphs
نویسندگان
چکیده
We determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular to the Erdős-Rényi model, where it settles a conjecture of Hajek (1990). Our proof consists in extending the notion of balanced loads from finite graphs to their local weak limits, using unimodularity. This is a new illustration of the objective method described by Aldous and Steele (2004).
منابع مشابه
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
We investigate the computational complexity of the Densest k-Subgraph problem, where the input is an undirected graph G = (V,E) and one wants to find a subgraph on exactly k vertices with the maximum number of edges. We extend previous work on Densest k-Subgraph by studying its parameterized complexity for parameters describing the sparseness of the input graph and for parameters related to the...
متن کاملDense Subgraphs on Dynamic Networks
In distributed networks, it is often useful for the nodes to be aware of dense subgraphs, e.g., such a dense subgraph could reveal dense subtructures in otherwise sparse graphs (e.g. the World Wide Web or social networks); these might reveal community clusters or dense regions for possibly maintaining good communication infrastructure. In this work, we address the problem of self-awareness of n...
متن کاملApproximation schemes, cliques, colors and densest subgraphs
In this thesis we study the problem of finding the densest k-subgraph of a given graph G = (V, E). We present algorithms of polynomial time as well as approximation results on special graph classes. Analytically, we study polynomial time algorithms for the densest k-subgraph problem on weighted graphs of maximal degree two, on weighted trees even if the solution is disconnected, and on interval...
متن کاملRobust convex relaxation for the planted clique and densest k-subgraph problems
We consider the problem of identifying the densest k-node subgraph in a given graph. We write this problem as an instance of rank-constrained cardinality minimization and then relax using the nuclear and `1 norms. Although the original combinatorial problem is NP-hard, we show that the densest k-subgraph can be recovered from the solution of our convex relaxation for certain program inputs. In ...
متن کاملThe Densest k-Subhypergraph Problem
The Densest k-Subgraph (DkS) problem, and its corresponding minimization problem Smallest p-Edge Subgraph (SpES), have come to play a central role in approximation algorithms. This is due both to their practical importance, and their usefulness as a tool for solving and establishing approximation bounds for other problems. These two problems are not well understood, and it is widely believed th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1312.4494 شماره
صفحات -
تاریخ انتشار 2013