Search

We propose a generic spatiotemporal event forecasting method, which we developed for the National Institute of Justice's (NIJ) Real-Time Crime Forecasting Challenge. Our method is a spatiotemporal forecasting model combining scalable randomized Reproducing Kernel Hilbert Space (RKHS) methods for approximating Gaussian processes with autoregressive smoothing kernels in a regularized supervised learning framework. While the smoothing kernels capture the two main approaches in current use in the field of crime forecasting, kernel density estimation (KDE) and self-exciting point process (SEPP) models, the RKHS component of the model can be understood as an approximation to the popular log-Gaussian Cox Process model. For inference, we discretize the spatiotemporal point pattern and learn a log-intensity function using the Poisson likelihood and highly efficient gradient-based optimization methods. Model hyperparameters including quality of RKHS approximation, spatial and temporal kernel lengthscales, number of autoregressive lags, bandwidths for smoothing kernels, as well as cell shape, size, and rotation, were learned using crossvalidation. Resulting predictions significantly exceeded baseline KDE estimates and SEPP models for sparse events.

The strong interaction of light with metallic nanoparticles enables field confinement well below the diffraction limit. Plasmonic waveguides consisting of metal nanoparticle chains could be used for the propagation of energy or information on the nanoscale, but high losses have thus far impeded practical applications. Here we demonstrate that efficient waveguiding is possible through gold nanoparticle chains despite the high dissipative losses of gold. A DNA origami directed self-assembly of monocrystalline, spherical nanoparticles allows the interparticle spacing to be decreased to 2 nm or below, which gives rise to lower-energy plasmon resonance modes. Our simulations imply that these lower energy modes allow efficient waveguiding but collapse if interparticle gap sizes are increased. Individual waveguides are characterized with nanometer-resolution by electron energy loss spectroscopy, and directed propagation of energy towards a fluorescent nanodiamond and nanoscale energy conversion is shown by cathodoluminescence imaging spectroscopy on a single-device level. With this approach, micrometer-long propagation lengths might be achieved, enabling applications in information technology, sensing and quantum optics.

Assume we are given a set of parallel line segments in the plane, and we wish to place a point on each line segment such that the resulting point set maximizes or minimizes the area of the largest or smallest triangle in the set. We analyze the complexity of the four resulting computational problems, and we show that three of them admit polynomial-time algorithms, while the fourth is NP-hard. Specifically, we show that maximizing the largest triangle can be done in $O(n^2)$ time (or in $O(n \log n)$ time for unit segments); minimizing the largest triangle can be done in $O(n^2 \log n)$ time; maximizing the smallest triangle is NP-hard; but minimizing the smallest triangle can be done in $O(n^2)$ time. We also discuss to what extent our results can be generalized to polygons with $k>3$ sides.

We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with worst-case constant time updates in constant dimensions. We distinguish two versions of the problem. First, we show that quadtrees as a space-division data structure can be made smooth and dynamic subject to split and merge operations on the quadtree cells. Second, we show that quadtrees used to store a set of points in $\mathbb{R}^d$ can be made smooth and dynamic subject to insertions and deletions of points. The second version uses the first but must additionally deal with compression and alignment of quadtree components. In both cases our updates take $2^{\mathcal{O}(d\log d )}$ time, except for the point location part in the second version which has a lower bound of $\Theta (\log n)$---but if a pointer (finger) to the correct quadtree cell is given, the rest of the updates take worst-case constant time. Our result implies that several classic and recent results (ranging from ray tracing to planar point location) in computational geometry which use quadtrees can deal with arbitrary point sets on a real RAM pointer machine., Comment: Full version of the accepted SOCG submission

In 1992 a puzzling transition was discovered in simulations of randomly coupled limit-cycle oscillators. This so-called volcano transition has resisted analysis ever since. It was originally conjectured to mark the emergence of an oscillator glass, but here we show it need not. We introduce and solve a simpler model with a qualitatively identical volcano transition and find, unexpectedly, that its supercritical state is not glassy. We discuss the implications for the original model and suggest experimental systems in which a volcano transition and oscillator glass may appear., Comment: 5 pages, 4 figures

We report that the irreversible magnetization switching process in ferromagnetic nanoparticles is governed by the formation and dynamics of topological point-defects in the form of hedgehog-antihedgehog pairs. After nucleation, these pairs rapidly separate with speeds exceeding domain wall velocities, and they generate an emergent electric field of solenoidal character and substantial magnitude., Comment: 6 pages, 4 figures

We have implemented a new way of computing three-point correlation functions. It is based on a factorization of the entire correlation function into two parts which are evaluated with open spin- (and to some extent flavor-) indices. This allows us to estimate the two contributions simultaneously for many different initial and final states and momenta, with little computational overhead. We explain this factorization as well as its efficient implementation in a new library which has been written to provide the necessary functionality on modern parallel architectures and on CPUs, including Intel's Xeon Phi series., Comment: 7 pages, 5 figures, Proceedings of Lattice 2017

The recently discovered minor body 1I/2017 U1 (`Oumuamua) is the first known object in our Solar System that is not bound by the Sun's gravity. Its hyperbolic orbit (eccentricity greater than unity) strongly suggests that it originated outside our Solar System; its red color is consistent with substantial space weathering experienced over a long interstellar journey. We carry out an simple calculation of the probability of detecting such an object. We find that the observed detection rate of 1I-like objects can be satisfied if the average mass of ejected material from nearby stars during the process of planetary formation is ~20 Earth masses, similar to the expected value for our Solar System. The current detection rate of such interstellar interlopers is estimated to be 0.2/year, and the expected number of detections over the past few years is almost exactly one. When the Large Synoptic Survey Telescope begins its wide, fast, deep all-sky survey the detection rate will increase to 1/year. Those expected detections will provide further constraints on nearby planetary system formation through a better estimate of the number and properties of interstellar objects., Comment: In press at ApJL; this version includes updates from the review process

Euler systems are certain compatible families of cohomology classes, which play a key role in studying the arithmetic of Galois representations. We briefly survey the known Euler systems, and recall a standard conjecture of Perrin-Riou predicting what kind of Euler system one should expect for a general Galois representation. Surprisingly, several recent constructions of Euler systems do not seem to fit the predictions of this conjecture, and we formulate a more general conjecture which explains these extra objects. The novel aspect of our conjecture is that it predicts that there should often be Euler systems of several different ranks associated to a given Galois representation, and we describe how we expect these objects to be related., Comment: Expository article, 13 pages. To appear in proceedings of the Iwasawa 2017 conference

Knot and link diagrams are projections of one or more 3-dimensional simple closed curves into $R^2$, such that no more than two points project to the same point in $R^2$. These diagrams are drawings of 4-regular plane multigraphs. Knots are typically smooth curves in $R^3$, so their projections should be smooth curves in $R^2$ with good continuity and large crossing angles: exactly the properties of Lombardi graph drawings (defined by circular-arc edges and perfect angular resolution). We show that several knots do not allow plane Lombardi drawings. On the other hand, we identify a large class of 4-regular plane multigraphs that do have Lombardi drawings. We then study two relaxations of Lombardi drawings and show that every knot admits a plane 2-Lombardi drawing (where edges are composed of two circular arcs). Further, every knot is near-Lombardi, that is, it can be drawn as Lombardi drawing when relaxing the angular resolution requirement by an arbitrary small angular offset $\varepsilon$, while maintaining a $180^\circ$ angle between opposite edges., Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017)

We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., \emph{convex drawings}. We consider two families of graph classes with convex drawings: \emph{outer $k$-planar} graphs, where each edge is crossed by at most $k$ other edges; and, \emph{outer $k$-quasi-planar} graphs where no $k$ edges can mutually cross. We show that the outer $k$-planar graphs are $\lfloor3.5\sqrt{k}\rfloor$-degenerate, and consequently that every outer $k$-planar graph can be colored with $\lfloor3.5\sqrt{k}\rfloor + 1$ colors. We further show that every outer $k$-planar graph has a balanced vertex separator of size at most $2k+3$. For each fixed $k$, these small balanced separators allow us to test outer $k$-planarity in quasi-polynomial time, e.g., this implies that none of these recognition problems is NP-hard unless the Exponential Time Hypothesis fails. We also show that the class of outer $k$-quasi-planar graphs and the class of planar graphs are incomparable. Finally, we restrict outer $k$-planar and outer $k$-quasi-planar drawings to \emph{full} drawings (where no crossing appears on the boundary of the outer face) and to \emph{closed} drawings (where the vertex sequence on the boundary of the outer face is a Hamiltonian cycle in the graph). For each $k$, we express \emph{closed outer $k$-planarity} and \emph{closed outer $k$-quasi-planarity} in \emph{extended monadic second-order logic}. Due to a result of Wood and Telle (New York J. Math., 2007) every outer $k$-planar graph has treewidth at most $3k+11$. Thus, Courcelle's theorem implies that closed outer $k$-planarity is linear time testable. We leverage this result to further show that full outer $k$-planarity can also be tested in linear time., Comment: Has appeared in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017)

We study principal component analysis (PCA) for mean zero i.i.d. Gaussian observations $X_1,\dots, X_n$ in a separable Hilbert space $\mathbb{H}$ with unknown covariance operator $\Sigma.$ The complexity of the problem is characterized by its effective rank ${\bf r}(\Sigma):= \frac{{\rm tr}(\Sigma)}{\|\Sigma\|},$ where ${\rm tr}(\Sigma)$ denotes the trace of $\Sigma$ and $\|\Sigma\|$ denotes its operator norm. We develop a method of bias reduction in the problem of estimation of linear functionals of eigenvectors of $\Sigma.$ Under the assumption that ${\bf r}(\Sigma)=o(n),$ we establish the asymptotic normality and asymptotic properties of the risk of the resulting estimators and prove matching minimax lower bounds, showing their semi-parametric optimality., Comment: 48 pages, to appear in Annals of Statistics

In this note we show by example that the algorithm presented in 1979 by Dobkin and Snyder for finding the largest-area k-gon that is inscribed in a convex polygon fails to find the optimal solution for k=4. This question, posed by Keikha et al. where they showed that the Dobkin Snyder algorithm fails for k=3., Comment: 6 pages. arXiv admin note: substantial text overlap with arXiv:1705.11035

Trapping molecular ions that have been sympathetically cooled with laser-cooled atomic ions is a useful platform for exploring cold ion chemistry. We designed and characterized a new experimental apparatus for probing chemical reaction dynamics between molecular cations and neutral radicals at temperatures below 1 K. The ions are trapped in a linear quadrupole radio-frequency trap and sympathetically cooled by co-trapped, laser-cooled, atomic ions. The ion trap is coupled to a time-of-flight mass spectrometer to readily identify product ion species, as well as to accurately determine trapped ion numbers. We discuss, and present in detail, the design of this ion trap time-of-flight mass spectrometer, as well as the electronics required for driving the trap and mass spectrometer. Furthermore, we measure the performance of this system, which yields mass resolutions of $m/\Delta{}m \geq 1100$ over a wide mass range, and discuss its relevance for future measurements in chemical reaction kinetics and dynamics., Comment: 9 pages, 9 figures

We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph $GK_n$ on any set $S$ of $n$ points in general position in the plane? We show that this number is in $\Omega(\sqrt{n})$. Further, we consider variants of this problem by bounding the diameter and the degree of the trees (in particular considering spanning paths)., Comment: This work was presented at the 26th Canadian Conference on Computational Geometry (CCCG 2014), Halifax, Nova Scotia, Canada, 2014. The journal version appeared in Information Processing Letters, 124 (2017), 35--41

In this work we analyze the gravitational wave signal from hypermassive neutron stars formed after the merger of binary neutron star systems, focusing on its spectral features. The gravitational wave signals are extracted from numerical relativity simulations of models already considered by De Pietri et al. [Phys. Rev. D 93, 064047 (2016)], Maione et al. [Classical Quantum Gravity 33, 175009 (2016)], and Feo et al. [Classical Quantum Gravity 34, 034001 (2017)], and allow us to study the effect of the total baryonic mass of such systems (from $2.4 M_{\odot}$ to $3 M_{\odot}$), the mass ratio (up to $q = 0.77$), and the neutron star equation of state, both in equal and highly unequal mass binaries. We use the peaks we find in the gravitational spectrum as an independent test of already published hypotheses of their physical origin and empirical relations linking them with the characteristics of the merging neutron stars. In particular, we highlight the effects of the mass ratio, which in the past was often neglected. We also analyze the temporal evolution of the emission frequencies. Finally, we introduce a modern variant of Prony's method to analyze the gravitational wave postmerger emission as a sum of complex exponentials, trying to overcome some drawbacks of both Fourier spectra and least-squares fitting. Overall, the spectral properties of the postmerger signal observed in our simulation are in agreement with those proposed by other groups. More specifically, we find that the analysis of Bauswein and Stergioulas [Phys. Rev. D 91, 124056 (2015)] is particularly effective for binaries with very low masses or with a small mass ratio and that the mechanical toy model of Takami et al. [Phys. Rev. D 91, 064001 (2015)] provides a comprehensive and accurate description of the early stages of the postmerger., Comment: 19 pages, 6 figures

Exciton-polaritons are a coherent electron-hole-photon (e-h-p) system where condensation has been observed in semiconductor microcavities. In contrast to equilibrium Bose-Einstein condensation (BEC) for long lifetime systems, polariton condensates have a dynamical nonequilibrium feature owing to the similar physical structure that they have to semiconductor lasers. One of the distinguishing features of a condensate to a laser is the presence of strong coupling between the matter and photon fields. Irrespective of its equilibrium or nonequilibrium nature, exciton-polariton have been observed to maintain strong coupling. We show that by investigating high density regime of exciton-polariton condensates, the negative branch directly observed in photoluminescence. This is evidence that the present e-h-p system is still in the strong coupling regime, contrary to past results where the system reduced to standard lasing at high density., Comment: 5 pages

Energy-loss magnetic chiral dichroism (EMCD) is a versatile method for studying magnetic properties on the nanoscale. However, the classical EMCD technique is notorious for its low signal to noise ratio (SNR). Here, we study the theoretical possibilities of using a convergent beam for EMCD. In particular, we study the influence of detector positioning as well as convergence and collection angles on the detectable EMCD signal. In addition, we analyze the expected SNR and give guidelines for achieving optimal EMCD results.

We construct an Euler system for Galois representations associated to cohomological cuspidal automorphic representations of the group GSp(4), using the pushforwards of Eisenstein classes for GL(2) x GL(2)., Comment: 41 pages. To appear in "Journal of the European Mathematical Society" (see https://www.ems-ph.org/journals/forthcoming.php?jrn=jems )

We revisit the following problem: Given a convex polygon $P$, find the largest-area inscribed triangle. We show by example that the linear-time algorithm presented in 1979 by Dobkin and Snyder for solving this problem fails. We then proceed to show that with a small adaptation, their approach does lead to a quadratic-time algorithm. We also present a more involved $O(n\log n)$ time divide-and-conquer algorithm. Also we show by example that the algorithm presented in 1979 by Dobkin and Snyder for finding the largest-area $k$-gon that is inscribed in a convex polygon fails to find the optimal solution for $k=4$. Finally, we discuss the implications of our discoveries on the literature.

A high-fidelity source of identical single photons is essential for numerous quantum technologies such as quantum repeaters and optical quantum information processing. Hallmarks thereof are a near-unity single-photon purity, near-unity indistinguishability of consecutively emitted photons, and high brightness through a near-unity number of photons per time bin. In order to embed such sources in quantum networks, optical fiber integration is essential but complicated by cryogenic compatability and noise. Here we demonstrate a resonantly pumped, quantum dot (QD) based, transmission operated, single-mode fiber coupled single photon source with a purity of 97%, indistinguishability of 90%, and a brightness of 17%. This is achieved by deploying a unique micropillar cavity design in a closed-cycle cryostat, which is operated using a through-fiber cross-polarization technique to remove the pump laser light from the resonantly scattered single photons. These results pave the way for fully fiber integrated photonic quantum networks, as our technology is equally applicable for cavity-QED based photonic quantum gates., Comment: 10 pages, 10 figures

Parallaxes for 331 classical Cepheids, 31 Type II Cepheids and 364 RR Lyrae stars in common between Gaia and the Hipparcos and Tycho-2 catalogues are published in Gaia Data Release 1 (DR1) as part of the Tycho-Gaia Astrometric Solution (TGAS). In order to test these first parallax measurements of the primary standard candles of the cosmological distance ladder, that involve astrometry collected by Gaia during the initial 14 months of science operation, we compared them with literature estimates and derived new period-luminosity ($PL$), period-Wesenheit ($PW$) relations for classical and Type II Cepheids and infrared $PL$, $PL$-metallicity ($PLZ$) and optical luminosity-metallicity ($M_V$-[Fe/H]) relations for the RR Lyrae stars, with zero points based on TGAS. The new relations were computed using multi-band ($V,I,J,K_{\mathrm{s}},W_{1}$) photometry and spectroscopic metal abundances available in the literature, and applying three alternative approaches: (i) by linear least squares fitting the absolute magnitudes inferred from direct transformation of the TGAS parallaxes, (ii) by adopting astrometric-based luminosities, and (iii) using a Bayesian fitting approach. TGAS parallaxes bring a significant added value to the previous Hipparcos estimates. The relations presented in this paper represent first Gaia-calibrated relations and form a "work-in-progress" milestone report in the wait for Gaia-only parallaxes of which a first solution will become available with Gaia's Data Release 2 (DR2) in 2018., Comment: 29 pages, 25 figures. Accepted for publication by A&A

We prove an interpolation formula for the values of certain $p$-adic Rankin--Selberg $L$-functions associated to non-ordinary modular forms., Comment: Updated version, with minor corrections. To appear in Canad. Math. Bulletin

In the present note we consider the problem of constructing honest and adaptive confidence sets for the matrix completion problem. For the Bernoulli model with known variance of the noise we provide a realizable method for constructing confidence sets that adapt to the unknown rank of the true matrix.

We discuss the feasibility of detecting spin polarized electronic transitions with a vortex filter. This approach does not rely on the principal condition of the standard energy loss magnetic chiral dichroism (EMCD) technique, the precise alignment of the crystal, and thus paves the way for the application of EMCD to new classes of materials and problems. The dichroic signal strength in the L$_{2,3}$-edge of ferromagnetic cobalt is estimated on theoretical grounds. It is shown that magnetic dichroism can, in principle, be detected. However, as an experimental test shows, count rates are currently too low under standard conditions.

Standard electron optics predicts Larmor image rotation in the magnetic lens field of a TEM. Introducing the possibility to produce electron vortex beams with quantized orbital angular momentum brought up the question of their rotational dynamics in the presence of a magnetic field. Recently, it has been shown that electron vortex beams can be prepared as free electron Landau states showing peculiar rotational dynamics, including no and cyclotron (double-Larmor) rotation. Additionally very fast Gouy rotation of electron vortex beams has been observed. In this work a model is developed which reveals that the rotational dynamics of electron vortices are a combination of slow Larmor and fast Gouy rotations and that the Landau states naturally occur in the transition region in between the two regimes. This more general picture is confirmed by experimental data showing an extended set of peculiar rotations, including no, cyclotron, Larmor and rapid Gouy rotations all present in one single convergent electron vortex beam.

We study a stochastic model of infection spreading on a network. At each time step a node is chosen at random, along with one of its neighbors. If the node is infected and the neighbor is susceptible, the neighbor becomes infected. How many time steps $T$ does it take to completely infect a network of $N$ nodes, starting from a single infected node? An analogy to the classic "coupon collector" problem of probability theory reveals that the takeover time $T$ is dominated by extremal behavior, either when there are only a few infected nodes near the start of the process or a few susceptible nodes near the end. We show that for $N \gg 1$, the takeover time $T$ is distributed as a Gumbel for the star graph; as the sum of two Gumbels for a complete graph and an Erd\H{o}s-R\'{e}nyi random graph; as a normal for a one-dimensional ring and a two-dimensional lattice; and as a family of intermediate skewed distributions for $d$-dimensional lattices with $d \ge 3$ (these distributions approach the sum of two Gumbels as $d$ approaches infinity). Connections to evolutionary dynamics, cancer, incubation periods of infectious diseases, first-passage percolation, and other spreading phenomena in biology and physics are discussed., Comment: 19 pages, 10 figures