Search

We establish functional limit theorems for local, additive, interaction functions of temporally evolving point processes. The dynamics are those of a spatial Poisson process on the flat torus with points subject to a birth-death mechanism, and which move according to Brownian motion while alive. The results reveal the existence of a phase diagram describing at least three distinct structures for the limiting processes, depending on the extent of the local interactions and the speed of the Brownian motions. The proofs, which identify three different limits, rely heavily on Malliavin-Stein bounds on a representation of the dynamic point process via a distributionally equivalent marked point process.

We present normal approximation results at the process level for local functionals defined on dynamic Poisson processes in $\mathbb{R}^d$. The dynamics we study here are those of a Markov birth-death process. We prove functional limit theorems in the so-called thermodynamic regime. Our results are applicable to several functionals of interest in the stochastic geometry literature, including subgraph and component counts in the random geometric graphs.

In this paper we study the spectrum of the random geometric graph $G(n,r)$, in a regime where the graph is dense and highly connected. In the \erdren $G(n,p)$ random graph it is well known that upon connectivity the spectrum of the normalized graph Laplacian is concentrated around $1$. We show that such concentration does not occur in the $G(n,r)$ case, even when the graph is dense and almost a complete graph. In particular, we show that the limiting spectral gap is strictly smaller than $1$. In the special case where the vertices are distributed uniformly in the unit cube and $r=1$, we show that for every $0\le k \le d$ there are at least $\binom{d}{k}$ eigenvalues near $1-2^{-k}$, and the limiting spectral gap is exactly $1/2$. We also show that the corresponding eigenfunctions in this case are tightly related to the geometric configuration of the points., Comment: 32 pages, 2 figures

We study the topology generated by the temperature fluctuations of the Cosmic Microwave Background (CMB) radiation, as quantified by the number of components and holes, formally given by the Betti numbers, in the growing excursion sets. We compare CMB maps observed by the Planck satellite with a thousand simulated maps generated according to the LCDM paradigm with Gaussian distributed fluctuations. The survey of the CMB over $\mathbb{S}^2$ is incomplete due to obfuscation effects by bright point sources and other extended foreground objects like our own galaxy. To deal with such situations, where analysis in the presence of "masks" is of importance, we introduce the concept of relative homology. The parametric $\chi^2$-test shows differences between observations and simulations, yielding $p$-values at per-cent to less than per-mil levels roughly between 2 to 7 degrees. The highest observed deviation for $b_0$ and $b_1$ is approximately between $3\sigma$-4$\sigma$ at scales of 3 to 7 degrees. There are reports of mildly unusual behaviour of the Euler characteristic at 3.66 degrees in the literature, computed from independent measurements of the CMB temperature fluctuations by Planck's predecessor WMAP satellite. The mildly anomalous behaviour of Euler characteristic is related to the strongly anomalous behaviour of components and holes. These are also the scales at which the observed maps exhibit low variance compared to the simulations. Non-parametric tests show even stronger differences at almost all scales. Regardless, beyond the trivial possibility that this may still be a manifestation of an extreme Gaussian case, these observations, along with the super-horizon scales involved, may motivate to look at primordial non-Gaussianity. Alternative scenarios worth exploring may be models with non-trivial topology., Comment: 18 pages, 16 figures, 3 tables, submitted to Astronomy \& Astrophysics

This study presents a numerical analysis of the topology of a set of cosmologically interesting three-dimensional Gaussian random fields in terms of their Betti numbers $\beta_0$, $\beta_1$ and $\beta_2$. We show that Betti numbers entail a considerably richer characterization of the topology of the primordial density field. Of particular interest is that Betti numbers specify which topological features - islands, cavities or tunnels - define its spatial structure. A principal characteristic of Gaussian fields is that the three Betti numbers dominate the topology at different density ranges. At extreme density levels, the topology is dominated by a single class of features. At low levels this is a \emph{Swiss-cheeselike} topology, dominated by isolated cavities, at high levels a predominantly \emph{Meatball-like} topology of isolated objects. At moderate density levels, two Betti number define a more \emph{Sponge-like} topology. At mean density, the topology even needs three Betti numbers, quantifying a field consisting of several disconnected complexes, not of one connected and percolating overdensity. A {\it second} important aspect of Betti number statistics is that they are sensitive to the power spectrum. It reveals a monotonic trend in which at a moderate density range a lower spectral index corresponds to a considerably higher (relative) population of cavities and islands. We also assess the level of complementary information that Betti numbers represent, in addition to conventional measures such as Minkowski functionals. To this end, we include an extensive description of the Gaussian Kinematic Formula (GKF), which represents a major theoretical underpinning for this discussion., Comment: 44 pages, 27 Figures, 2 Tables, accepted for publication in MNRAS in the original version. This version updates references and fixes typos

We introduce a new model for planar point point processes, with the aim of capturing the structure of point interaction and spread in persistence diagrams. Persistence diagrams themselves are a key tool of TDA (topological data analysis), crucial for the delineation and estimation of global topological structure in large data sets. To a large extent, the statistical analysis of persistence diagrams has been hindered by difficulties in providing replications, a problem that was addressed in an earlier paper, which introduced a procedure called RST (replicating statistical topology). Here we significantly improve on the power of RST via the introduction of a more realistic class of models for the persistence diagrams. In addition, we introduce to TDA the idea of bagplotting, a powerful technique from non-parametric statistics well adapted for differentiating between topologically significant points, and noise, in persistence diagrams. Outside the setting of TDA, our model provides a setting for fashioning point processes, in any dimension, in which both local interactions between the points, along with global restraints on the general point cloud, are important and perhaps competing., Comment: 37 pages, 20 figures, 5 tables

Topological Data Analysis (TDA) is a novel statistical technique, particularly powerful for the analysis of large and high dimensional data sets. Much of TDA is based on the tool of persistent homology, represented visually via persistence diagrams. In an earlier paper we proposed a parametric representation for the probability distributions of persistence diagrams, and based on it provided a method for their replication. Since the typical situation for big data is that only one persistence diagram is available, these replications allow for conventional statistical inference, which, by its very nature, requires some form of replication. In the current paper we continue this analysis, and further develop its practical statistical methodology, by investigating a wider class of examples than treated previously.

We continue the study, begun in \cite{FA}, of the critical radius of embeddings, via deterministic spherical harmonics, of fixed dimensional spheres into higher dimensional ones, along with the associated problem of the distribution of the suprema of random spherical harmonics. Whereas \cite{FA} concentrated on spherical harmonics of a common degree, here we extend the results to mixed degrees, obtaining larger lower bounds on critical radii than we found previously., Comment: 1 figure

We introduce Lipschitz-Killing curvature (LKC) regression, a new method to produce $(1-\alpha)$ thresholds for signal detection in random fields that does not require knowledge of the spatial correlation structure. The idea is to fit observed empirical Euler characteristics to the Gaussian kinematic formula via generalized least squares, which quickly and easily provides statistical estimates of the LKCs --- complex topological quantities that can be extremely challenging to compute, both theoretically and numerically. With these estimates, we can then make use of a powerful parametric approximation via Euler characteristics for Gaussian random fields to generate accurate $(1-\alpha)$ thresholds and $p$-values. The main features of our proposed LKC regression method are easy implementation, conceptual simplicity, and facilitated diagnostics, which we demonstrate in a variety of simulations and applications., Comment: 35 pages, 13 figures. 3 tables

Under the banner of `Big Data', the detection and classification of structure in extremely large, high dimensional, data sets, is, one of the central statistical challenges of our times. Among the most intriguing approaches to this challenge is `TDA', or `Topological Data Analysis', one of the primary aims of which is providing non-metric, but topologically informative, pre-analyses of data sets which make later, more quantitative analyses feasible. While TDA rests on strong mathematical foundations from Topology, in applications it has faced challenges due to an inability to handle issues of statistical reliability and robustness and, most importantly, in an inability to make scientific claims with verifiable levels of statistical confidence. We propose a methodology for the parametric representation, estimation, and replication of persistence diagrams, the main diagnostic tool of TDA. The power of the methodology lies in the fact that even if only one persistence diagram is available for analysis -- the typical case for big data applications -- replications can be generated to allow for conventional statistical hypothesis testing. The methodology is conceptually simple and computationally practical, and provides a broadly effective statistical procedure for persistence diagram TDA analysis. We demonstrate the basic ideas on a toy example, and the power of the approach in a novel and revealing analysis of CMB non-homogeneity.

We first consider {\it deterministic} immersions of the $d$-dimensional sphere into high dimensional Euclidean spaces, where the immersion is via spherical harmonics of level $n$. The main result of the article is the, a priori unexpected, fact that there is a uniform lower bound to the critical radius of the immersions as $n\to\infty$. This fact has immediate implications for {\it random} spherical harmonics with fixed $L^2$-norm. In particular, it leads to an exact and explicit formulae for the tail probability of their (large deviation) suprema by the tube formula, and also relates this to the expected Euler characteristic of their upper level sets., Comment: 2 figures

We study the a.s. convergence of a sequence of random embeddings of a fixed manifold into Euclidean spaces of increasing dimensions. We show that the limit is deterministic. As a consequence, we show that many intrinsic functionals of the embedded manifolds also converge to deterministic limits. Particularly interesting examples of these functionals are given by the Lipschitz-Killing curvatures, for which we also prove unbiasedness, using the Gaussian kinematic formula., Comment: 11 pages

Euler integrals of deterministic functions have recently been shown to have a wide variety of possible applications, including in signal processing, data aggregation and network sensing. Adding random noise to these scenarios, as is natural in the majority of applications, leads to a need for statistical analysis, the first step of which requires asymptotic distribution results for estimators. The first such result is provided in this paper, as a central limit theorem for the Euler integral of pure, Gaussian, noise fields., Comment: 34 pages

We study the asymptotic nature of geometric structures formed from a point cloud of observations of (generally heavy tailed) distributions in a Euclidean space of dimension greater than one. A typical example is given by the Betti numbers of \v{C}ech complexes built over the cloud. The structure of dependence and sparcity (away from the origin) generated by these distributions leads to limit laws expressible via non-homogeneous, random, Poisson measures. The parametrisation of the limits depends on both the tail decay rate of the observations and the particular geometric constraint being considered. The main theorems of the paper generate a new class of results in the well established theory of extreme values, while their applications are of significance for the fledgling area of rigorous results in topological data analysis. In particular, they provide a broad theory for the empirically well-known phenomenon of homological `crackle'; the continued presence of spurious homology in samples of topological structures, despite increased sample size.

Motivated by questions of manifold learning, we study a sequence of random manifolds, generated by embedding a fixed, compact manifold $M$ into Euclidean spheres of increasing dimension via a sequence of Gaussian mappings. One of the fundamental smoothness parameters of manifold learning theorems is the reach, or critical radius, of $M$. Roughly speaking, the reach is a measure of a manifold's departure from convexity, which incorporates both local curvature and global topology. This paper develops limit theory for the reach of a family of random, Gaussian-embedded, manifolds, establishing both almost sure convergence for the global reach, and a fluctuation theory for both it and its local version. The global reach converges to a constant well known both in the reproducing kernel Hilbert space theory of Gaussian processes, as well as in their extremal theory., Comment: 38 pages. Removed motivational material from the previous version

We consider the topology of simplicial complexes with vertices the points of a random point process and faces determined by distance relationships between the vertices. In particular, we study the Betti numbers of these complexes as the number of vertices becomes large, obtaining limit theorems for means, strong laws, concentration inequalities and central limit theorems. As opposed to most prior papers treating random complexes, the limit with which we work is in the so-called `thermodynamic' regime (which includes the percolation threshold) in which the complexes become very large and complicated, with complex homology characterised by diverging Betti numbers. The proofs combine probabilistic arguments from the theory of stabilizing functionals of point processes and topological arguments exploiting the properties of Mayer-Vietoris exact sequences. The Mayer-Vietoris arguments are crucial, since homology in general, and Betti numbers in particular, are global rather than local phenomena, and most standard probabilistic arguments are based on the additivity of functionals arising as a consequence of locality., Comment: 34 pages

We study the homology of simplicial complexes built via deterministic rules from a random set of vertices. In particular, we show that, depending on the randomness that generates the vertices, the homology of these complexes can either become trivial as the number $n$ of vertices grows, or can contain more and more complex structures. The different behaviours are consequences of different underlying distributions for the generation of vertices, and we consider three illustrative examples, when the vertices are sampled from Gaussian, exponential, and power-law distributions in $\R^d$. We also discuss consequences of our results for manifold learning with noisy data, describing the topological phenomena that arise in this scenario as `crackle', in analogy to audio crackle in temporal signal analysis.

There has been considerable recent interest, primarily motivated by problems in applied algebraic topology, in the homology of random simplicial complexes. We consider the scenario in which the vertices of the simplices are the points of a random point process in $\mathbb {R}^d$, and the edges and faces are determined according to some deterministic rule, typically leading to \v{C}ech and Vietoris-Rips complexes. In particular, we obtain results about homology, as measured via the growth of Betti numbers, when the vertices are the points of a general stationary point process. This significantly extends earlier results in which the points were either i.i.d. observations or the points of a Poisson process. In dealing with general point processes, in which the points exhibit dependence such as attraction or repulsion, we find phenomena quantitatively different from those observed in the i.i.d. and Poisson cases. From the point of view of topological data analysis, our results seriously impact considerations of model (non)robustness for statistical inference. Our proofs rely on analysis of subgraph and component counts of stationary point processes, which are of independent interest in stochastic geometry., Comment: Published at http://dx.doi.org/10.1214/14-AAP1075 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

The structure of Gaussian random fields over high levels is a well researched and well understood area, particularly if the field is smooth. However, the question as to whether or not two or more points which lie in an excursion set belong to the same connected component has constantly eluded analysis. We study this problem from the point of view of large deviations, finding the asymptotic probabilities that two such points are connected by a path laying within the excursion set, and so belong to the same component. In addition, we obtain a characterization and descriptions of the most likely paths, given that one exists., Comment: Published in at http://dx.doi.org/10.1214/12-AOP794 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)

A topological multiple testing scheme for one-dimensional domains is proposed where, rather than testing every spatial or temporal location for the presence of a signal, tests are performed only at the local maxima of the smoothed observed sequence. Assuming unimodal true peaks with finite support and Gaussian stationary ergodic noise, it is shown that the algorithm with Bonferroni or Benjamini--Hochberg correction provides asymptotic strong control of the family wise error rate and false discovery rate, and is power consistent, as the search space and the signal strength get large, where the search space may grow exponentially faster than the signal strength. Simulations show that error levels are maintained for nonasymptotic conditions, and that power is maximized when the smoothing kernel is close in shape and bandwidth to the signal peaks, akin to the matched filter theorem in signal processing. The methods are illustrated in an analysis of electrical recordings of neuronal cell activity., Comment: Published in at http://dx.doi.org/10.1214/11-AOS943 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)

We provide a new approach, along with extensions, to results in two important papers of Worsley, Siegmund and coworkers closely tied to the statistical analysis of fMRI (functional magnetic resonance imaging) brain data. These papers studied approximations for the exceedence probabilities of scale and rotation space random fields, the latter playing an important role in the statistical analysis of fMRI data. The techniques used there came either from the Euler characteristic heuristic or via tube formulae, and to a large extent were carefully attuned to the specific examples of the paper. This paper treats the same problem, but via calculations based on the so-called Gaussian kinematic formula. This allows for extensions of the Worsley-Siegmund results to a wide class of non-Gaussian cases. In addition, it allows one to obtain results for rotation space random fields in any dimension via reasonably straightforward Riemannian geometric calculations. Previously only the two-dimensional case could be covered, and then only via computer algebra. By adopting this more structured approach to this particular problem, a solution path for other, related problems becomes clearer., Comment: Published in at http://dx.doi.org/10.1214/12-AOS1055 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)

For a finite set of points $P$ in $R^d$, the function $d_P: R^d \to R^+$ measures Euclidean distance to the set $P$. We study the number of critical points of $d_P$ when $P$ is a Poisson process. In particular, we study the limit behavior of $N_k$ - the number of critical points of $d_P$ with Morse index $k$ - as the density of points grows. We present explicit computations for the normalized, limiting, expectations and variances of the $N_k$, as well as distributional limit theorems. We link these results to recent results in which the Betti numbers of the random \v{C}ech complex based on $P$ were studied.

This paper considers the problem of detecting equal-shaped non-overlapping unimodal peaks in the presence of Gaussian ergodic stationary noise, where the number, location and heights of the peaks are unknown. A multiple testing approach is proposed in which, after kernel smoothing, the presence of a peak is tested at each observed local maximum. The procedure provides strong control of the family wise error rate and the false discovery rate asymptotically as both the signal-to-noise ratio (SNR) and the search space get large, where the search space may grow exponentially as a function of SNR. Simulations assuming a Gaussian peak shape and a Gaussian autocorrelation function show that desired error levels are achieved for relatively low SNR and are robust to partial peak overlap. Simulations also show that detection power is maximized when the smoothing bandwidth is close to the bandwidth of the signal peaks, akin to the well-known matched filter theorem in signal processing. The procedure is illustrated in an analysis of electrical recordings of neuronal cell activity., Comment: 37 pages, 8 figures

Our focus is on the design and analysis of efficient Monte Carlo methods for computing tail probabilities for the suprema of Gaussian random fields, along with conditional expectations of functionals of the fields given the existence of excursions above high levels, b. Na\"{i}ve Monte Carlo takes an exponential, in b, computational cost to estimate these probabilities and conditional expectations for a prescribed relative accuracy. In contrast, our Monte Carlo procedures achieve, at worst, polynomial complexity in b, assuming only that the mean and covariance functions are H\"{o}lder continuous. We also explain how to fine tune the construction of our procedures in the presence of additional regularity, such as homogeneity and smoothness, in order to further improve the efficiency., Comment: Published in at http://dx.doi.org/10.1214/11-AAP792 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

We discuss and review recent developments in the area of applied algebraic topology, such as persistent homology and barcodes. In particular, we discuss how these are related to understanding more about manifold learning from random point cloud data, the algebraic structure of simplicial complexes determined by random vertices, and, in most detail, the algebraic topology of the excursion sets of random fields.

We consider smooth, infinitely divisible random fields $(X(t),t\in M)$, $M\subset {\mathbb{R}}^d$, with regularly varying Levy measure, and are interested in the geometric characteristics of the excursion sets \[A_u=\{t\in M:X(t)>u\}\] over high levels u. For a large class of such random fields, we compute the $u\to\infty$ asymptotic joint distribution of the numbers of critical points, of various types, of X in $A_u$, conditional on $A_u$ being nonempty. This allows us, for example, to obtain the asymptotic conditional distribution of the Euler characteristic of the excursion set. In a significant departure from the Gaussian situation, the high level excursion sets for these random fields can have quite a complicated geometry. Whereas in the Gaussian case nonempty excursion sets are, with high probability, roughly ellipsoidal, in the more general infinitely divisible setting almost any shape is possible., Comment: Published in at http://dx.doi.org/10.1214/11-AOP738 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)

We consider global geometric properties of a codimension one manifold embedded in Euclidean space, as it evolves under an isotropic and volume preserving Brownian flow of diffeomorphisms. In particular, we obtain expressions describing the expected rate of growth of the Lipschitz-Killing curvatures, or intrinsic volumes, of the manifold under the flow. These results shed new light on some of the intriguing growth properties of flows from a global perspective, rather than the local perspective, on which there is a much larger literature., Comment: 12 pages

This is a brief review, in relatively non-technical terms, of recent advances in the theory of random field geometry. These advances have provided a collection of explicit new formulae describing mean values of a variety of geometric characteristics of excursion sets of random fields. As well as a review of the theory, we provide brief descriptions of some of the more interesting applications., Comment: 14 pages, 5 figures

Studying the geometry generated by Gaussian and Gaussian- related random fields via their excursion sets is now a well developed and well understood subject. The purely non-Gaussian scenario has, however, not been studied at all. In this paper we look at three classes of stable random fields, and obtain asymptotic formulae for the mean values of various geometric characteristics of their excursion sets over high levels. While the formulae are asymptotic, they contain enough information to show that not only do stable random fields exhibit geometric behaviour very different from that of Gaussian fields, but they also differ significantly among themselves., Comment: 35 pages, 1 figure

We consider vector valued, unit variance Gaussian processes defined over stratified manifolds and the geometry of their excursion sets. In particular, we develop an explicit formula for the expectation of all the Lipschitz--Killing curvatures of these sets. Whereas our motivation is primarily probabilistic, with statistical applications in the background, this formula has also an interpretation as a version of the classic kinematic fundamental formula of integral geometry. All of these aspects are developed in the paper. Particularly novel is the method of proof, which is based on a an approximation to the canonical Gaussian process on the $n$-sphere. The $n\to\infty$ limit, which gives the final result, is handled via recent extensions of the classic Poincar\'e limit theorem., Comment: Published in at http://dx.doi.org/10.1214/08-AOP439 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)

We study the accuracy of the expected Euler characteristic approximation to the distribution of the maximum of a smooth, centered, unit variance Gaussian process f. Using a point process representation of the error, valid for arbitrary smooth processes, we show that the error is in general exponentially smaller than any of the terms in the approximation. We also give a lower bound on this exponential rate of decay in terms of the maximal variance of a family of Gaussian processes f^x, derived from the original process f., Comment: Published at http://dx.doi.org/10.1214/009117905000000099 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)