We study geodesics in the random metric space called the Brownian map, which appears as the scaling limit of large planar maps. In particular, we completely describe geodesics starting from the distinguished point called the root, and we characterize the set$S$of all points that are connected to the root by more than one geodesic. The set$S$is dense in the Brownian map and homeomorphic to a non-compact real tree. Furthermore, for every$x$in$S$, the number of distinct geodesics from x to the root is equal to the number of connected components of$S$\{$x$}. In particular, points of the Brownian map can be connected to the root by at most three distinct geodesics. Our results have applications to the behavior of geodesics in large planar maps.

Over time, a population acquires neutral genetic substitutions as a consequence of random drift. A famous result in population genetics asserts that the rate, K, at which these substitutions accumulate in the population coincides with the mutation rate, u, at which they arise in individuals: K = u. This identity enables genetic sequence data to be used as a “molecular clock” to estimate the timing of evolutionary events. While the molecular clock is known to be perturbed by selection, it is thought that K = u holds very generally for neutral evolution. Here we show that asymmetric spatial population structure can alter the molecular clock rate for neutral mutations, leading to either K<u or K>u. Our results apply to a general class of haploid, asexually reproducing, spatially structured populations. Deviations from K = u occur because mutations arise unequally at different sites and have different probabilities of fixation depending on where they arise. If birth rates are uniform across sites, then K
u. In general, K can take any value between 0 and Nu. Our model can be applied to a variety of population structures. In one example, we investigate the accumulation of genetic mutations in the small intestine. In another application, we analyze over 900 Twitter networks to study the effect of network topology on the fixation of neutral innovations in social evolution.

Let X be an algebraic variety and let S be a tropical variety associated to X. We study the tropicalization map from the moduli space of stable maps into X to the moduli space of tropical curves in S. We prove that it is a continuous map and that its image is compact and polyhedral. Loosely speaking, when we deform algebraic curves in X, the associated tropical curves in S deform continuously; moreover, the locus of realizable tropical curves inside the space of all tropical curves is compact and polyhedral. Our main tools are Berkovich spaces, formal models, balancing conditions, vanishing cycles and quantifier elimination for rigid subanalytic sets.

In this paper, we study the Pontryagin numbers of 24 dimensional String manifolds. In partic- ular, we find representatives of an integral basis of the String cobrodism group at dimension 24, based on the work of Mahowald and Hopkins (The structure of 24 dimensional manifolds having normal bundles which lift to B O [8], from “Recent progress in homotopy theory” (D. M. Davis, J. Morava, G. Nishida, W. S. Wilson, N. Yagita, editors), Contemp. Math. 293, Amer. Math. Soc., Providence, RI, 89-110, 2002), Borel and Hirzebruch (Am J Math 80: 459–538, 1958) and Wall (Ann Math 75:163–198, 1962). This has immediate applications on the divisibility of various characteristic numbers of the manifolds. In particular, we establish the 2-primary divisibilities of the signature and of the modified signature coupling with the integral Wu class of Hopkins and Singer (J Differ Geom 70:329–452, 2005), and also the 3- primary divisibility of the twisted signature. Our results provide potential clues to understand a question of Teichner.

This article focuses on the discrete double-curl operator arising in the Maxwell equation that models three dimensional photonic crystals with face centered cubic lattice. The discrete double-curl operator is the degenerate coefficient matrix of the generalized eigenvalue problems (GEVP) due to the Maxwell equation. We derive an eigendecomposition of the degenerate coefficient matrix and explore an explicit form of orthogonal basis for the range and null spaces of this matrix. To solve the GEVP, we apply these theoretical results to project the GEVP to a standard eigenvalue problem (SEVP), which involves only the eigenspace associated with the nonzero eigenvalues of the GEVP and therefore the zero eigenvalues are excluded and will not degrade the computational efficiency. This projected SEVP can be solved efficiently by the inverse Lanczos method. The linear systems within the inverse Lanczos method are well-conditioned and can be solved efficiently by the conjugate gradient method without using a preconditioner. We also demonstrate how two forms of matrix-vector multiplications, which are the most costly part of the inverse Lanczos method, can be computed by fast Fourier transformation due to the eigendecomposition to significantly reduce the computation cost. Integrating all of these findings and techniques, we obtain a fast eigenvalue solver. The solver has been implemented by MATLAB and successfully solves each of a set of $5.184$ million dimension eigenvalue problems within $50$ to $104$ minutes on a workstation with two Intel Quad-C ore Xeon X5687 3.6 GHz CPUs.