Identifying communities by influence dynamics in social networks

@article{Stanoev2011IdentifyingCB,
  title={Identifying communities by influence dynamics in social networks},
  author={Angel Stanoev and Daniel Smilkov and Ljupco Kocarev},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2011},
  volume={84 4 Pt 2},
  pages={
          046102
        }
}
Communities are not static; they evolve, split and merge, appear and disappear, i.e., they are the product of dynamical processes that govern the evolution of a network. A good algorithm for community detection should not only quantify the topology of the network but incorporate the dynamical processes that take place on the network. We present an algorithm for community detection that combines network structure with processes that support the creation and/or evolution of communities. The… Expand
Dynamics of Overlapping Community Structures with Application to Expert Identification
TLDR
A two-phase algorithm based on two significant rather simple social dynamics named Disassortative degree Mixing and Information Diffusion is proposed—this algorithm is called DMID and results indicate that DMID competitively wins in several cases over the baselines in the community prediction problem. Expand
Detection and analysis of overlapping community structures for modelling and prediction in complex networks
TLDR
This dissertation proposes overlapping community detection algorithms that use properties such as degree mixing and information diffusion and builds prediction models for the evolution of overlapping communities, showing the importance of overlapping community structures in the prediction of mixing patterns in networks. Expand
Investigating Cooperativity of Overlapping Community Structures in Social Networks
TLDR
This paper calculates the amount of cooperativity in the corresponding networks and communities of these domains of open source software projects and learning forums by applying several community detection algorithms and investigates the community properties, which can be used to infer cooperativity of community structures from their respective properties. Expand
The Significant Effect of Overlapping Community Structures in Signed Social Networks
TLDR
A two-phase approach to discover overlapping communities in signed networks by identifying most influential nodes (leaders) in the network using network coordination game, and results indicate that overlapping nodes competitively predict signs in comparison to intra and extra nodes. Expand
Network Communities of Dynamical Influence
TLDR
In applying this technique, the effectiveness of starling flocks was found to be due, in part, to the low outdegree of every bird, where increasing the number of outgoing connections can produce a less responsive flock. Expand
Detecting hierarchical structure of community members in social networks
TLDR
This work proposes a novel structure to dig finer information by partitioning the members into several levels according to their belonging coefficients, and calls it Hierarchical Structure of Members (HSM), which reveals the multi-resolution of community as well as the intra-relations among members. Expand
Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality
TLDR
This work combines eigenvector centrality with clustering to design a mathematical programming formulation capable of detecting key members while preventing their spheres of influence from overlapping. Expand
Using Content to Identify Overlapping Communities in Question Answer Forums
TLDR
This paper proposes an algorithm that uses actual content produced by users and combines them by an extended clustering technique, which reveals community properties as well as its relation to contextual information. Expand
Feature Analysis and Modeling of the Network Community Structure
TLDR
A community detection algorithm, which has linear time complexity, is proposed based on this constraint model, a proposed node similarity model and the Modularity Q, which is effective to identify the communities. Expand
Disassortative Degree Mixing and Information Diffusion for Overlapping Community Detection in Social Networks (DMID)
TLDR
A new two-phase algorithm for overlapping community detection (OCD) in social networks, implemented as a Web service on a federated peer-to-peer infrastructure and demonstrated the correct identification of leaders, high precision and good time complexity. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 43 REFERENCES
Quantifying social group evolution
TLDR
The focus is on networks capturing the collaboration between scientists and the calls between mobile phone users, and it is found that large groups persist for longer if they are capable of dynamically altering their membership, suggesting that an ability to change the group composition results in better adaptability. Expand
Link communities reveal multiscale complexity in networks
TLDR
It is implied that link communities are fundamental building blocks that reveal overlap and hierarchical organization in networks to be two aspects of the same phenomenon. Expand
Finding and evaluating community structure in networks.
  • M. Newman, M. Girvan
  • Computer Science, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems. Expand
Uncovering the overlapping community structure of complex networks in nature and society
TLDR
After defining a set of new characteristic quantities for the statistics of communities, this work applies an efficient technique for exploring overlapping communities on a large scale and finds that overlaps are significant, and the distributions introduced reveal universal features of networks. Expand
Modularity and community structure in networks.
  • M. Newman
  • Physics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 2006
TLDR
It is shown that the modularity of a network can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which is called modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times. Expand
Dynamics of large networks
TLDR
This thesis analyzes the world's largest social and communication network of Microsoft Instant Messenger with 240 million people and 255 billion conversations and makes interesting and counterintuitive observations about network community structure that suggest that only small network clusters exist, and that they merge and vanish as they grow. Expand
Community detection in graphs
TLDR
A thorough exposition of community structure, or clustering, is attempted, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists. Expand
Finding community structure in very large networks.
TLDR
A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure. Expand
Resolution limit in community detection
TLDR
It is found that modularity optimization may fail to identify modules smaller than a scale which depends on the total size of the network and on the degree of interconnectedness of the modules, even in cases where modules are unambiguously defined. Expand
Hierarchical structure and the prediction of missing links in networks
TLDR
This work presents a general technique for inferring hierarchical structure from network data and shows that the existence of hierarchy can simultaneously explain and quantitatively reproduce many commonly observed topological properties of networks. Expand
...
1
2
3
4
5
...