Related papers: On $k$-clusters of high-intensity random geometric…
In this paper we consider the clustering coefficient and clustering function in a random graph model proposed by Krioukov et al.~in 2010. In this model, nodes are chosen randomly inside a disk in the hyperbolic plane and two nodes are…
Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $[n]:=\left\{1, \ldots, n\right\}$ with $m=m(n)$ edges. We show that in the sparse regime, when $m/n\leq 1$, with high probability the…
We determine the joint limiting distribution of adjacent spacings around a central, intermediate, or an extreme order statistic $X_{k:n}$ of a random sample of size $n$ from a continuous distribution $F$. For central and intermediate cases,…
The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…
Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…
This paper considers the problem of adaptive estimation of a non-homogeneous intensity function from the observation of n independent Poisson processes having a common intensity that is randomly shifted for each observed trajectory. We show…
Random tessellations of the space represent a class of prototype models of heterogeneous media, which are central in several applications in physics, engineering and life sciences. In this work, we investigate the statistical properties of…
In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…
We consider a linear mixed-effects model with a clustered structure, where the parameters are estimated using maximum likelihood (ML) based on possibly unbalanced data. Inference with this model is typically done based on asymptotic theory,…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…
Consider a graph on $n$ uniform random points in the unit square, each pair being connected by an edge with probability $p$ if the inter-point distance is at most $r$. We show that as $n\to\infty$ the probability of full connectivity is…
Let $L$ be subset of $\{3,4,\dots\}$ and let $X_{n,M}^{(L)}$ be the number of cycles belonging to unicyclic components whose length is in $L$ in the random graph $G(n,M)$. We find the limiting distribution of $X_{n,M}^{(L)}$ in the…
We study the $k$-core of a random (multi)graph on $n$ vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50--62] we used properties of empirical distributions of independent random variables…
The percolated random geometric graph $G_n(\lambda, p)$ has vertex set given by a Poisson Point Process in the square $[0,\sqrt{n}]^2$, and every pair of vertices at distance at most 1 independently forms an edge with probability $p$. For a…
In this paper, quantitative bounds in high-frequency central limit theorems are derived for Poisson based $U$-statistics of arbitrary degree built by means of wavelet coefficients over compact Riemannian manifolds. The wavelets considered…
In this paper, we study the asymptotic behavior of a semi-linear slow-fast stochastic partial differential equation with singular coefficients. Using the Poisson equation in Hilbert space, we first establish the strong convergence in the…
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…
The article determines the asymptotic shape of the extremal clusters in stationary regularly varying random fields. To deduce this result, we present a general framework for the Poisson approximation of point processes on Polish spaces…
We show that the random point measures induced by vertices in the convex hull of a Poisson sample on the unit ball, when properly scaled and centered, converge to those of a mean zero Gaussian field. We establish limiting variance and…
We generalize the Poisson limit theorem to binary functions of random objects whose law is invariant under the action of an amenable group. Examples include stationary random fields, exchangeable sequences, and exchangeable graphs. A…