To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Construct the lines $x = k$ for integers $k$. Centre a disc of radius $r$ on $(S,0)$, where $S$ has a uniform distribution on $[0,1]$. Let $L$ be the total chord length from the intersection of the disc with the lines. This article obtains the cumulative distribution function for $L$.
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time-stamps indicate the propagation of information. We determine a threshold for the existence of monotone increasing paths between all pairs of vertices in temporal random geometric graphs. The results reveal that temporal connectivity appears at a significantly larger edge density than simple connectivity of the underlying random geometric graph. This is in contrast with Erdős–Rényi random graphs in which the thresholds for temporal connectivity and simple connectivity are of the same order of magnitude. Our results hold for a family of ‘soft’ random geometric graphs as well as the standard random geometric graph.
We study normal approximation of subgraph counts in a model of spatial scale-free random networks known as the age-dependent random connection model. In the light-tailed regime where only moments of order $(2+\varepsilon)$ are finite, we study the asymptotic normality of both clique and subtree counts. For clique counts, we establish a multivariate quantitative normal approximation result through the Malliavin–Stein method. In the more delicate case of subtree counts, we obtain distributional convergence based on a central limit theorem for sequences of associated random variables.
We relate the expected hyperbolic length of the perimeter of the convex hull of the trajectory of Brownian motion in the hyperbolic plane to an expectation of a certain exponential functional of a one-dimensional real-valued Brownian motion, and hence derive small- and large-time asymptotics for the expected hyperbolic perimeter. In contrast to the case of Euclidean Brownian motion with non-zero drift, the large-time asymptotics are a factor of two greater than the lower bound implied by the fact that the convex hull includes the hyperbolic line segment from the origin to the endpoint of the hyperbolic Brownian motion. We also obtain an exact expression for the expected perimeter length after an independent exponential random time.
Let $\mathrm{P}_K(n)$ be the probability that n points $z_1,\ldots,z_n$ picked uniformly and independently in K, a compact convex polygon in $\mathbb{R}^2$ with non-empty interior, are in convex position, that is, form the vertex set of a convex polygon. In this paper, the exact asymptotic behaviour of $\mathrm{P}_K(n)$ is determined as $n\to+\infty$. This improves on a famous result of Bárány [1999 Ann. Probab.27, 2020–2034] (yet valid for a general convex set K) and a result initiated in the case where K is a regular convex polygon (Morin [2025 Adv. Appl. Probab.57, 811–870]).
In this paper, we derive the exact formula for the probability that three randomly and uniformly selected points from the interior of the unit cube form vertices of an obtuse triangle.
We consider the asymptotic behaviour of the expectation of the perimeter deviation of a uniform random spherical disc–polygon in a spherical spindle convex disc with smooth boundary. We also introduce the notion of duality on the sphere, define a model of random circumscribed disc–polygons, and determine some asymptotic results about them.
The planar Skorokhod embedding problem was first proposed and solved by Gross [‘A conformal Skorokhod embedding’, Electron. Commun. Probab.24 (2019), 11 pages; doi:10.1214/19-ECP272]. Gross worked with probability distributions having finite second moment. Boudabra and Markowsky [‘Remarks on Gross’ technique for obtaining a conformal Skorokhod embedding of planar Brownian motion’, Electron. Commun. Probab.25 (2020), 13 pages; doi:10.1214/20-ECP300] extended the solution to all distributions with a finite pth moment for $p>1$. The case $p=1$ has remained uncovered since then. In this note, we show that the planar Skorokhod embedding problem is solvable for $p=1$ when the Hilbert transform of its quantile function is integrable, effectively closing this line of investigation.
We consider the number of edge crossings in a random graph drawing generated by projecting a random geometric graph on some compact convex set $W\subset \mathbb{R}^d$, $d\geq 3$, onto a plane. The positions of these crossings form the support of a point process. We show that if the expected number of crossings converges to a positive but finite value, this point process converges to a Poisson point process in the Kantorovich–Rubinstein distance. We further show a multivariate central limit theorem between the number of crossings and a second variable called the stress that holds when the expected vertex degree in the random geometric graph converges to a positive finite value.
We derive large- and moderate-deviation results in random networks given as planar directed navigations on homogeneous Poisson point processes. In this non-Markovian routing scheme, starting from the origin, at each consecutive step a Poisson point is joined by an edge to its nearest Poisson point to the right within a cone. We establish precise exponential rates of decay for the probability that the vertical displacement of the random path is unexpectedly large. The proofs rest on controlling the dependencies of the individual steps and the randomness in the horizontal displacement as well as renewal-process arguments.
We prove two-sided bounds on the expected values of several geometric functionals of the convex hull of Brownian motion in $\mathbb {R}^n$ and their inverse processes. This extends some recent results of McRedmond and Xu (2017), Jovalekić (2021), and Cygan, Šebek, and the first author (2023) from the plane to higher dimensions. Our main result shows that the average time required for the convex hull in $\mathbb {R}^n$ to attain unit volume is at most $n\sqrt [n]{n!}$. The proof relies on a novel procedure that embeds an n-simplex of prescribed volume within the convex hull of the Brownian path run up to a certain stopping time. All of our bounds capture the correct order of asymptotic growth or decay in the dimension n.
We prove a Poisson process approximation result for stabilising functionals of a determinantal point process. Our results use concrete couplings of determinantal processes with different Palm measures and exploit their association properties. Second, we focus on the Ginibre process and show in the asymptotic scenario of an increasing observation window that the process of points with a large nearest neighbour distance converges after a suitable scaling to a Poisson point process. As a corollary, we obtain the scaling of the maximum nearest neighbour distance in the Ginibre process, which turns out to be different from its analogue for independent points.
We consider stationary configurations of points in Euclidean space that are marked by positive random variables called scores. The scores are allowed to depend on the relative positions of other points and outside sources of randomness. Such models have been thoroughly studied in stochastic geometry, e.g. in the context of random tessellations or random geometric graphs. It turns out that in a neighborhood of a point with an extreme score it is possible to rescale positions and scores of nearby points to obtain a limiting point process, which we call the tail configuration. Under some assumptions on dependence between scores, this local limit determines the global asymptotics for extreme scores within increasing windows in $\mathbb{R}^d$. The main result establishes the convergence of rescaled positions and clusters of high scores to a Poisson cluster process, quantifying the idea of the Poisson clumping heuristic by Aldous (1989, in the point process setting). In contrast to the existing results, our framework allows for explicit calculation of essentially all extremal quantities related to the limiting behavior of extremes. We apply our results to models based on (marked) Poisson processes where the scores depend on the distance to the kth nearest neighbor and where scores are allowed to propagate through a random network of points depending on their locations.
We investigate geometric properties of invariant spatio-temporal random fields $X\colon\mathbb M^d\times \mathbb R\to \mathbb R$ defined on a compact two-point homogeneous space $\mathbb M^d$ in any dimension $d\ge 2$, and evolving over time. In particular, we focus on chi-squared-distributed random fields, and study the large-time behavior (as $T\to +\infty$) of the average on [0,T] of the volume of the excursion set on the manifold, i.e. of $\lbrace X(\cdot, t)\ge u\rbrace$ (for any $u >0$). The Fourier components of X may have short or long memory in time, i.e. integrable or non-integrable temporal covariance functions. Our argument follows the approach developed in Marinucci et al. (2021) and allows us to extend their results for invariant spatio-temporal Gaussian fields on the two-dimensional unit sphere to the case of chi-squared distributed fields on two-point homogeneous spaces in any dimension. We find that both the asymptotic variance and limiting distribution, as $T\to +\infty$, of the average empirical volume turn out to be non-universal, depending on the memory parameters of the field X.
In this paper we derive cumulant bounds for subgraph counts and power-weighted edge lengths in a class of spatial random networks known as weight-dependent random connection models. These bounds give rise to different probabilistic results, from which we mainly focus on moderate deviations of the respective statistics, but also show a concentration inequality and a normal approximation result. This involves dealing with long-range spatial correlations induced by the profile function and the weight distribution. We start by deriving the bounds for the classical case of a Poisson vertex set, and then provide extensions to α-determinantal processes.
Gaussian random polytopes have received a lot of attention, especially in the case where the dimension is fixed and the number of points goes to infinity. Our focus is on the less-studied case where the dimension goes to infinity and the number of points is proportional to the dimension d. We study several natural quantities associated with Gaussian random polytopes in this setting. First, we show that the expected number of facets is equal to $C(\alpha)^{d+o(d)}$, where $C(\alpha)$ is some constant which depends on the constant of proportionality $\alpha$. We also extend this result to the expected number of k-facets. We then consider the more difficult problem of the asymptotics of the expected number of pairs of estranged facets of a Gaussian random polytope. When the number of points is 2d, we determine the constant C such that the expected number of pairs of estranged facets is equal to $C^{d+o(d)}$.
We provide two constructions of Gaussian random holomorphic sections of a Hermitian holomorphic line bundle $(L,h_{L})$ on a Hermitian complex manifold $(X,\Theta )$, that are particularly interesting in the case where the space of $\mathcal {L}^2$-holomorphic sections $H^{0}_{(2)}(X,L)$ is infinite dimensional. We first provide a general construction of Gaussian random holomorphic sections of L, which, if $H^{0}_{(2)}(X,L)$ is infinite dimensional, are almost never $\mathcal {L}^2$-integrable on X. The second construction combines the abstract Wiener space theory with the Berezin–Toeplitz quantization and yields a Gaussian ensemble of random $\mathcal {L}^2$-holomorphic sections. Furthermore, we study their random zeros in the context of semiclassical limits, including their distributions, large deviation estimates, local fluctuations and hole probabilities.
We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\mathord{\mathbb R}}^d$. We present combinatorial expressions for the computation of the cumulants and moments of all orders of such subgraph counts, which allow us to estimate the growth of cumulants as the intensity of the underlying Poisson point process goes to infinity. As a consequence, we obtain a central limit theorem with explicit convergence rates under the Kolmogorov distance and connectivity bounds. Numerical examples are presented using a computer code in SageMath for the closed-form computation of cumulants of any order, for any type of connected subgraph, and for any configuration of endpoints in any dimension $d{\geq} 1$. In particular, graph connectivity estimates, Gram–Charlier expansions for density estimation, and correlation estimates for joint subgraph counting are obtained.
Let $\mathbb{P}_\kappa(n)$ be the probability that n points $z_1,\ldots,z_n$ picked uniformly and independently in $\mathfrak{C}_\kappa$, a regular $\kappa$-gon with area 1, are in convex position, that is, form the vertex set of a convex polygon. In this paper, we compute $\mathbb{P}_\kappa(n)$ up to asymptotic equivalence, as $n\to+\infty$, for all $\kappa\geq 3$, which improves on a famous result of Bárány (Ann. Prob.27, 1999). The second purpose of this paper is to establish a limit theorem which describes the fluctuations around the limit shape of an n-tuple of points in convex position when $n\to+\infty$. Finally, we give an asymptotically exact algorithm for the random generation of $z_1,\ldots,z_n$, conditioned to be in convex position in $\mathfrak{C}_\kappa$.
Persistent Betti numbers are a major tool in persistent homology, a subfield of topological data analysis. Many tools in persistent homology rely on the properties of persistent Betti numbers considered as a two-dimensional stochastic process $ (r,s) \mapsto n^{-1/2} (\beta^{r,s}_q ( \mathcal{K}(n^{1/d} \mathcal{X}_n))-\mathbb{E}[\beta^{r,s}_q ( \mathcal{K}( n^{1/d} \mathcal{X}_n))])$. So far, pointwise limit theorems have been established in various settings. In particular, the pointwise asymptotic normality of (persistent) Betti numbers has been established for stationary Poisson processes and binomial processes with constant intensity function in the so-called critical (or thermodynamic) regime; see Yogeshwaran et al. (Prob. Theory Relat. Fields167, 2017) and Hiraoka et al. (Ann. Appl. Prob.28, 2018).
In this contribution, we derive a strong stabilization property (in the spirit of Penrose and Yukich, Ann. Appl. Prob.11, 2001) of persistent Betti numbers, and we generalize the existing results on their asymptotic normality to the multivariate case and to a broader class of underlying Poisson and binomial processes. Most importantly, we show that multivariate asymptotic normality holds for all pairs (r, s), $0\le r\le s<\infty$, and that it is not affected by percolation effects in the underlying random geometric graph.