231 research outputs found

    Network 'small-world-ness': a quantitative method for determining canonical network equivalence

    Get PDF
    Background: Many technological, biological, social, and information networks fall into the broad class of 'small-world' networks: they have tightly interconnected clusters of nodes, and a shortest mean path length that is similar to a matched random graph (same number of nodes and edges). This semi-quantitative definition leads to a categorical distinction ('small/not-small') rather than a quantitative, continuous grading of networks, and can lead to uncertainty about a network's small-world status. Moreover, systems described by small-world networks are often studied using an equivalent canonical network model-the Watts-Strogatz (WS) model. However, the process of establishing an equivalent WS model is imprecise and there is a pressing need to discover ways in which this equivalence may be quantified. Methodology/Principal Findings: We defined a precise measure of 'small-world-ness' S based on the trade off between high local clustering and short path length. A network is now deemed a 'small-world' if S. 1-an assertion which may be tested statistically. We then examined the behavior of S on a large data-set of real-world systems. We found that all these systems were linked by a linear relationship between their S values and the network size n. Moreover, we show a method for assigning a unique Watts-Strogatz (WS) model to any real-world network, and show analytically that the WS models associated with our sample of networks also show linearity between S and n. Linearity between S and n is not, however, inevitable, and neither is S maximal for an arbitrary network of given size. Linearity may, however, be explained by a common limiting growth process. Conclusions/Significance: We have shown how the notion of a small-world network may be quantified. Several key properties of the metric are described and the use of WS canonical models is placed on a more secure footing

    Four Generations: SUSY and SUSY Breaking

    Get PDF
    We revisit four generations within the context of supersymmetry. We compute the perturbativity limits for the fourth generation Yukawa couplings and show that if the masses of the fourth generation lie within reasonable limits of their present experimental lower bounds, it is possible to have perturbativity only up to scales around 1000 TeV. Such low scales are ideally suited to incorporate gauge mediated supersymmetry breaking, where the mediation scale can be as low as 10-20 TeV. The minimal messenger model, however, is highly constrained. While lack of electroweak symmetry breaking rules out a large part of the parameter space, a small region exists, where the fourth generation stau is tachyonic. General gauge mediation with its broader set of boundary conditions is better suited to accommodate the fourth generation.Comment: 27 pages, 5 figure

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

    Get PDF
    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

    Local Difference Measures between Complex Networks for Dynamical System Model Evaluation

    Get PDF
    Acknowledgments We thank Reik V. Donner for inspiring suggestions that initialized the work presented herein. Jan H. Feldhoff is credited for providing us with the STARS simulation data and for his contributions to fruitful discussions. Comments by the anonymous reviewers are gratefully acknowledged as they led to substantial improvements of the manuscript.Peer reviewedPublisher PD

    A Formalism for the Systematic Treatment of Rapidity Logarithms in Quantum Field Theory

    Get PDF
    Many observables in QCD rely upon the resummation of perturbation theory to retain predictive power. Resummation follows after one factorizes the cross section into the rele- vant modes. The class of observables which are sensitive to soft recoil effects are particularly challenging to factorize and resum since they involve rapidity logarithms. In this paper we will present a formalism which allows one to factorize and resum the perturbative series for such observables in a systematic fashion through the notion of a "rapidity renormalization group". That is, a Collin-Soper like equation is realized as a renormalization group equation, but has a more universal applicability to observables beyond the traditional transverse momentum dependent parton distribution functions (TMDPDFs) and the Sudakov form factor. This formalism has the feature that it allows one to track the (non-standard) scheme dependence which is inherent in any scenario where one performs a resummation of rapidity divergences. We present a pedagogical introduction to the formalism by applying it to the well-known massive Sudakov form factor. The formalism is then used to study observables of current interest. A factorization theorem for the transverse momentum distribution of Higgs production is presented along with the result for the resummed cross section at NLL. Our formalism allows one to define gauge invariant TMDPDFs which are independent of both the hard scattering amplitude and the soft function, i.e. they are uni- versal. We present details of the factorization and resummation of the jet broadening cross section including a renormalization in pT space. We furthermore show how to regulate and renormalize exclusive processes which are plagued by endpoint singularities in such a way as to allow for a consistent resummation.Comment: Typos in Appendix C corrected, as well as a typo in eq. 5.6

    Uncovering Intrinsic Modular Organization of Spontaneous Brain Activity in Humans

    Get PDF
    The characterization of topological architecture of complex brain networks is one of the most challenging issues in neuroscience. Slow (<0.1 Hz), spontaneous fluctuations of the blood oxygen level dependent (BOLD) signal in functional magnetic resonance imaging are thought to be potentially important for the reflection of spontaneous neuronal activity. Many studies have shown that these fluctuations are highly coherent within anatomically or functionally linked areas of the brain. However, the underlying topological mechanisms responsible for these coherent intrinsic or spontaneous fluctuations are still poorly understood. Here, we apply modern network analysis techniques to investigate how spontaneous neuronal activities in the human brain derived from the resting-state BOLD signals are topologically organized at both the temporal and spatial scales. We first show that the spontaneous brain functional networks have an intrinsically cohesive modular structure in which the connections between regions are much denser within modules than between them. These identified modules are found to be closely associated with several well known functionally interconnected subsystems such as the somatosensory/motor, auditory, attention, visual, subcortical, and the “default” system. Specifically, we demonstrate that the module-specific topological features can not be captured by means of computing the corresponding global network parameters, suggesting a unique organization within each module. Finally, we identify several pivotal network connectors and paths (predominantly associated with the association and limbic/paralimbic cortex regions) that are vital for the global coordination of information flow over the whole network, and we find that their lesions (deletions) critically affect the stability and robustness of the brain functional system. Together, our results demonstrate the highly organized modular architecture and associated topological properties in the temporal and spatial brain functional networks of the human brain that underlie spontaneous neuronal dynamics, which provides important implications for our understanding of how intrinsically coherent spontaneous brain activity has evolved into an optimal neuronal architecture to support global computation and information integration in the absence of specific stimuli or behaviors

    A New Measure of Centrality for Brain Networks

    Get PDF
    Recent developments in network theory have allowed for the study of the structure and function of the human brain in terms of a network of interconnected components. Among the many nodes that form a network, some play a crucial role and are said to be central within the network structure. Central nodes may be identified via centrality metrics, with degree, betweenness, and eigenvector centrality being three of the most popular measures. Degree identifies the most connected nodes, whereas betweenness centrality identifies those located on the most traveled paths. Eigenvector centrality considers nodes connected to other high degree nodes as highly central. In the work presented here, we propose a new centrality metric called leverage centrality that considers the extent of connectivity of a node relative to the connectivity of its neighbors. The leverage centrality of a node in a network is determined by the extent to which its immediate neighbors rely on that node for information. Although similar in concept, there are essential differences between eigenvector and leverage centrality that are discussed in this manuscript. Degree, betweenness, eigenvector, and leverage centrality were compared using functional brain networks generated from healthy volunteers. Functional cartography was also used to identify neighborhood hubs (nodes with high degree within a network neighborhood). Provincial hubs provide structure within the local community, and connector hubs mediate connections between multiple communities. Leverage proved to yield information that was not captured by degree, betweenness, or eigenvector centrality and was more accurate at identifying neighborhood hubs. We propose that this metric may be able to identify critical nodes that are highly influential within the network

    Closing in on a perturbative fourth generation

    Full text link
    A perturbative new family of fermions is now severely constrained, though not excluded yet. We reconsider the current bounds (i.e., direct and from Higgs searches, R_b, oblique parameters) on the fourth generation parameter space assuming the case of a small CKM mixing with the third generation. We identify viable scenarios featuring either a light or a heavy Higgs boson. A set of representative benchmark points targeted for LHC searches is proposed with a normal (inverted) quark mass hierarchy where t' -> b'W (b' -> tW) decays are sizable. In the case where the fourth generation couplings to the lighter quark families are small, we suggest that search strategies at the LHC should include both pair (strong) and single (weak) production with bb+nW (n=2,...,6) final state signatures.Comment: 23 pages, 6 figures, v2: some issues clarified and references added. To appear in JHE

    Network Analysis of Intrinsic Functional Brain Connectivity in Alzheimer's Disease

    Get PDF
    Functional brain networks detected in task-free (“resting-state”) functional magnetic resonance imaging (fMRI) have a small-world architecture that reflects a robust functional organization of the brain. Here, we examined whether this functional organization is disrupted in Alzheimer's disease (AD). Task-free fMRI data from 21 AD subjects and 18 age-matched controls were obtained. Wavelet analysis was applied to the fMRI data to compute frequency-dependent correlation matrices. Correlation matrices were thresholded to create 90-node undirected-graphs of functional brain networks. Small-world metrics (characteristic path length and clustering coefficient) were computed using graph analytical methods. In the low frequency interval 0.01 to 0.05 Hz, functional brain networks in controls showed small-world organization of brain activity, characterized by a high clustering coefficient and a low characteristic path length. In contrast, functional brain networks in AD showed loss of small-world properties, characterized by a significantly lower clustering coefficient (p<0.01), indicative of disrupted local connectivity. Clustering coefficients for the left and right hippocampus were significantly lower (p<0.01) in the AD group compared to the control group. Furthermore, the clustering coefficient distinguished AD participants from the controls with a sensitivity of 72% and specificity of 78%. Our study provides new evidence that there is disrupted organization of functional brain networks in AD. Small-world metrics can characterize the functional organization of the brain in AD, and our findings further suggest that these network measures may be useful as an imaging-based biomarker to distinguish AD from healthy aging

    Distribution of immunodeficiency fact files with XML – from Web to WAP

    Get PDF
    BACKGROUND: Although biomedical information is growing rapidly, it is difficult to find and retrieve validated data especially for rare hereditary diseases. There is an increased need for services capable of integrating and validating information as well as proving it in a logically organized structure. A XML-based language enables creation of open source databases for storage, maintenance and delivery for different platforms. METHODS: Here we present a new data model called fact file and an XML-based specification Inherited Disease Markup Language (IDML), that were developed to facilitate disease information integration, storage and exchange. The data model was applied to primary immunodeficiencies, but it can be used for any hereditary disease. Fact files integrate biomedical, genetic and clinical information related to hereditary diseases. RESULTS: IDML and fact files were used to build a comprehensive Web and WAP accessible knowledge base ImmunoDeficiency Resource (IDR) available at . A fact file is a user oriented user interface, which serves as a starting point to explore information on hereditary diseases. CONCLUSION: The IDML enables the seamless integration and presentation of genetic and disease information resources in the Internet. IDML can be used to build information services for all kinds of inherited diseases. The open source specification and related programs are available at
    corecore