Related papers: A limit theorem for persistence diagrams of random…
A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…
We consider a one-dimensional discrete-space birth process with a bounded number of particle per site. Under the assumptions of the finite range of interaction, translation invariance, and non-degeneracy, we prove a shape theorem. We also…
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…
In this paper, under mild assumptions, we derive a law of large numbers, a central limit theorem with an error estimate, an almost sure invariance principle and a variant of Chernoff bound in finite-state hidden Markov models. These limit…
We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…
We present a general approach to study a class of random growth models in $n$-dimensional Euclidean space. These models are designed to capture basic growth features which are expected to manifest at the mesoscopic level for several…
\v{C}ech complexes are useful simplicial complexes for computing and analyzing topological features of data that lies in Euclidean space. Unfortunately, computing these complexes becomes prohibitively expensive for large-sized data sets…
We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric…
The convex hull peeling of a point set is obtained by taking the convex hull of the set and repeating iteratively the operation on the interior points until no point remains. The boundary of each hull is called a layer. We study the number…
Uniform laws of large numbers form a cornerstone of Vapnik--Chervonenkis theory, where they are characterized by the finiteness of the VC dimension. In this work, we study uniform convergence phenomena in cartesian product spaces, under…
A persistence module with $m$ discrete parameters is a diagram of vector spaces indexed by the poset $\mathbb{N}^m$. If we are only interested in the large scale behavior of such a diagram, then we can consider two diagrams equivalent if…
We present a parallelizable algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then…
We consider a generalization of the so-called divide and color model recently introduced by Haggstrom. We investigate the behaviour of the magnetization in large boxes and its fluctuations. Thus, laws of large numbers and Central Limit…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that the probability that this pattern occurs at most an times on a cluster of size n is…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We prove a sharp representation stability result for graph complexes with a distinguished vertex, and prove that the chains realizing this sharp bound pass to non-trivial families of graph homology classes. This result may be interpreted as…
We study, from the viewpoint of metrical number theory and (infinite) ergodic theory, the probabilistic laws governing the occurrence of prime numbers as digits in continued fraction expansions of real numbers.
Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum…
For a fixed dimension $k\ge 1$, let us consider the randomly growing simplical complex on the vertex set $\{1,2,\dots,n\}$ defined as follows: We start with the empty complex, and for each $k+1$-element subset $\sigma$ of $\{1,2,\dots,n\}$,…