Related papers: From Random Lines to Metric Spaces
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…
Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph. Assume that the graph is infinite and of bounded degree. Assume also strict positivity and finite…
Recently there has been increased interest in fitting generative graph models to real-world networks. In particular, Bl\"asius et al. have proposed a framework for systematic evaluation of the expressivity of random graph models. We extend…
It is shown that for a non-decreasing self-similar stochastic process $T$ with independent increments, the range of $T$ forms a Poisson point process with $\sigma$-finite intensity if and only if the one-dimensional distribution of $T(1)$…
We construct an infinitely exchangeable process on the set $\cate$ of subsets of the power set of the natural numbers $\mathbb{N}$ via a Poisson point process with mean measure $\Lambda$ on the power set of $\mathbb{N}$. Each $E\in\cate$…
The statistical distribution of levels of an integrable system is claimed to be a Poisson distribution. In this paper, we numerically generate an ensemble of N dimensional random diagonal matrices as a model for regular systems. We evaluate…
The study of substructures in random objects has a long history, beginning with Erd\H{o}s and R\'enyi's work on subgraphs of random graphs. We study the existence of certain substructures in random subsets of vector spaces over finite…
Weakly stationary random processes of $k$-dimensional affine subspaces (flats) in $\mathbb{R}^n$ are considered. If $2k\geq n$, then intersection processes are investigated, while in the complementary case $2k<n$ a proximity process is…
We show that a stationary IDp process (i.e., an infinitely divisible stationary process without Gaussian part) can be written as the independent sum of four stationary IDp processes, each of them belonging to a different class characterized…
In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…
Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…
Random geometric graphs are a popular choice for a latent points generative model for networks. Their definition is based on a sample of $n$ points $X_1,X_2,\cdots,X_n$ on the Euclidean sphere~$\mathbb{S}^{d-1}$ which represents the latent…
Natural objects can be subject to various transformations yet still preserve properties that we refer to as invariants. Here, we use definitions of affine invariant arclength for surfaces in R^3 in order to extend the set of existing…
We consider extremal processes and random walks generated by heavy-tailed random vectors taking values in $\mathbb{R}^d$ endowed with the $\ell_p$ metric. We establish limit theorems for the associated paths in the triangular array setting…
The metric $D_\alpha (q,q')$ on the set $Q$ of particle locations of a homogeneous Poisson process on $R^d$, defined as the infimum of $(\sum_i |q_i - q_{i+1}|^\alpha)^{1/\alpha}$ over sequences in $Q$ starting with $q$ and ending with $q'$…
We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…
A Barab\'asi-Albert scale-free network is constructed whose nodes are the Poisson distributed random points within a unit square and links are the straight line connections among the nodes. The cost function, which is the total wiring…
It is well known that one can map certain properties of random matrices, fermionic gases, and zeros of the Riemann zeta function to a unique point process on the real line. Here we analytically provide exact generalizations of such a point…
We consider the Erdos-Renyi random graph G(n,p) inside the critical window, where p = 1/n + lambda * n^{-4/3} for some lambda in R. We proved in a previous paper (arXiv:0903.4730) that considering the connected components of G(n,p) as a…
We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…