The stability of a graph partition: A dynamics-based framework for community detection
نویسندگان
چکیده
1 Institute of Information and Communication Technologies, Electronics and Applied Mathematics (ICTEAM) and Center for Operations Research and Optimisation (CORE), Université catholique de Louvain, Louvain-la-Neuve, Belgium 2 Namur Center for Complex Systems (naXys), Facultés Universitaires Notre-Dame de la Paix, Namur, Belgium 3 Department of Chemistry, Imperial College London, London, United Kingdom 4 Department of Mathematics, Imperial College London, London, United Kingdom [email protected], [email protected], [email protected], [email protected]
منابع مشابه
An Optimized Firefly Algorithm based on Cellular Learning Automata for Community Detection in Social Networks
The structure of the community is one of the important features of social networks. A community is a sub graph which nodes have a lot of connections to nodes of inside the community and have very few connections to nodes of outside the community. The objective of community detection is to separate groups or communities that are linked more closely. In fact, community detection is the clustering...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملDesign of a Novel Framework to Control Nonlinear Affine Systems Based on Fast Terminal Sliding-Mode Controller
In this paper, a novel approach for finite-time stabilization of uncertain affine systems is proposed. In the proposed approach, a fast terminal sliding mode (FTSM) controller is designed, based on the input-output feedback linearization of the nonlinear system with considering its internal dynamics. One of the main advantages of the proposed approach is that only the outputs and external state...
متن کاملs . so c - ph ] 4 M ar 2 00 9 Laplacian Dynamics and Multiscale Modular Structure in Networks
Most methods proposed to uncover communities in complex networks rely on their structural properties. Here we introduce the stability of a network partition, a measure of its quality defined in terms of the statistical properties of a dynamical process taking place on the graph. The timescale of the process acts as an intrinsic parameter that uncovers community structures at different resolutio...
متن کاملGeometric Multiscale Community Detection: Markov Stability and Vector Partitioning
Multiscale community detection can be viewed from a dynamical perspective within the Markov Stability framework, which uses the diffusion of a Markov process on the graph to uncover intrinsic network substructures across all scales. Here we reformulate multiscale community detection as a max-sum length vector partitioning problem with respect to the set of time-dependent node vectors expressed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1308.1605 شماره
صفحات -
تاریخ انتشار 2013