Criterions for locally dense subgraphs
نویسنده
چکیده
Community detection is one of the most investigated problems in the field of complex networks. Although several methods were proposed, there is still no precise definition of communities. As a step towards a definition, I highlight two necessary properties of communities, separation and internal cohesion, the latter being a new concept. I propose a local method of community detection based on two-dimensional local optimization, which I tested on common benchmarks and on the word association database.
منابع مشابه
Topological number for locally convex topological spaces with continuous semi-norms
In this paper we introduce the concept of topological number for locally convex topological spaces and prove some of its properties. It gives some criterions to study locally convex topological spaces in a discrete approach.
متن کاملLocal Density Sven
We survey computational approaches and solutions for discovering locally dense groups in social and complex networks. A graph-theoretical property is local if it is definable over subgraphs induced by the groups only. In this context, we discuss perfectly dense groups (cliques), structurally dense groups (plexes, cores), and statistically dense groups (η-dense groups). We give algorithms (and h...
متن کاملOptimally Local Dense Conditions for the Existence of Solutions for Vector Equilibrium Problems
In this paper, by using C-sequentially sign property for bifunctions, we provide sufficient conditions that ensure the existence of solutions of some vector equilibrium problems in Hausdorff topological vector spaces which ordered by a cone. The conditions which we consider are not imposed on the whole domain of the operators involved, but just on a locally segment-dense subset of the domain.
متن کاملDiscovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extremely efficient, capable of handling graphs with tens of billions of edges on a single machine with modest resources. We apply our algorithm to characterize the large, dense subgraphs of a graph showing connections between ...
متن کاملFast Hierarchy Construction for Dense Subgraphs
Discovering dense subgraphs and understanding the relations among them is a fundamental problem in graph mining. We want to not only identify dense subgraphs, but also build a hierarchy among them (e.g., larger but sparser subgraphs formed by two smaller dense subgraphs). Peeling algorithms (k-core, k-truss, and nucleus decomposition) have been effective to locate many dense subgraphs. However,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1103.3397 شماره
صفحات -
تاریخ انتشار 2011