21,004 research outputs found

    Geographical Coarsegraining of Complex Networks

    Full text link
    We perform the renormalization-group-like numerical analysis of geographically embedded complex networks on the two-dimensional square lattice. At each step of coarsegraining procedure, the four vertices on each 2×22 \times 2 square box are merged to a single vertex, resulting in the coarsegrained system of the smaller sizes. Repetition of the process leads to the observation that the coarsegraining procedure does not alter the qualitative characteristics of the original scale-free network, which opens the possibility of subtracting a smaller network from the original network without destroying the important structural properties. The implication of the result is also suggested in the context of the recent study of the human brain functional network.Comment: To appear in Phys. Rev. Let

    Climate Change: From Science to Practice

    Get PDF
    PURPOSE OF REVIEW: Climate change poses a significant threat to human health. Understanding how climate science can be translated into public health practice is an essential first step in enabling robust adaptation and improving resiliency to climate change. RECENT FINDINGS: Recent research highlights the importance of iterative approaches to public health adaptation to climate change, enabling uncertainties of health impacts and barriers to adaptation to be accounted for. There are still significant barriers to adaptation, which are context-specific and thus present unique challenges to public health practice. The implementation of flexible adaptation approaches, using frameworks targeted for public health, is key to ensuring robust adaptation to climate change in public health practice. The BRACE framework provides an excellent approach for health adaptation to climate change. Combining this with the insights provided and by the adaptation pathways approach allows for more deliberate accounting of long-term uncertainties. The mainstreaming of climate change adaptation into public health practice and planning is important in facilitating this approach and overcoming the significant barriers to effective adaptation. Yet, the immediate and future limits to adaptation provide clear justification for urgent and accelerated efforts to mitigate climate change

    Hardcore classification: identifying play styles in social games using network analysis

    Get PDF
    In the social network of a web-based online game, all players are not equal. Through network analysis, we show that the community of players in a online social game is an example of a scale free small world network and that the growth of the player-base obeys a power law. The community is centred around a minority group of ``hardcore" players who define the social environment for the game, and without whom the social network would collapse. Methods are discussed for identifying this critically important subset of players automatically through analysing social behaviours within the game

    Least Squares Ranking on Graphs

    Full text link
    Given a set of alternatives to be ranked, and some pairwise comparison data, ranking is a least squares computation on a graph. The vertices are the alternatives, and the edge values comprise the comparison data. The basic idea is very simple and old: come up with values on vertices such that their differences match the given edge data. Since an exact match will usually be impossible, one settles for matching in a least squares sense. This formulation was first described by Leake in 1976 for rankingfootball teams and appears as an example in Professor Gilbert Strang's classic linear algebra textbook. If one is willing to look into the residual a little further, then the problem really comes alive, as shown effectively by the remarkable recent paper of Jiang et al. With or without this twist, the humble least squares problem on graphs has far-reaching connections with many current areas ofresearch. These connections are to theoretical computer science (spectral graph theory, and multilevel methods for graph Laplacian systems); numerical analysis (algebraic multigrid, and finite element exterior calculus); other mathematics (Hodge decomposition, and random clique complexes); and applications (arbitrage, and ranking of sports teams). Not all of these connections are explored in this paper, but many are. The underlying ideas are easy to explain, requiring only the four fundamental subspaces from elementary linear algebra. One of our aims is to explain these basic ideas and connections, to get researchers in many fields interested in this topic. Another aim is to use our numerical experiments for guidance on selecting methods and exposing the need for further development.Comment: Added missing references, comparison of linear solvers overhauled, conclusion section added, some new figures adde

    Functional centrality in graphs

    Full text link
    In this paper we introduce the functional centrality as a generalization of the subgraph centrality. We propose a general method for characterizing nodes in the graph according to the number of closed walks starting and ending at the node. Closed walks are appropriately weighted according to the topological features that we need to measure

    Characterizing Individual Communication Patterns

    Full text link
    The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for characterizing individual behavior and, by extension, identifying latent structure in human populations. Here, we propose a model of individual e-mail communication that is sufficiently rich to capture meaningful variability across individuals, while remaining simple enough to be interpretable. We show that the model, a cascading non-homogeneous Poisson process, can be formulated as a double-chain hidden Markov model, allowing us to use an efficient inference algorithm to estimate the model parameters from observed data. We then apply this model to two e-mail data sets consisting of 404 and 6,164 users, respectively, that were collected from two universities in different countries and years. We find that the resulting best-estimate parameter distributions for both data sets are surprisingly similar, indicating that at least some features of communication dynamics generalize beyond specific contexts. We also find that variability of individual behavior over time is significantly less than variability across the population, suggesting that individuals can be classified into persistent "types". We conclude that communication patterns may prove useful as an additional class of attribute data, complementing demographic and network data, for user classification and outlier detection--a point that we illustrate with an interpretable clustering of users based on their inferred model parameters.Comment: 9 pages, 6 figures, to appear in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'09), June 28-July 1, Paris, Franc

    Superburst oscillations: ocean and crustal modes excited by Carbon-triggered Type I X-ray bursts

    Full text link
    Accreting neutron stars (NS) can exhibit high frequency modulations in their lightcurves during thermonuclear X-ray bursts, known as burst oscillations. The frequencies can be offset from the spin frequency of the NS by several Hz, and can drift by 1-3 Hz. One possible explanation is a mode in the bursting ocean, the frequency of which would decrease (in the rotating frame) as the burst cools, hence explaining the drifts. Most burst oscillations have been observed during H/He triggered bursts, however there has been one observation of oscillations during a superburst; hours' long Type I X-ray bursts caused by unstable carbon burning deeper in the ocean. This paper calculates the frequency evolution of an oceanic r-mode during a superburst. The rotating frame frequency varies during the burst from 4-14 Hz, and is sensitive to the background parameters, in particular the temperature of the ocean and ignition depth. This calculation is compared to the superburst oscillations observed on 4U-1636-536. The predicted mode frequencies (\sim 10 Hz) would require a spin frequency of \sim 592 Hz to match observations; 6 Hz higher than the spin inferred from an oceanic r-mode model for the H/He triggered burst oscillations. This model also over-predicts the frequency drift during the superburst by 90 %.Comment: Accepted for publication in MNRA

    Scale-free networks with tunable degree distribution exponents

    Full text link
    We propose and study a model of scale-free growing networks that gives a degree distribution dominated by a power-law behavior with a model-dependent, hence tunable, exponent. The model represents a hybrid of the growing networks based on popularity-driven and fitness-driven preferential attachments. As the network grows, a newly added node establishes mm new links to existing nodes with a probability pp based on popularity of the existing nodes and a probability 1p1-p based on fitness of the existing nodes. An explicit form of the degree distribution P(p,k)P(p,k) is derived within a mean field approach. For reasonably large kk, P(p,k)kγ(p)F(k,p)P(p,k) \sim k^{-\gamma(p)}{\cal F}(k,p), where the function F{\cal F} is dominated by the behavior of 1/ln(k/m)1/\ln(k/m) for small values of pp and becomes kk-independent as p1p \to 1, and γ(p)\gamma(p) is a model-dependent exponent. The degree distribution and the exponent γ(p)\gamma(p) are found to be in good agreement with results obtained by extensive numerical simulations.Comment: 12 pages, 2 figures, submitted to PR
    corecore