Forman's Ricci curvature - From networks to hypernetworks

Networks and their higher order generalizations, such as hypernetworks or multiplex networks are ever more popular models in the applied sciences. However, methods developed for the study of their structural properties go little beyond the common name and the heavy reliance of combinatorial tools. We show that, in fact, a geometric unifying approach is possible, by viewing them as polyhedral complexes endowed with a simple, yet, the powerful notion of curvature - the Forman Ricci curvature. We systematically explore some aspects related to the modeling of weighted and directed hypernetworks and present expressive and natural choices involved in their definitions. A benefit of this approach is a simple method of structure-preserving embedding of hypernetworks in Euclidean N-space. Furthermore, we introduce a simple and efficient manner of computing the well established Ollivier-Ricci curvature of a hypernetwork.Comment: to appear: Complex Networks '18 (oral presentation

Realizability of the Lorentzian (n,1)-Simplex

In a previous article [JHEP 1111 (2011) 072; arXiv:1108.4965] we have developed a Lorentzian version of the Quantum Regge Calculus in which the significant differences between simplices in Lorentzian signature and Euclidean signature are crucial. In this article we extend a central result used in the previous article, regarding the realizability of Lorentzian triangles, to arbitrary dimension. This technical step will be crucial for developing the Lorentzian model in the case of most physical interest: 3+1 dimensions. We first state (and derive in an appendix) the realizability conditions on the edge-lengths of a Lorentzian n-simplex in total dimension n=d+1, where d is the number of space-like dimensions. We then show that in any dimension there is a certain type of simplex which has all of its time-like edge lengths completely unconstrained by any sort of triangle inequality. This result is the d+1 dimensional analogue of the 1+1 dimensional case of the Lorentzian triangle.Comment: V1: 15 pages, 2 figures. V2: Minor clarifications added to Introduction and Discussion sections. 1 reference updated. This version accepted for publication in JHEP. V3: minor updates and clarifications, this version closely corresponds to the version published in JHE

Evaluating Active U: an Internet-mediated physical activity program.

Background: Engaging in regular physical activity can be challenging, particularly during the winter months. To promote physical activity at the University of Michigan during the winter months, an eight-week Internet-mediated program (Active U) was developed providing participants with an online physical activity log, goal setting, motivational emails, and optional team participation and competition. Methods: This study is a program evaluation of Active U. Approximately 47,000 faculty, staff, and graduate students were invited to participate in the online Active U intervention in the winter of 2007. Participants were assigned a physical activity goal and were asked to record each physical activity episode into the activity log for eight weeks. Statistics for program reach, effectiveness, adoption, and implementation were calculated using the Re-Aim framework. Multilevel regression analyses were used to assess the decline in rates of data entry and goal attainment during the program, to assess the likelihood of joining a team by demographic characteristics, to test the association between various predictors and the number of weeks an individual met his or her goal, and to analyze server load. Results: Overall, 7,483 individuals registered with the Active U website (≈16% of eligible), and 79% participated in the program by logging valid data at least once. Staff members, older participants, and those with a BMI < 25 were more likely to meet their weekly physical activity goals, and average rate of meeting goals was higher among participants who joined a competitive team compared to those who participated individually (IRR = 1.28, P < .001). Conclusion: Internet-mediated physical activity interventions that focus on physical activity logging and goal setting while incorporating team competition may help a significant percentage of the target population maintain their physical activity during the winter months

On the Schoenberg Transformations in Data Analysis: Theory and Illustrations

The class of Schoenberg transformations, embedding Euclidean distances into higher dimensional Euclidean spaces, is presented, and derived from theorems on positive definite and conditionally negative definite matrices. Original results on the arc lengths, angles and curvature of the transformations are proposed, and visualized on artificial data sets by classical multidimensional scaling. A simple distance-based discriminant algorithm illustrates the theory, intimately connected to the Gaussian kernels of Machine Learning

High-dimensional simplexes for supermetric search

In a metric space, triangle inequality implies that, for any three objects, a triangle with edge lengths corresponding to their pairwise distances can be formed. The n-point property is a generalisation of this where, for any (n+1) objects in the space, there exists an n-dimensional simplex whose edge lengths correspond to the distances among the objects. In general, metric spaces do not have this property; however in 1953, Blumenthal showed that any semi-metric space which is isometrically embeddable in a Hilbert space also has the n-point property. We have previously called such spaces supermetric spaces, and have shown that many metric spaces are also supermetric, including Euclidean, Cosine, Jensen-Shannon and Triangular spaces of any dimension. Here we show how such simplexes can be constructed from only their edge lengths, and we show how the geometry of the simplexes can be used to determine lower and upper bounds on unknown distances within the original space. By increasing the number of dimensions, these bounds converge to the true distance. Finally we show that for any Hilbert-embeddable space, it is possible to construct Euclidean spaces of arbitrary dimensions, from which these lower and upper bounds of the original space can be determined. These spaces may be much cheaper to query than the original. For similarity search, the engineering tradeoffs are good: we show significant reductions in data size and metric cost with little loss of accuracy, leading to a significant overall improvement in exact search performance

Information transfer fidelity in spin networks and ring-based quantum routers

Spin networks are endowed with an Information Transfer Fidelity (ITF), which defines an absolute upper bound on the probability of transmission of an excitation from one spin to another. The ITF is easily computable but the bound can be reached asymptotically in time only under certain conditions. General conditions for attainability of the bound are established and the process of achieving the maximum transfer probability is given a dynamical model, the translation on the torus. The time to reach the maximum probability is estimated using the simultaneous Diophantine approximation, implemented using a variant of the Lenstra-Lenstra-Lov\'asz (LLL) algorithm. For a ring with uniform couplings, the network can be made a metric space by defining a distance (satisfying the triangle inequality) that quantifies the lack of transmission fidelity between two nodes. It is shown that transfer fidelities and transfer times can be improved significantly by means of simple controls taking the form of non-dynamic, spatially localized bias fields, opening up the possibility for intelligent design of spin networks and dynamic routing of information encoded in them, while being more flexible than engineering fixed couplings to favor some transfers, and less demanding than control schemes requiring fast dynamic controls

Entangled-State Cycles of Atomic Collective-Spin States

We study quantum trajectories of collective atomic spin states of $N$ effective two-level atoms driven with laser and cavity fields. We show that interesting ``entangled-state cycles'' arise probabilistically when the (Raman) transition rates between the two atomic levels are set equal. For odd (even) $N$, there are $(N+1)/2$ ($N/2$) possible cycles. During each cycle the $N$-qubit state switches, with each cavity photon emission, between the states $(|N/2,m>\pm |N/2,-m>)/\sqrt{2}$, where $|N/2,m>$ is a Dicke state in a rotated collective basis. The quantum number $m$ ($>0$), which distinguishes the particular cycle, is determined by the photon counting record and varies randomly from one trajectory to the next. For even $N$ it is also possible, under the same conditions, to prepare probabilistically (but in steady state) the Dicke state $|N/2,0>$, i.e., an $N$-qubit state with $N/2$ excitations, which is of particular interest in the context of multipartite entanglement.Comment: 10 pages, 9 figure

Ramified rectilinear polygons: coordinatization by dendrons

Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic $l_1$-metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexes that share this same embedding property are called ramified rectilinear polygons. The links of vertices in these cell complexes may be arbitrary bipartite graphs, in contrast to simple rectilinear polygons where the links of points are either 4-cycles or paths of length at most 3. Ramified rectilinear polygons are particular instances of rectangular complexes obtained from cube-free median graphs, or equivalently simply connected rectangular complexes with triangle-free links. The underlying graphs of finite ramified rectilinear polygons can be recognized among graphs in linear time by a Lexicographic Breadth-First-Search. Whereas the symmetry of a simple rectilinear polygon is very restricted (with automorphism group being a subgroup of the dihedral group $D_4$), ramified rectilinear polygons are universal: every finite group is the automorphism group of some ramified rectilinear polygon.Comment: 27 pages, 6 figure

X-Ray Spectroscopy of Stars

(abridged) Non-degenerate stars of essentially all spectral classes are soft X-ray sources. Low-mass stars on the cooler part of the main sequence and their pre-main sequence predecessors define the dominant stellar population in the galaxy by number. Their X-ray spectra are reminiscent, in the broadest sense, of X-ray spectra from the solar corona. X-ray emission from cool stars is indeed ascribed to magnetically trapped hot gas analogous to the solar coronal plasma. Coronal structure, its thermal stratification and geometric extent can be interpreted based on various spectral diagnostics. New features have been identified in pre-main sequence stars; some of these may be related to accretion shocks on the stellar surface, fluorescence on circumstellar disks due to X-ray irradiation, or shock heating in stellar outflows. Massive, hot stars clearly dominate the interaction with the galactic interstellar medium: they are the main sources of ionizing radiation, mechanical energy and chemical enrichment in galaxies. High-energy emission permits to probe some of the most important processes at work in these stars, and put constraints on their most peculiar feature: the stellar wind. Here, we review recent advances in our understanding of cool and hot stars through the study of X-ray spectra, in particular high-resolution spectra now available from XMM-Newton and Chandra. We address issues related to coronal structure, flares, the composition of coronal plasma, X-ray production in accretion streams and outflows, X-rays from single OB-type stars, massive binaries, magnetic hot objects and evolved WR stars.Comment: accepted for Astron. Astrophys. Rev., 98 journal pages, 30 figures (partly multiple); some corrections made after proof stag

The stellar and sub-stellar IMF of simple and composite populations

The current knowledge on the stellar IMF is documented. It appears to become top-heavy when the star-formation rate density surpasses about 0.1Msun/(yr pc^3) on a pc scale and it may become increasingly bottom-heavy with increasing metallicity and in increasingly massive early-type galaxies. It declines quite steeply below about 0.07Msun with brown dwarfs (BDs) and very low mass stars having their own IMF. The most massive star of mass mmax formed in an embedded cluster with stellar mass Mecl correlates strongly with Mecl being a result of gravitation-driven but resource-limited growth and fragmentation induced starvation. There is no convincing evidence whatsoever that massive stars do form in isolation. Various methods of discretising a stellar population are introduced: optimal sampling leads to a mass distribution that perfectly represents the exact form of the desired IMF and the mmax-to-Mecl relation, while random sampling results in statistical variations of the shape of the IMF. The observed mmax-to-Mecl correlation and the small spread of IMF power-law indices together suggest that optimally sampling the IMF may be the more realistic description of star formation than random sampling from a universal IMF with a constant upper mass limit. Composite populations on galaxy scales, which are formed from many pc scale star formation events, need to be described by the integrated galactic IMF. This IGIMF varies systematically from top-light to top-heavy in dependence of galaxy type and star formation rate, with dramatic implications for theories of galaxy formation and evolution.Comment: 167 pages, 37 figures, 3 tables, published in Stellar Systems and Galactic Structure, Vol.5, Springer. This revised version is consistent with the published version and includes additional references and minor additions to the text as well as a recomputed Table 1. ISBN 978-90-481-8817-