1,419 research outputs found

    A Tidally-Disrupted Asteroid Around the White Dwarf G29-38

    Get PDF
    The infrared excess around the white dwarf G29-38 can be explained by emission from an opaque flat ring of dust with an inner radius 0.14 of the radius of the Sun and an outer radius approximately equal to the Sun's. This ring lies within the Roche region of the white dwarf where an asteroid could have been tidally destroyed, producing a system reminiscent of Saturn's rings. Accretion onto the white dwarf from this circumstellar dust can explain the observed calcium abundance in the atmosphere of G29-38. Either as a bombardment by a series of asteroids or because of one large disruption, the total amount of matter accreted onto the white dwarf may have been comparable to the total mass of asteroids in the Solar System, or, equivalently, about 1% of the mass in the asteroid belt around the main sequence star zeta Lep.Comment: ApJ Letters, in pres

    Efficient computation of the Shapley value for game-theoretic network centrality

    No full text
    The Shapley valueā€”probably the most important normative payoff division scheme in coalitional gamesā€”has recently been advocated as a useful measure of centrality in networks. However, although this approach has a variety of real-world applications (including social and organisational networks, biological networks and communication networks), its computational properties have not been widely studied. To date, the only practicable approach to compute Shapley value-based centrality has been via Monte Carlo simulations which are computationally expensive and not guaranteed to give an exact answer. Against this background, this paper presents the first study of the computational aspects of the Shapley value for network centralities. Specifically, we develop exact analytical formulae for Shapley value-based centrality in both weighted and unweighted networks and develop efficient (polynomial time) and exact algorithms based on them. We empirically evaluate these algorithms on two real-life examples (an infrastructure network representing the topology of the Western States Power Grid and a collaboration network from the field of astrophysics) and demonstrate that they deliver significant speedups over the Monte Carlo approach. Fo

    High resolution measurements of kinetic energy release distributions of neon, argon, and krypton cluster ions using a three sector field mass spectrometer

    Get PDF
    Using a newly constructed three sector field mass spectrometer (resulting in a BE1E2 field configuration) we have measured the kinetic energy release distributions of neon, argon, and krypton cluster ions. In the present study we used the first two sectors, B and E1, constituting a high resolution mass spectrometer, to select the parent ions in terms of mass, charge, and energy, and studied the decay of those ions in the third field free region. Due to the improved mass resolution we were able to extend earlier studies carried out with a two sector field machine, where an upper size limit arose from the fact that several isotopomers contribute to a decaying parent ion beam when the cluster size exceeds a certain value. Furthermore we developed a new data analysis. It allows us to model also fragment ion peaks that are a superposition of different decay reactions and thus we can determine the average kinetic energy release for all decay reactions of a given cluster ion. In a further step we used these results to determine the binding energies of cluster ions Rg(n) (ngreater than or equal to10) by applying finite heat bath theory. The smaller sizes have not been included in this analysis, because the validity of finite heat bath theory becomes questionable below napproximate to10. The present average kinetic energy releases and binding energies are compared with other experiments and various calculations. (C) 2004 American Institute of Physics

    Hiding in Multilayer Networks

    Full text link
    Multilayer networks allow for modeling complex relationships, where individuals are embedded in multiple social networks at the same time. Given the ubiquity of such relationships, these networks have been increasingly gaining attention in the literature. This paper presents the first analysis of the robustness of centrality measures against strategic manipulation in multilayer networks. More specifically, we consider an "evader" who strategically chooses which connections to form in a multilayer network in order to obtain a low centrality-based ranking-thereby reducing the chance of being highlighted as a key figure in the network-while ensuring that she remains connected to a certain group of people. We prove that determining an optimal way to "hide" is NP-complete and hard to approximate for most centrality measures considered in our study. Moreover, we empirically evaluate a number of heuristics that the evader can use. Our results suggest that the centrality measures that are functions of the entire network topology are more robust to such a strategic evader than their counterparts which consider each layer separately.Comment: 24 pages, 10 figure
    • ā€¦
    corecore