51,838 research outputs found
Fast Detection of Community Structures using Graph Traversal in Social Networks
Finding community structures in social networks is considered to be a
challenging task as many of the proposed algorithms are computationally
expensive and does not scale well for large graphs. Most of the community
detection algorithms proposed till date are unsuitable for applications that
would require detection of communities in real-time, especially for massive
networks. The Louvain method, which uses modularity maximization to detect
clusters, is usually considered to be one of the fastest community detection
algorithms even without any provable bound on its running time. We propose a
novel graph traversal-based community detection framework, which not only runs
faster than the Louvain method but also generates clusters of better quality
for most of the benchmark datasets. We show that our algorithms run in O(|V | +
|E|) time to create an initial cover before using modularity maximization to
get the final cover.
Keywords - community detection; Influenced Neighbor Score; brokers; community
nodes; communitiesComment: 29 pages, 9 tables, and 13 figures. Accepted in "Knowledge and
Information Systems", 201
Detecting Community Structure in Dynamic Social Networks Using the Concept of Leadership
Detecting community structure in social networks is a fundamental problem
empowering us to identify groups of actors with similar interests. There have
been extensive works focusing on finding communities in static networks,
however, in reality, due to dynamic nature of social networks, they are
evolving continuously. Ignoring the dynamic aspect of social networks, neither
allows us to capture evolutionary behavior of the network nor to predict the
future status of individuals. Aside from being dynamic, another significant
characteristic of real-world social networks is the presence of leaders, i.e.
nodes with high degree centrality having a high attraction to absorb other
members and hence to form a local community. In this paper, we devised an
efficient method to incrementally detect communities in highly dynamic social
networks using the intuitive idea of importance and persistence of community
leaders over time. Our proposed method is able to find new communities based on
the previous structure of the network without recomputing them from scratch.
This unique feature, enables us to efficiently detect and track communities
over time rapidly. Experimental results on the synthetic and real-world social
networks demonstrate that our method is both effective and efficient in
discovering communities in dynamic social networks
Immunization of networks with community structure
In this study, an efficient method to immunize modular networks (i.e.,
networks with community structure) is proposed. The immunization of networks
aims at fragmenting networks into small parts with a small number of removed
nodes. Its applications include prevention of epidemic spreading, intentional
attacks on networks, and conservation of ecosystems. Although preferential
immunization of hubs is efficient, good immunization strategies for modular
networks have not been established. On the basis of an immunization strategy
based on the eigenvector centrality, we develop an analytical framework for
immunizing modular networks. To this end, we quantify the contribution of each
node to the connectivity in a coarse-grained network among modules. We verify
the effectiveness of the proposed method by applying it to model and real
networks with modular structure.Comment: 3 figures, 1 tabl
A Unified Community Detection, Visualization and Analysis method
Community detection in social graphs has attracted researchers' interest for
a long time. With the widespread of social networks on the Internet it has
recently become an important research domain. Most contributions focus upon the
definition of algorithms for optimizing the so-called modularity function. In
the first place interest was limited to unipartite graph inputs and partitioned
community outputs. Recently bipartite graphs, directed graphs and overlapping
communities have been investigated. Few contributions embrace at the same time
the three types of nodes. In this paper we present a method which unifies
commmunity detection for the three types of nodes and at the same time merges
partitionned and overlapping communities. Moreover results are visualized in
such a way that they can be analyzed and semantically interpreted. For
validation we experiment this method on well known simple benchmarks. It is
then applied to real data in three cases. In two examples of photos sets with
tagged people we reveal social networks. A second type of application is of
particularly interest. After applying our method to Human Brain Tractography
Data provided by a team of neurologists, we produce clusters of white fibers in
accordance with other well known clustering methods. Moreover our approach for
visualizing overlapping clusters allows better understanding of the results by
the neurologist team. These last results open up the possibility of applying
community detection methods in other domains such as data analysis with
original enhanced performances.Comment: Submitted to Advances in Complex System
Uncovering nodes that spread information between communities in social networks
From many datasets gathered in online social networks, well defined community
structures have been observed. A large number of users participate in these
networks and the size of the resulting graphs poses computational challenges.
There is a particular demand in identifying the nodes responsible for
information flow between communities; for example, in temporal Twitter networks
edges between communities play a key role in propagating spikes of activity
when the connectivity between communities is sparse and few edges exist between
different clusters of nodes. The new algorithm proposed here is aimed at
revealing these key connections by measuring a node's vicinity to nodes of
another community. We look at the nodes which have edges in more than one
community and the locality of nodes around them which influence the information
received and broadcasted to them. The method relies on independent random walks
of a chosen fixed number of steps, originating from nodes with edges in more
than one community. For the large networks that we have in mind, existing
measures such as betweenness centrality are difficult to compute, even with
recent methods that approximate the large number of operations required. We
therefore design an algorithm that scales up to the demand of current big data
requirements and has the ability to harness parallel processing capabilities.
The new algorithm is illustrated on synthetic data, where results can be judged
carefully, and also on a real, large scale Twitter activity data, where new
insights can be gained
- …