1,445 research outputs found

    Acquaintance time of random graphs near connectivity threshold

    Full text link
    Benjamini, Shinkar, and Tsur stated the following conjecture on the acquaintance time: asymptotically almost surely AC(G)p1logO(1)nAC(G) \le p^{-1} \log^{O(1)} n for a random graph GG(n,p)G \in G(n,p), provided that GG is connected. Recently, Kinnersley, Mitsche, and the second author made a major step towards this conjecture by showing that asymptotically almost surely AC(G)=O(logn/p)AC(G) = O(\log n / p), provided that GG has a Hamiltonian cycle. In this paper, we finish the task by showing that the conjecture holds in the strongest possible sense, that is, it holds right at the time the random graph process creates a connected graph. Moreover, we generalize and investigate the problem for random hypergraphs

    Reactive immunization on complex networks

    Full text link
    Epidemic spreading on complex networks depends on the topological structure as well as on the dynamical properties of the infection itself. Generally speaking, highly connected individuals play the role of hubs and are crucial to channel information across the network. On the other hand, static topological quantities measuring the connectivity structure are independent on the dynamical mechanisms of the infection. A natural question is therefore how to improve the topological analysis by some kind of dynamical information that may be extracted from the ongoing infection itself. In this spirit, we propose a novel vaccination scheme that exploits information from the details of the infection pattern at the moment when the vaccination strategy is applied. Numerical simulations of the infection process show that the proposed immunization strategy is effective and robust on a wide class of complex networks

    Community structure and the evolution of interdisciplinarity in Slovenia's scientific collaboration network

    Full text link
    Interaction among the scientific disciplines is of vital importance in modern science. Focusing on the case of Slovenia, we study the dynamics of interdisciplinary sciences from 1960 to 2010. Our approach relies on quantifying the interdisciplinarity of research communities detected in the coauthorship network of Slovenian scientists over time. Examining the evolution of the community structure, we find that the frequency of interdisciplinary research is only proportional with the overall growth of the network. Although marginal improvements in favor of interdisciplinarity are inferable during the 70s and 80s, the overall trends during the past 20 years are constant and indicative of stalemate. We conclude that the flow of knowledge between different fields of research in Slovenia is in need of further stimulation.Comment: 11 pages, 4 figures; accepted for publication in PLoS ONE [related work available at http://arxiv.org/abs/1004.4824 and http://www.matjazperc.com/sicris/stats.html

    Growth and structure of Slovenia's scientific collaboration network

    Full text link
    We study the evolution of Slovenia's scientific collaboration network from 1960 till present with a yearly resolution. For each year the network was constructed from publication records of Slovene scientists, whereby two were connected if, up to the given year inclusive, they have coauthored at least one paper together. Starting with no more than 30 scientists with an average of 1.5 collaborators in the year 1960, the network to date consists of 7380 individuals that, on average, have 10.7 collaborators. We show that, in spite of the broad myriad of research fields covered, the networks form "small worlds" and that indeed the average path between any pair of scientists scales logarithmically with size after the largest component becomes large enough. Moreover, we show that the network growth is governed by near-liner preferential attachment, giving rise to a log-normal distribution of collaborators per author, and that the average starting year is roughly inversely proportional to the number of collaborators eventually acquired. Understandably, not all that became active early have till now gathered many collaborators. We also give results for the clustering coefficient and the diameter of the network over time, and compare our conclusions with those reported previously.Comment: 10 pages, 3 figures; accepted for publication in Journal of Informetrics [related work available at http://arxiv.org/abs/1003.1018 and http://www.matjazperc.com/sicris/stats.html

    Graph analysis of functional brain networks: practical issues in translational neuroscience

    Full text link
    The brain can be regarded as a network: a connected system where nodes, or units, represent different specialized regions and links, or connections, represent communication pathways. From a functional perspective communication is coded by temporal dependence between the activities of different brain areas. In the last decade, the abstract representation of the brain as a graph has allowed to visualize functional brain networks and describe their non-trivial topological properties in a compact and objective way. Nowadays, the use of graph analysis in translational neuroscience has become essential to quantify brain dysfunctions in terms of aberrant reconfiguration of functional brain networks. Despite its evident impact, graph analysis of functional brain networks is not a simple toolbox that can be blindly applied to brain signals. On the one hand, it requires a know-how of all the methodological steps of the processing pipeline that manipulates the input brain signals and extract the functional network properties. On the other hand, a knowledge of the neural phenomenon under study is required to perform physiological-relevant analysis. The aim of this review is to provide practical indications to make sense of brain network analysis and contrast counterproductive attitudes

    Spatial networks with wireless applications

    Get PDF
    Many networks have nodes located in physical space, with links more common between closely spaced pairs of nodes. For example, the nodes could be wireless devices and links communication channels in a wireless mesh network. We describe recent work involving such networks, considering effects due to the geometry (convex,non-convex, and fractal), node distribution, distance-dependent link probability, mobility, directivity and interference.Comment: Review article- an amended version with a new title from the origina

    Peer-to-Peer and Mass Communication Effect on Revolution Dynamics

    Full text link
    Revolution dynamics is studied through a minimal Ising model with three main influences (fields): personal conservatism (power-law distributed), inter-personal and group pressure, and a global field incorporating peer-to-peer and mass communications, which is generated bottom-up from the revolutionary faction. A rich phase diagram appears separating possible terminal stages of the revolution, characterizing failure phases by the features of the individuals who had joined the revolution. An exhaustive solution of the model is produced, allowing predictions to be made on the revolution's outcome

    Small-World Brain Networks Revisited.

    Get PDF
    It is nearly 20 years since the concept of a small-world network was first quantitatively defined, by a combination of high clustering and short path length; and about 10 years since this metric of complex network topology began to be widely applied to analysis of neuroimaging and other neuroscience data as part of the rapid growth of the new field of connectomics. Here, we review briefly the foundational concepts of graph theoretical estimation and generation of small-world networks. We take stock of some of the key developments in the field in the past decade and we consider in some detail the implications of recent studies using high-resolution tract-tracing methods to map the anatomical networks of the macaque and the mouse. In doing so, we draw attention to the important methodological distinction between topological analysis of binary or unweighted graphs, which have provided a popular but simple approach to brain network analysis in the past, and the topology of weighted graphs, which retain more biologically relevant information and are more appropriate to the increasingly sophisticated data on brain connectivity emerging from contemporary tract-tracing and other imaging studies. We conclude by highlighting some possible future trends in the further development of weighted small-worldness as part of a deeper and broader understanding of the topology and the functional value of the strong and weak links between areas of mammalian cortex.DSB acknowledges support from the John D. and Catherine T. MacArthur Foundation, the Alfred P. Sloan Foundation, the Army Research Laboratory and the Army Research Office through contract numbers W911NF-10-2-0022 and W911NF-14-1-0679, the National Institute of Health (2-R01-DC-009209-11, 1R01HD086888-01, R01-MH107235, R01-MH107703, and R21-M MH-106799), the Office of Naval Research, and the National Science Foundation (BCS-1441502, CAREER PHY-1554488, and BCS-1631550).This is the final version of the article. It first appeared from Sage at http://dx.doi.org/10.1177/1073858416667720
    corecore