Identifying network communities with a high resolution

Community structure is an important property of complex networks. An automatic discovery of such structure is a fundamental task in many disciplines, including sociology, biology, engineering, and computer science. Recently, several community discovery algorithms have been proposed based on the optimization of a quantity called modularity (Q). However, the problem of modularity optimization is NP-hard, and the existing approaches often suffer from prohibitively long running time or poor quality. Furthermore, it has been recently pointed out that algorithms based on optimizing Q will have a resolution limit, i.e., communities below a certain scale may not be detected. In this research, we first propose an efficient heuristic algorithm, Qcut, which combines spectral graph partitioning and local search to optimize Q. Using both synthetic and real networks, we show that Qcut can find higher modularities and is more scalable than the existing algorithms. Furthermore, using Qcut as an essential component, we propose a recursive algorithm, HQcut, to solve the resolution limit problem. We show that HQcut can successfully detect communities at a much finer scale and with a higher accuracy than the existing algorithms. Finally, we apply Qcut and HQcut to study a protein-protein interaction network, and show that the combination of the two algorithms can reveal interesting biological results that may be otherwise undetectable.Comment: 14 pages, 5 figures. 1 supplemental file at http://cic.cs.wustl.edu/qcut/supplemental.pd

Small rainbow cliques in randomly perturbed dense graphs

For two graphs G and H, write G rbw −→ H if G has the property that every proper colouring of its edges yields a rainbow copy of H. We study the thresholds for such so-called anti-Ramsey properties in randomly perturbed dense graphs, which are unions of the form G ∪ G(n, p), where G is an n-vertex graph with edge-density at least d > 0, and d is independent of n. In a companion paper, we proved that the threshold for the property G ∪ G(n, p) rbw −→ K` is n −1/m2(Kd`/2e) , whenever ` ≥ 9. For smaller `, the thresholds behave more erratically, and for 4 ≤ ` ≤ 7 they deviate downwards significantly from the aforementioned aesthetic form capturing the thresholds for large cliques. In particular, we show that the thresholds for ` ∈ {4, 5, 7} are n −5/4 , n −1 , and n −7/15, respectively. For ` ∈ {6, 8} we determine the threshold up to a (1 + o(1))-factor in the exponent: they are n −(2/3+o(1)) and n −(2/5+o(1)), respectively. For ` = 3, the threshold is n −2 ; this follows from a more general result about odd cycles in our companion paper

Networks and the epidemiology of infectious disease

The science of networks has revolutionised research into the dynamics of interacting elements. It could be argued that epidemiology in particular has embraced the potential of network theory more than any other discipline. Here we review the growing body of research concerning the spread of infectious diseases on networks, focusing on the interplay between network theory and epidemiology. The review is split into four main sections, which examine: the types of network relevant to epidemiology; the multitude of ways these networks can be characterised; the statistical methods that can be applied to infer the epidemiological parameters on a realised network; and finally simulation and analytical methods to determine epidemic dynamics on a given network. Given the breadth of areas covered and the ever-expanding number of publications, a comprehensive review of all work is impossible. Instead, we provide a personalised overview into the areas of network epidemiology that have seen the greatest progress in recent years or have the greatest potential to provide novel insights. As such, considerable importance is placed on analytical approaches and statistical methods which are both rapidly expanding fields. Throughout this review we restrict our attention to epidemiological issues

Finding community structure in networks using the eigenvectors of matrices

We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as "modularity" over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a new centrality measure that identifies those vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of real-world complex networks.Comment: 22 pages, 8 figures, minor corrections in this versio

Influence of wiring cost on the large-scale architecture of human cortical connectivity

In the past two decades some fundamental properties of cortical connectivity have been discovered: small-world structure, pronounced hierarchical and modular organisation, and strong core and rich-club structures. A common assumption when interpreting results of this kind is that the observed structural properties are present to enable the brain's function. However, the brain is also embedded into the limited space of the skull and its wiring has associated developmental and metabolic costs. These basic physical and economic aspects place separate, often conflicting, constraints on the brain's connectivity, which must be characterized in order to understand the true relationship between brain structure and function. To address this challenge, here we ask which, and to what extent, aspects of the structural organisation of the brain are conserved if we preserve specific spatial and topological properties of the brain but otherwise randomise its connectivity. We perform a comparative analysis of a connectivity map of the cortical connectome both on high- and low-resolutions utilising three different types of surrogate networks: spatially unconstrained (‘random’), connection length preserving (‘spatial’), and connection length optimised (‘reduced’) surrogates. We find that unconstrained randomisation markedly diminishes all investigated architectural properties of cortical connectivity. By contrast, spatial and reduced surrogates largely preserve most properties and, interestingly, often more so in the reduced surrogates. Specifically, our results suggest that the cortical network is less tightly integrated than its spatial constraints would allow, but more strongly segregated than its spatial constraints would necessitate. We additionally find that hierarchical organisation and rich-club structure of the cortical connectivity are largely preserved in spatial and reduced surrogates and hence may be partially attributable to cortical wiring constraints. In contrast, the high modularity and strong s-core of the high-resolution cortical network are significantly stronger than in the surrogates, underlining their potential functional relevance in the brain

Mesoscopic structure conditions the emergence of cooperation on social networks

We study the evolutionary Prisoner's Dilemma on two social networks obtained from actual relational data. We find very different cooperation levels on each of them that can not be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding perfect agreement with the observations in the real networks. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.Comment: Largely improved version, includes an artificial network model that fully confirms the explanation of the results in terms of inter- and intra-community structur

Dynamics of multi-stage infections on networks

This paper investigates the dynamics of infectious diseases with a nonexponentially distributed infectious period. This is achieved by considering a multistage infection model on networks. Using pairwise approximation with a standard closure, a number of important characteristics of disease dynamics are derived analytically, including the final size of an epidemic and a threshold for epidemic outbreaks, and it is shown how these quantities depend on disease characteristics, as well as the number of disease stages. Stochastic simulations of dynamics on networks are performed and compared to output of pairwise models for several realistic examples of infectious diseases to illustrate the role played by the number of stages in the disease dynamics. These results show that a higher number of disease stages results in faster epidemic outbreaks with a higher peak prevalence and a larger final size of the epidemic. The agreement between the pairwise and simulation models is excellent in the cases we consider

Electrical control over single hole spins in nanowire quantum dots

Single electron spins in semiconductor quantum dots (QDs) are a versatile platform for quantum information processing, however controlling decoherence remains a considerable challenge. Recently, hole spins have emerged as a promising alternative. Holes in III-V semiconductors have unique properties, such as strong spin-orbit interaction and weak coupling to nuclear spins, and therefore have potential for enhanced spin control and longer coherence times. Weaker hyperfine interaction has already been reported in self-assembled quantum dots using quantum optics techniques. However, challenging fabrication has so far kept the promise of hole-spin-based electronic devices out of reach in conventional III-V heterostructures. Here, we report gate-tuneable hole quantum dots formed in InSb nanowires. Using these devices we demonstrate Pauli spin blockade and electrical control of single hole spins. The devices are fully tuneable between hole and electron QDs, enabling direct comparison between the hyperfine interaction strengths, g-factors and spin blockade anisotropies in the two regimes

Inhibition of cathepsin B by caspase-3 inhibitors blocks programmed cell death in <i>Arabidopsis</i>

Programmed cell death (PCD) is used by plants for development and survival to biotic and abiotic stresses. The role of caspases in PCD is well established in animal cells. Over the past 15 years, the importance of caspase-3-like enzymatic activity for plant PCD completion has been widely documented despite the absence of caspase orthologues. In particular, caspase-3 inhibitors blocked nearly all plant PCD tested. Here, we affinity-purified a plant caspase-3-like activity using a biotin-labelled caspase-3 inhibitor and identified Arabidopsis thaliana cathepsin B3 (AtCathB3) by liquid chromatography with tandem mass spectrometry (LC-MS/MS). Consistent with this, recombinant AtCathB3 was found to have caspase-3-like activity and to be inhibited by caspase-3 inhibitors. AtCathepsin B triple-mutant lines showed reduced caspase-3-like enzymatic activity and reduced labelling with activity-based caspase-3 probes. Importantly, AtCathepsin B triple mutants showed a strong reduction in the PCD induced by ultraviolet (UV), oxidative stress (H2O2, methyl viologen) or endoplasmic reticulum stress. Our observations contribute to explain why caspase-3 inhibitors inhibit plant PCD and provide new tools to further plant PCD research. The fact that cathepsin B does regulate PCD in both animal and plant cells suggests that this protease may be part of an ancestral PCD pathway pre-existing the plant/animal divergence that needs further characterisation

Characteristics of a Lead Slowing-Down Spectrometer Coupled to the LANSCE Accelerator

Abstract A description is given of a lead slowing-down spectrometer (LSDS) installed at the 800-MeV proton accelerator of the Los Alamos Neutron Science Center (LANSCE). The LSDS is designed to study neutron-induced fission on actinides that can only be obtained or used in small quantities. The characteristics of this LSDS (energy-time relation, energy resolution, neutron flux) are presented through simulations with MCNPX and measurements with several different methods. Results on neutron-induced fission of 235 U and 239 Pu with tens of micrograms and tens of nanograms, respectively, are presented. Finally, additional MCNPX calculations have been performed to simulate the measurement of the cross-section for 235m Uðn; fÞ using different target quantities and different initial isomer-to-ground state compositions