164 research outputs found
Community Detection via Semi-Synchronous Label Propagation Algorithms
A recently introduced novel community detection strategy is based on a label
propagation algorithm (LPA) which uses the diffusion of information in the
network to identify communities. Studies of LPAs showed that the strategy is
effective in finding a good community structure. Label propagation step can be
performed in parallel on all nodes (synchronous model) or sequentially
(asynchronous model); both models present some drawback, e.g., algorithm
termination is nor granted in the first case, performances can be worst in the
second case. In this paper, we present a semi-synchronous version of LPA which
aims to combine the advantages of both synchronous and asynchronous models. We
prove that our models always converge to a stable labeling. Moreover, we
experimentally investigate the effectiveness of the proposed strategy comparing
its performance with the asynchronous model both in terms of quality,
efficiency and stability. Tests show that the proposed protocol does not harm
the quality of the partitioning. Moreover it is quite efficient; each
propagation step is extremely parallelizable and it is more stable than the
asynchronous model, thanks to the fact that only a small amount of
randomization is used by our proposal.Comment: In Proc. of The International Workshop on Business Applications of
Social Network Analysis (BASNA '10
Speeding up Networks Mining via Neighborhood Diversity
Parameterized complexity was classically used to efficiently solve NP-hard problems for small values of a fixed parameter. Then it has also been used as a tool to speed up algorithms for tractable problems. Following this line of research, we design algorithms parameterized by neighborhood diversity (nd) for several graph theoretic problems in P (e.g., Maximum Matching, Triangle counting and listing, Girth and Global minimum vertex cut). Such problems are known to admit algorithms parameterized by modular-width (mw) and consequently - being the nd a "special case" of mw - by nd. However, the proposed novel algorithms allow to improve the computational complexity from a time O(f(mw)? n +m) - where n and m denote, respectively, the number of vertices and edges in the input graph - which is multiplicative in n to a time O(g(nd)+n +m) which is additive only in the size of the input
Distributed simulation optimization and parameter exploration framework for the cloud
Simulation models are becoming an increasingly popular tool for the analysis and optimization of complex real systems in different fields. Finding an optimal system design requires performing a large sweep over the parameter space in an organized way. Hence, the model optimization process is extremely demanding from a computational point of view, as it requires careful, time-consuming, complex orchestration of coordinated executions. In this paper, we present the design of SOF (Simulation Optimization and exploration Framework in the cloud), a framework which exploits the computing power of a cloud computational environment in order to carry out effective and efficient simulation optimization strategies. SOF offers several attractive features. Firstly, SOF requires “zero configuration” as it does not require any additional software installed on the remote node; only standard Apache Hadoop and SSH access are sufficient. Secondly, SOF is transparent to the user, since the user is totally unaware that the system operates on a distributed environment. Finally, SOF is highly customizable and programmable, since it enables the running of different simulation optimization scenarios using diverse programming languages – provided that the hosting platform supports them – and different simulation toolkits, as developed by the modeler. The tool has been fully developed and is available on a public repository1 under the terms of the open source Apache License. It has been tested and validated on several private platforms, such as a dedicated cluster of workstations, as well as on public platforms, including the Hortonworks Data Platform and Amazon Web Services Elastic MapReduce solution
- …