1,302 research outputs found
Random graphs containing arbitrary distributions of subgraphs
Traditional random graph models of networks generate networks that are
locally tree-like, meaning that all local neighborhoods take the form of trees.
In this respect such models are highly unrealistic, most real networks having
strongly non-tree-like neighborhoods that contain short loops, cliques, or
other biconnected subgraphs. In this paper we propose and analyze a new class
of random graph models that incorporates general subgraphs, allowing for
non-tree-like neighborhoods while still remaining solvable for many fundamental
network properties. Among other things we give solutions for the size of the
giant component, the position of the phase transition at which the giant
component appears, and percolation properties for both site and bond
percolation on networks generated by the model.Comment: 12 pages, 6 figures, 1 tabl
The Triangle Groups (2, 4, 5) and (2, 5, 5) are not Systolic
In this paper we provide new examples of hyperbolic but nonsystolic groups by showing that the triangle groups (2, 4, 5) and (2, 5, 5) are not systolic. Along the way we prove some results about subsets of systolic complexes stable under involutions
Random acyclic networks
Directed acyclic graphs are a fundamental class of networks that includes
citation networks, food webs, and family trees, among others. Here we define a
random graph model for directed acyclic graphs and give solutions for a number
of the model's properties, including connection probabilities and component
sizes, as well as a fast algorithm for simulating the model on a computer. We
compare the predictions of the model to a real-world network of citations
between physics papers and find surprisingly good agreement, suggesting that
the structure of the real network may be quite well described by the random
graph.Comment: 4 pages, 2 figure
Modified navigation instructions for spatial navigation assistance systems lead to incidental spatial learning
© 2017 Gramann, Hoepner and Karrer-Gauss. Spatial cognitive skills deteriorate with the increasing use of automated GPS navigation and a general decrease in the ability to orient in space might have further impact on independence, autonomy, and quality of life. In the present study we investigate whether modified navigation instructions support incidental spatial knowledge acquisition. A virtual driving environment was used to examine the impact of modified navigation instructions on spatial learning while using a GPS navigation assistance system. Participants navigated through a simulated urban and suburban environment, using navigation support to reach their destination. Driving performance as well as spatial learning was thereby assessed. Three navigation instruction conditions were tested: (i) a control group that was provided with classical navigation instructions at decision points, and two other groups that received navigation instructions at decision points including either (ii) additional irrelevant information about landmarks or (iii) additional personally relevant information (i.e., individual preferences regarding food, hobbies, etc.), associated with landmarks. Driving performance revealed no differences between navigation instructions. Significant improvements were observed in both modified navigation instruction conditions on three different measures of spatial learning and memory: subsequent navigation of the initial route without navigation assistance, landmark recognition, and sketch map drawing. Future navigation assistance systems could incorporate modified instructions to promote incidental spatial learning and to foster more general spatial cognitive abilities. Such systems might extend mobility across the lifespan
Nickel Isotopic Composition and Nickel/Iron Ratio in the Solar Wind: Results from SOHO/CELIAS/MTOF
Using the Mass Time-of-Flight Spectrometer (MTOF)—part of the Charge, Elements, Isotope Analysis System (CELIAS)—onboard the Solar Heliospheric Observatory (SOHO) spacecraft, we derive the nickel isotopic composition for the isotopes with mass 58, 60 and 62 in the solar wind. In addition we measure the elemental abundance ratio of nickel to iron. We use data accumulated during ten years of SOHO operation to get sufficiently high counting statistics and compare periods of different solar wind velocities. We compare our values with the meteoritic ratios, which are believed to be a reliable reference for the solar system and also for the solar outer convective zone, since neither element is volatile and no isotopic fractionation is expected in meteorites. Meteoritic isotopic abundances agree with the terrestrial values and can thus be considered to be a reliable reference for the solar isotopic composition. The measurements show that the solar wind elemental Ni/Fe-ratio and the isotopic composition of solar wind nickel are consistent with the meteoritic values. This supports the concept that low-FIP elements are fed without relative fractionation into the solar wind. Our result also confirms the absence of substantial isotopic fractionation processes for medium and heavy ions acting in the solar win
Determination of Sulfur Abundance in the Solar Wind
Solar chemical abundances are determined by comparing solar photospheric spectra with synthetic ones obtained for different sets of abundances and physical conditions. Although such inferred results are reliable, they are model dependent. Therefore, one compares them with the values for the local interstellar medium (LISM). The argument is that they must be similar, but even for LISM abundance determinations models play a fundamental role (i.e., temperature fluctuations, clumpiness, photon leaks). There are still two possible comparisons—one with the meteoritic values and the second with solar wind abundances. In this work we derive a first estimation of the solar wind element ratios of sulfur relative to calcium and magnesium, two neighboring low-FIP elements, using 10 years of CELIAS/MTOF data. We compare the sulfur abundance with the abundance determined from spectroscopic observations and from solar energetic particles. Sulfur is a moderately volatile element, hence, meteoritic sulfur may be depleted relative to non-volatile elements, if compared to its original solar system valu
Recommended from our members
The Kasparov-World Game
Kasparov-World, initiated by Microsoft and also sponsored by
First USA, was a novel correspondence game played on the World Wide Web at one ply per day. This was the first time that any group had attempted to form on the Web and then solve shared problems against fixed, short-term deadlines. The first author first became involved in his role as a Web consultant, observing the dynamics and effectiveness of the group. These are fully described, together with observations on the technological contribution and the second author's post-hoc computation of some relevant Endgame Tables
Disseminated Toxoplasmosis in a Patient with Non-Hodgkin Lymphoma
Abstract : Toxoplasmosis is a well-recognized opportunistic disease in HIV-infected individuals that is caused by the reactivation of a previous infection, primarily in the central nervous system, during profound immunodeficiency. Toxoplasmosis has been described more rarely in patients with cancer and chemotherapy. We report a case of a patient with a history of chemotherapy for non-Hodgkin lymphoma who developed pain and progressive paresthesia of the right arm 6 weeks after remission. Relapsing lymphoma was suspected, and steroid and radiation treatment were initiated, but the patient died 5 days later due to multiple organ failure. Autopsy revealed disseminated toxoplasmosis. This case illustrates that toxoplasmosis should be suspected in patients with neoplastic disease, especially lymphomas, who present with unexplained neurologic, pulmonary, or febrile symptoms during or after chemotherap
A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks
This paper presents a novel spectral algorithm with additive clustering
designed to identify overlapping communities in networks. The algorithm is
based on geometric properties of the spectrum of the expected adjacency matrix
in a random graph model that we call stochastic blockmodel with overlap (SBMO).
An adaptive version of the algorithm, that does not require the knowledge of
the number of hidden communities, is proved to be consistent under the SBMO
when the degrees in the graph are (slightly more than) logarithmic. The
algorithm is shown to perform well on simulated data and on real-world graphs
with known overlapping communities.Comment: Journal of Theoretical Computer Science (TCS), Elsevier, A Para\^itr
- …