Searcharxiv⌕ Search

arXiv subjects

Takashi Owada

Publications and source records attributed to Takashi Owada.

27 records · Page 2Linked to original sources

Limit theorems for process-level Betti numbers for sparse, critical, and Poisson regimes

The objective of this study is to examine the asymptotic behavior of Betti numbers of Čech complexes treated as stochastic processes and formed from random points in the $d$-dimensional Euclidean space $\mathbb{R}^d$. We consider the case where the points of the Čech complex are generated by a Poisson process with intensity $nf$ for a probability density $f$. We look at the cases where the behavior of the connectivity radius of Čech complex causes simplices of dimension greater than $k+1$ to vanish in probability, the so-called sparse and Poisson regimes, as well when the connectivity radius is on the order of $n^{-1/d}$, the critical regime. We establish limit theorems in all of the aforementioned regimes, a central limit theorem for the sparse and critical regimes, and a Poisson limit theorem for the Poisson regime. When the connectivity radius of the Čech complex is $o(n^{-1/d})$, i.e., the sparse and Poisson regimes, we can decompose the limiting processes into a time-changed Brownian motion and a time-changed homogeneous Poisson process respectively. In the critical regime, the limiting process is a centered Gaussian process but has much more complicated representation, because the Čech complex becomes highly connected with many topological holes of any dimension.

math.PR↗

Sub-tree counts on hyperbolic random geometric graphs

We study the hyperbolic random geometric graph introduced in Krioukov et al. For a sequence $R_n \to \infty$, we define these graphs to have the vertex set as Poisson points distributed uniformly in balls $B(0,R_n) \subset B_d^α$, the $d$-dimensional Poincaré ball (unit d-ball with the Poincaré metric $d_α$ corresponding to negative curvature $-α^2, α> 0$) by connecting any two points within a distance $R_n$ according to the metric $d_ζ, ζ> 0$. Denoting these graphs by $HG_n(R_n ; α, ζ)$, we study asymptotic counts of copies of a fixed tree $Γ_k$ (with the ordered degree sequence $d_{(1)} \leq \ldots \leq d_{(k)}$) in $HG_n(R_n ; α, ζ)$. Unlike earlier works, we count more involved structures, allowing for $d > 2$, and in many places, more general choices of $R_n$ rather than $R_n = 2[ζ(d-1)]^{-1}\log (n/ ν), ν\in (0,\infty)$. The latter choice of $R_n$ for $α/ ζ> 1/2$ corresponds to the thermodynamic regime. We show multiple phase transitions in $HG_n(R_n ; α, ζ)$ as $α/ ζ$ increases, i.e., the space $B_d^α$ becomes more hyperbolic. In particular, our analyses reveal that the sub-tree counts exhibit an intricate dependence on the degree sequence $d_{(1)},\ldots,d_{(k)}$ of $Γ_k$ as well as the ratio $α/ζ$. Under a more general radius regime $R_n$ than that described above, we investigate the asymptotics of the expectation and variance of sub-tree counts. Moreover, we prove the corresponding central limit theorem as well. Our proofs rely crucially on a careful analysis of the sub-tree counts near the boundary using Palm calculus for Poisson point processes along with estimates for the hyperbolic metric and measure. For the central limit theorem, we use the abstract normal approximation result from Last et al. derived using the Malliavin-Stein method.

math.PR↗

Limit Theorems for the Sum of Persistence Barcodes

Topological Data Analysis (TDA) refers to an approach that uses concepts from algebraic topology to study the "shapes" of datasets. The main focus of this paper is persistent homology, a ubiquitous tool in TDA. Basing our study on this, we investigate the topological dynamics of extreme sample clouds generated by a heavy tail distribution on $\mathbb R^d$. In particular, we establish various limit theorems for the sum of bar lengths in the persistence barcode plot, a graphical descriptor of persistent homology. It then turns out that the growth rate of the sum of the bar lengths and the properties of the limiting processes all depend on the distance of the region of interest in $\mathbb R^d$ from the weak core, that is, the area in which random points are placed sufficiently densely to connect with one another. If the region of interest becomes sufficiently close to the weak core, the limiting process involves a new class of Gaussian processes.

math.PR↗

Functional Central Limit Theorem for Subgraph Counting Processes

The objective of this study is to investigate the limiting behavior of a subgraph counting process. The subgraph counting process we consider counts the number of subgraphs having a specific shape that exist outside an expanding ball as the sample size increases. As underlying laws, we consider distributions with either a regularly varying tail or an exponentially decaying tail. In both cases, the nature of the resulting functional central limit theorem differs according to the speed at which the ball expands. More specifically, the normalizations in the central limit theorems and the properties of the limiting Gaussian processes are all determined by whether or not an expanding ball covers a region - called a weak core - in which the random points are highly densely scattered and form a giant geometric graph.

math.PR↗

Limit Theorems for Point Processes under Geometric Constraints (and Topological Crackle)

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 Č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.

math.PR↗

Maxima of long memory stationary symmetric $α$-stable processes, and self-similar processes with stationary max-increments

We derive a functional limit theorem for the partial maxima process based on a long memory stationary $α$-stable process. The length of memory in the stable process is parameterized by a certain ergodic-theoretical parameter in an integral representation of the process. The limiting process is no longer a classical extremal Fréchet process. It is a self-similar process with $α$-Fréchet marginals, and it has stationary max-increments, a property which we introduce in this paper. The functional limit theorem is established in the space $D[0,\infty)$ equipped with the Skorohod $M_1$-topology; in certain special cases the topology can be strengthened to the Skorohod $J_1$-topology.

math.PR↗

Functional central limit theorem for negatively dependent heavy-tailed stationary infinitely divisible processes generated by conservative flows

We prove a functional central limit theorem for partial sums of symmetric stationary long range dependent heavy tailed infinitely divisible processes with a certain type of negative dependence. Previously only positive dependence could be treated. The negative dependence involves cancellations of the Gaussian second order. This leads to new types of limiting processes involving stable random measures, due to heavy tails, Mittag-Leffler processes, due to long memory, and Brownian motions, due to the Gaussian second order cancellations.

math.PR↗

Functional central limit theorem for heavy tailed stationary infinitely divisible processes generated by conservative flows

We establish a new class of functional central limit theorems for partial sum of certain symmetric stationary infinitely divisible processes with regularly varying Lévy measures. The limit process is a new class of symmetric stable self-similar processes with stationary increments that coincides on a part of its parameter space with a previously described process. The normalizing sequence and the limiting process are determined by the ergodic-theoretical properties of the flow underlying the integral representation of the process. These properties can be interpreted as determining how long the memory of the stationary infinitely divisible process is. We also establish functional convergence, in a strong distributional sense, for conservative pointwise dual ergodic maps preserving an infinite measure.

math.PR↗

Limit Theory for the Sample Autocovariance for Heavy Tailed Stationary Infinitely Divisible Processes Generated by Conservative Flows

This study aims to develop the limit theorems on the sample autocovariances and sample autocorrelations for certain stationary infinitely divisible processes. We consider the case where the infinitely divisible process has heavy tail marginals and is generated by a conservative flow. Interestingly, the growth rate of the sample autocovariances is determined by not only heavy tailedness of the marginals but also memory length of the process. Although this feature was first observed by \cite{resnick:samorodnitsky:xue:2000} for some very specific processes, we will propose a more general framework from the viewpoint of infinite ergodic theory. Consequently, the asymptotics of the sample autocovariances can be more comprehensively discussed.

math.PR↗