253 research outputs found
Consensus clustering in complex networks
The community structure of complex networks reveals both their organization
and hidden relationships among their constituents. Most community detection
methods currently available are not deterministic, and their results typically
depend on the specific random seeds, initial conditions and tie-break rules
adopted for their execution. Consensus clustering is used in data analysis to
generate stable results out of a set of partitions delivered by stochastic
methods. Here we show that consensus clustering can be combined with any
existing method in a self-consistent way, enhancing considerably both the
stability and the accuracy of the resulting partitions. This framework is also
particularly suitable to monitor the evolution of community structure in
temporal networks. An application of consensus clustering to a large citation
network of physics papers demonstrates its capability to keep track of the
birth, death and diversification of topics.Comment: 11 pages, 12 figures. Published in Scientific Report
Node-Centric Detection of Overlapping Communities in Social Networks
We present NECTAR, a community detection algorithm that generalizes Louvain
method's local search heuristic for overlapping community structures. NECTAR
chooses dynamically which objective function to optimize based on the network
on which it is invoked. Our experimental evaluation on both synthetic benchmark
graphs and real-world networks, based on ground-truth communities, shows that
NECTAR provides excellent results as compared with state of the art community
detection algorithms
Comparing and modeling land use organization in cities
The advent of geolocated ICT technologies opens the possibility of exploring
how people use space in cities, bringing an important new tool for urban
scientists and planners, especially for regions where data is scarce or not
available. Here we apply a functional network approach to determine land use
patterns from mobile phone records. The versatility of the method allows us to
run a systematic comparison between Spanish cities of various sizes. The method
detects four major land use types that correspond to different temporal
patterns. The proportion of these types, their spatial organization and scaling
show a strong similarity between all cities that breaks down at a very local
scale, where land use mixing is specific to each urban area. Finally, we
introduce a model inspired by Schelling's segregation, able to explain and
reproduce these results with simple interaction rules between different land
uses.Comment: 9 pages, 6 figures + Supplementary informatio
Fast community structure local uncovering by independent vertex-centred process
This paper addresses the task of community detection and proposes a local
approach based on a distributed list building, where each vertex broadcasts
basic information that only depends on its degree and that of its neighbours. A
decentralised external process then unveils the community structure. The
relevance of the proposed method is experimentally shown on both artificial and
real data.Comment: 2015 IEEE/ACM International Conference on Advances in Social Networks
Analysis and Mining, Aug 2015, Paris, France. Proceedings of the 2015
IEEE/ACM International Conference on Advances in Social Networks Analysis and
Minin
A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities
The hidden metric space behind complex network topologies is a fervid topic
in current network science and the hyperbolic space is one of the most studied,
because it seems associated to the structural organization of many real complex
systems. The Popularity-Similarity-Optimization (PSO) model simulates how
random geometric graphs grow in the hyperbolic space, reproducing strong
clustering and scale-free degree distribution, however it misses to reproduce
an important feature of real complex networks, which is the community
organization. The Geometrical-Preferential-Attachment (GPA) model was recently
developed to confer to the PSO also a community structure, which is obtained by
forcing different angular regions of the hyperbolic disk to have variable level
of attractiveness. However, the number and size of the communities cannot be
explicitly controlled in the GPA, which is a clear limitation for real
applications. Here, we introduce the nonuniform PSO (nPSO) model that,
differently from GPA, forces heterogeneous angular node attractiveness by
sampling the angular coordinates from a tailored nonuniform probability
distribution, for instance a mixture of Gaussians. The nPSO differs from GPA in
other three aspects: it allows to explicitly fix the number and size of
communities; it allows to tune their mixing property through the network
temperature; it is efficient to generate networks with high clustering. After
several tests we propose the nPSO as a valid and efficient model to generate
networks with communities in the hyperbolic space, which can be adopted as a
realistic benchmark for different tasks such as community detection and link
prediction
Communities and beyond: mesoscopic analysis of a large social network with complementary methods
Community detection methods have so far been tested mostly on small empirical
networks and on synthetic benchmarks. Much less is known about their
performance on large real-world networks, which nonetheless are a significant
target for application. We analyze the performance of three state-of-the-art
community detection methods by using them to identify communities in a large
social network constructed from mobile phone call records. We find that all
methods detect communities that are meaningful in some respects but fall short
in others, and that there often is a hierarchical relationship between
communities detected by different methods. Our results suggest that community
detection methods could be useful in studying the general mesoscale structure
of networks, as opposed to only trying to identify dense structures.Comment: 11 pages, 10 figures. V2: typos corrected, one sentence added. V3:
revised version, Appendix added. V4: final published versio
- …