A transfer principle and applications to eigenvalue estimates for graphs

In this paper, we prove a variant of the Burger-Brooks transfer principle which, combined with recent eigenvalue bounds for surfaces, allows to obtain upper bounds on the eigenvalues of graphs as a function of their genus. More precisely, we show the existence of a universal constants $C$ such that the $k$-th eigenvalue $\lambda_k^{nr}$ of the normalized Laplacian of a graph $G$ of (geometric) genus $g$ on $n$ vertices satisfies $$\lambda_k^{nr}(G) \leq C \frac{d_{\max}(g+k)}{n},$$ where $d_{\max}$ denotes the maximum valence of vertices of the graph. This result is tight up to a change in the value of the constant $C$, and improves recent results of Kelner, Lee, Price and Teng on bounded genus graphs. To show that the transfer theorem might be of independent interest, we relate eigenvalues of the Laplacian on a metric graph to the eigenvalues of its simple graph models, and discuss an application to the mesh partitioning problem, extending pioneering results of Miller-Teng-Thurston-Vavasis and Spielman-Tang to arbitrary meshes.Comment: Major revision, 16 page

Approximating the Spectrum of a Graph

The spectrum of a network or graph $G=(V,E)$ with adjacency matrix $A$, consists of the eigenvalues of the normalized Laplacian $L= I - D^{-1/2} A D^{-1/2}$. This set of eigenvalues encapsulates many aspects of the structure of the graph, including the extent to which the graph posses community structures at multiple scales. We study the problem of approximating the spectrum $\lambda = (\lambda_1,\dots,\lambda_{|V|})$, $0 \le \lambda_1,\le \dots, \le \lambda_{|V|}\le 2$ of $G$ in the regime where the graph is too large to explicitly calculate the spectrum. We present a sublinear time algorithm that, given the ability to query a random node in the graph and select a random neighbor of a given node, computes a succinct representation of an approximation $\widetilde \lambda = (\widetilde \lambda_1,\dots,\widetilde \lambda_{|V|})$, $0 \le \widetilde \lambda_1,\le \dots, \le \widetilde \lambda_{|V|}\le 2$ such that $\|\widetilde \lambda - \lambda\|_1 \le \epsilon |V|$. Our algorithm has query complexity and running time $exp(O(1/\epsilon))$, independent of the size of the graph, $|V|$. We demonstrate the practical viability of our algorithm on 15 different real-world graphs from the Stanford Large Network Dataset Collection, including social networks, academic collaboration graphs, and road networks. For the smallest of these graphs, we are able to validate the accuracy of our algorithm by explicitly calculating the true spectrum; for the larger graphs, such a calculation is computationally prohibitive. In addition we study the implications of our algorithm to property testing in the bounded degree graph model

Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations

This paper considers a particular case of the Optimal Homologous Chain Problem (OHCP) for integer modulo 2 coefficients, where optimality is meant as a minimal lexicographic order on chains induced by a total order on simplices. The matrix reduction algorithm used for persistent homology is used to derive polynomial algorithms solving this problem instance, whereas OHCP is NP-hard in the general case. The complexity is further improved to a quasilinear algorithm by leveraging a dual graph minimum cut formulation when the simplicial complex is a pseudomanifold. We then show how this particular instance of the problem is relevant, by providing an application in the context of point cloud triangulation

A Probabilistic Analysis of Kademlia Networks

Kademlia is currently the most widely used searching algorithm in P2P (peer-to-peer) networks. This work studies an essential question about Kademlia from a mathematical perspective: how long does it take to locate a node in the network? To answer it, we introduce a random graph K and study how many steps are needed to locate a given vertex in K using Kademlia's algorithm, which we call the routing time. Two slightly different versions of K are studied. In the first one, vertices of K are labelled with fixed IDs. In the second one, vertices are assumed to have randomly selected IDs. In both cases, we show that the routing time is about c*log(n), where n is the number of nodes in the network and c is an explicitly described constant.Comment: ISAAC 201

Chemical ionization tandem mass spectrometer for the in situ measurement of methyl hydrogen peroxide

A new approach for measuring gas-phase methyl hydrogen peroxide [(MHP) CH_3OOH] utilizing chemical ionization mass spectrometry is presented. Tandem mass spectrometry is used to avoid mass interferences that hindered previous attempts to measure atmospheric CH_3OOH with CF_3O− clustering chemistry. CH_3OOH has been successfully measured in situ using this technique during both airborne and ground-based campaigns. The accuracy and precision for the MHP measurement are a function of water vapor mixing ratio. Typical precision at 500 pptv MHP and 100 ppmv H_2O is ±80 pptv (2 sigma) for a 1 s integration period. The accuracy at 100 ppmv H_2O is estimated to be better than ±40%. Chemical ionization tandem mass spectrometry shows considerable promise for the determination of in situ atmospheric trace gas mixing ratios where isobaric compounds or mass interferences impede accurate measurements

Streaking images that appear only in the plane of diffraction in undoped GaAs single crystals: Diffraction imaging (topography) by monochromatic synchrotron radiation

Streaking images restricted to the direction of the diffraction (scattering) vector have been observed on transmission through undoped GaAs. These disruption images (caused by the reduction of diffraction in the direction of observation) appear both in the forward and in Bragg diffracted directions in monochromatic synchrontron radiation diffraction imaging. This previously unobserved phenomenon can be explained in terms of planar defects (interfaces) or platelets which affects the absorption coefficient in anomalous transmission. Such regions of the crystal look perfect despite the presence of imperfections when the scattering vector is not perpendicular to the normal of the platelets. The observed crystallographic orientation of these interfaces strongly indicates that they are antiphase boundaries

Sheep blowflies strike out!

Woolgrowers are constantly concerned that the sheep blowfly may be able to breed in sheep or other animal carcasses. David Cook, Ian Dadour and Ernis Steiner report on an experiment that answers that question once and for all