Size reduction of complex networks preserving modularity

The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionality. The best approaches to the identification of modular structure are based on the optimization of a quality function known as modularity. However this optimization is a hard task provided that the computational complexity of the problem is in the NP-hard class. Here we propose an exact method for reducing the size of weighted (directed and undirected) complex networks while maintaining invariant its modularity. This size reduction allows the heuristic algorithms that optimize modularity for a better exploration of the modularity landscape. We compare the modularity obtained in several real complex-networks by using the Extremal Optimization algorithm, before and after the size reduction, showing the improvement obtained. We speculate that the proposed analytical size reduction could be extended to an exact coarse graining of the network in the scope of real-space renormalization.Comment: 14 pages, 2 figure

Comparing community structure identification

We compare recent approaches to community structure identification in terms of sensitivity and computational cost. The recently proposed modularity measure is revisited and the performance of the methods as applied to ad hoc networks with known community structure, is compared. We find that the most accurate methods tend to be more computationally expensive, and that both aspects need to be considered when choosing a method for practical purposes. The work is intended as an introduction as well as a proposal for a standard benchmark test of community detection methods.Comment: 10 pages, 3 figures, 1 table. v2: condensed, updated version as appears in JSTA

Research and development project assessment and social impact

Nowadays, organisations increasingly need to adapt to the fast evolution of markets and societies in our globalised world in order to be competitive. Therefore, it is essential to take the right decisions when it comes to invest in research and development (R & D) projects. However, an issue that has not been given much attention is how to measure the social impact (or return) of R & D projects. In this exploratory study, the findings of an analysis of how R & D projects are assessed and selected, including this social perspective, are presented. The methodology which has been used in this research includes both interviews and analysis of the data obtained through them. The major finding is that in the current situation the social impact is not taken into account, but is growing the awareness of this perspective among different types of organizations dealing with R & D activities.(undefined)info:eu-repo/semantics/publishedVersio

Robust Detection of Hierarchical Communities from Escherichia coli Gene Expression Data

Determining the functional structure of biological networks is a central goal of systems biology. One approach is to analyze gene expression data to infer a network of gene interactions on the basis of their correlated responses to environmental and genetic perturbations. The inferred network can then be analyzed to identify functional communities. However, commonly used algorithms can yield unreliable results due to experimental noise, algorithmic stochasticity, and the influence of arbitrarily chosen parameter values. Furthermore, the results obtained typically provide only a simplistic view of the network partitioned into disjoint communities and provide no information of the relationship between communities. Here, we present methods to robustly detect coregulated and functionally enriched gene communities and demonstrate their application and validity for Escherichia coli gene expression data. Applying a recently developed community detection algorithm to the network of interactions identified with the context likelihood of relatedness (CLR) method, we show that a hierarchy of network communities can be identified. These communities significantly enrich for gene ontology (GO) terms, consistent with them representing biologically meaningful groups. Further, analysis of the most significantly enriched communities identified several candidate new regulatory interactions. The robustness of our methods is demonstrated by showing that a core set of functional communities is reliably found when artificial noise, modeling experimental noise, is added to the data. We find that noise mainly acts conservatively, increasing the relatedness required for a network link to be reliably assigned and decreasing the size of the core communities, rather than causing association of genes into new communities.Comment: Due to appear in PLoS Computational Biology. Supplementary Figure S1 was not uploaded but is available by contacting the author. 27 pages, 5 figures, 15 supplementary file

Combined artificial bee colony algorithm and machine learning techniques for prediction of online consumer repurchase intention

A novel paradigm in the service sector i.e. services through the web is a progressive mechanism for rendering offerings over diverse environments. Internet provides huge opportunities for companies to provide personalized online services to their customers. But prompt novel web services introduction may unfavorably affect the quality and user gratification. Subsequently, prediction of the consumer intention is of supreme importance in selecting the web services for an application. The aim of study is to predict online consumer repurchase intention and to achieve this objective a hybrid approach which a combination of machine learning techniques and Artificial Bee Colony (ABC) algorithm has been used. The study is divided into three phases. Initially, shopping mall and consumer characteristic’s for repurchase intention has been identified through extensive literature review. Secondly, ABC has been used to determine the feature selection of consumers’ characteristics and shopping malls’ attributes (with > 0.1 threshold value) for the prediction model. Finally, validation using K-fold cross has been employed to measure the best classification model robustness. The classification models viz., Decision Trees (C5.0), AdaBoost, Random Forest (RF), Support Vector Machine (SVM) and Neural Network (NN), are utilized for prediction of consumer purchase intention. Performance evaluation of identified models on training-testing partitions (70-30%) of the data set, shows that AdaBoost method outperforms other classification models with sensitivity and accuracy of 0.95 and 97.58% respectively, on testing data set. This study is a revolutionary attempt that considers both, shopping mall and consumer characteristics in examine the consumer purchase intention.N/

Overlapping political budget cycles in the legislative and the executive

We advance the literature on political budget cycles by testing separately for cycles in expenditures for elections in the legislative and the executive. Using municipal data, we can separately identify these cycles and account for general year effects. For the executive branch, we show that it is important whether the incumbent re-runs. To account for the potential endogeneity associated with this decision, we apply a unique instrumental variables approach based on age and pension eligibility rules. We find sizable and significant effects in expenditures before council elections and before joint elections when the incumbent re-runs

Vote buying or (political) business (cycles) as usual?

We study the short-run effect of elections on monetary aggregates in a sample of 85 low and middle income democracies (1975-2009). We find an increase in the growth rate of M1 during election months of about one tenth of a standard deviation. A similar effect can neither be detected in established OECD democracies nor in other months. The effect is larger in democracies with many poor and uneducated voters, and in Sub-Saharan Africa, Latin America, and in East-Asia and the Pacific. We argue that the election month monetary expansion is related to systemic vote buying which requires significant amounts of cash to be disbursed right before elections. The finely timed increase in M1 is consistent with this; is inconsistent with a monetary cycle aimed at creating an election time boom; and it cannot be, fully, accounted for by alternative explanations

Team sports performance analysed through the lens of social network theory: implications for research and practice

This paper discusses how social network analyses and graph theory can be implemented in team sports performance analyses to evaluate individual (micro) and collective (macro) performance data, and how to use this information for designing practice tasks. Moreover, we briefly outline possible limitations of social network studies and provide suggestions for future research. Instead of cataloguing discrete events or player actions, it has been argued that researchers need to consider the synergistic interpersonal processes emerging between teammates in competitive performance environments. Theoretical assumptions on team coordination prompted the emergence of innovative, theoretically-driven methods for assessing collective team sport behaviours. Here, we contribute to this theoretical and practical debate by conceptualising sports teams as complex social networks. From this perspective, players are viewed as network nodes, connected through relevant information variables (e.g., a ball passing action), sustaining complex patterns of interaction between teammates (e.g., a ball passing network). Specialized tools and metrics related to graph theory could be applied to evaluate structural and topological properties of interpersonal interactions of teammates, complementing more traditional analysis methods. This innovative methodology moves beyond use of common notation analysis methods, providing a richer understanding of the complexity of interpersonal interactions sustaining collective team sports performance. The proposed approach provides practical applications for coaches, performance analysts, practitioners and researchers by establishing social network analyses as a useful approach for capturing the emergent properties of interactions between players in sports teams