Matchability of heterogeneous networks pairs

We consider the problem of graph matchability in non-identically distributed networks. In a general class of edge-independent networks, we demonstrate that graph matchability is almost surely lost when matching the networks directly, and is almost perfectly recovered when first centering the networks using Universal Singular Value Thresholding before matching. These theoretical results are then demonstrated in both real and synthetic simulation settings. We also recover analogous core-matchability results in a very general core-junk network model, wherein some vertices do not correspond between the graph pair.First author draf

Should we be treating animal schistosomiasis in Africa? The need for a One Health economic evaluation of schistosomiasis control in people and their livestock

A One Health economic perspective allows informed decisions to be made regarding control priorities and/or implementation strategies for infectious diseases. Schistosomiasis is a major and highly resilient disease of both humans and livestock. The zoonotic component of transmission in sub-Saharan Africa appears to be more significant than previously assumed, and may thereby affect the recently revised WHO vision to eliminate schistosomiasis as a public health problem by 2025. Moreover, animal schistosomiasis is likely to be a significant cost to affected communities due to its direct and indirect impact on livelihoods. We argue here for a comprehensive evaluation of the economic burden of livestock and zoonotic schistosomiasis in sub-Saharan Africa in order to determine if extending treatment to include animal hosts in a One Health approach is economically, as well as epidemiologically, desirable

Matched Filters for Noisy Induced Subgraph Detection

The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision. We propose a solution to this problem via a graph matching matched filter: centering and padding the smaller adjacency matrix and applying graph matching methods to align it to the larger network. The centering and padding schemes can be incorporated into any algorithm that matches using adjacency matrices. Under a statistical model for correlated pairs of graphs, which yields a noisy copy of the small graph within the larger graph, the resulting optimization problem can be guaranteed to recover the true vertex correspondence between the networks. However, there are currently no efficient algorithms for solving this problem. To illustrate the possibilities and challenges of such problems, we use an algorithm that can exploit a partially known correspondence and show via varied simulations and applications to {\it Drosophila} and human connectomes that this approach can achieve good performance.Comment: 41 pages, 7 figure

Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks

Given a pair of graphs with the same number of vertices, the inexact graph matching problem consists in finding a correspondence between the vertices of these graphs that minimizes the total number of induced edge disagreements. We study this problem from a statistical framework in which one of the graphs is an errorfully observed copy of the other. We introduce a corrupting channel model, and show that in this model framework, the solution to the graph matching problem is a maximum likelihood estimator. Necessary and sufficient conditions for consistency of this MLE are presented, as well as a relaxed notion of consistency in which a negligible fraction of the vertices need not be matched correctly. The results are used to study matchability in several families of random graphs, including edge independent models, random regular graphs and small-world networks. We also use these results to introduce measures of matching feasibility, and experimentally validate the results on simulated and real-world networks

A nonparametric two-sample hypothesis testing problem for random dot product graphs

We consider the problem of testing whether two finite-dimensional random dot product graphs have generating latent positions that are independently drawn from the same distribution, or distributions that are related via scaling or projection. We propose a test statistic that is a kernel-based function of the adjacency spectral embedding for each graph. We obtain a limiting distribution for our test statistic under the null and we show that our test procedure is consistent across a broad range of alternatives.Comment: 24 pages, 1 figure

Plan for Continuing Earthquake Mitigation and Recommended Emergency Response Procedures for Western Kentucky

Concern has grown in recent years over the seismic activity of the New Madrid seismic zone in Western Kentucky. In 1987, the Kentucky Transportation Cabinet commissioned the Kentucky Transportation Center to analyze and assess the possible effects of an earthquake on highway facilities. Since 1987, over 1,000 miles of priority routes have been recommended for the transportation of goods and services after a major earthquake. This report summarizes the mitigation research that has been conducted. This report also discusses a plan for continuing earthquake mitigation in Kentucky through seminars, discusses bridge retrofitting, and makes recommendations for a post earthquake response

Poly-arginine peptide R18D reduces neuroinflammation and functional deficits following traumatic brain injury in the Long-Evans rat

We have previously demonstrated that the poly-arginine peptide R18 can improve histological and functional outcomes following traumatic brain injury (TBI) in the Sprague–Dawley rat. Since D-enantiomer peptides are often exploited in pharmacology for their increased stability and potency, the present study compared the effects of R18 and its D-enantiomer, R18D, following TBI in the Long-Evans rat. Following a closed-head impact delivered via a weight-drop apparatus, peptide was administered at a dose of 1000 nmol/kg at 30 min after TBI. Treatment with R18D, but not R18 resulted in significant reductions in sensorimotor (p = 0.026) and vestibulomotor (p = 0.049) deficits as measured by the adhesive tape removal and rotarod tests. Furthermore, treatment with R18 and R18D resulted in a significant reduction in brain protein levels of the astrocytic marker, glial fibrillary acidic protein (p = 0.019 and 0.048, respectively). These results further highlight the beneficial effects of poly-arginine peptides in TBI, however additional studies are required to confirm these positive effects