Related papers: Largest nearest-neighbour link and connectivity th…

We study spatial networks constructed by randomly placing nodes on a manifold and joining two nodes with an edge whenever their distance is less than a certain cutoff. We derive the general expression for the connectivity distribution of…

Let $\Omega_q=\Omega_q(H)$ denote the set of proper $[q]$-colorings of the hypergraph $H$. Let $\Gamma_q$ be the graph with vertex set $\Omega_q$ and an edge ${\sigma,\tau\}$ where $\sigma,\tau$ are colorings iff $h(\sigma,\tau)=1$. Here…

We study the aggregate/group nearest neighbor searching for the MAX operator in the plane. For a set $P$ of $n$ points and a query set $Q$ of $m$ points, the query asks for a point of $P$ whose maximum distance to the points in $Q$ is…

Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…

Motivated by a $2$-dimensional (unsupervised) image segmentation task whereby local regions of pixels are clustered via edge detection methods, a more general probabilistic mathematical framework is devised. Critical thresholds are…

Many distributed learning techniques have been motivated by the increasing size of datasets and their inability to fit into main memory on a single machine. We propose an algorithm that finds the nearest neighbor in a graph locally without…

Asymptotic properties of random graph sequences, like occurrence of a giant component or full connectivity in Erd\H{o}s-R\'enyi graphs, are usually derived with very specific choices for defining parameters. The question arises to which…

The purpose of this note is to point out that the theory of expander graphs leads to an interesting test whether $n$ real numbers $x_1, \dots, x_n$ could be $n$ independent samples of a random variable. To any distinct, real numbers $x_1,…

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…

A model of correlated random networks is examined, i.e. networks with correlations between the degrees of neighboring nodes. These nodes do not necessarily have to be direct neighbors, the maximum range of the correlations can be…

Let X_{d,n} be an n-element subset of {0,1}^d chosen uniformly at random, and denote by P_{d,n} := conv X_{d,n} its convex hull. Let D_{d,n} be the density of the graph of P_{d,n} (i.e., the number of one-dimensional faces of P_{d,n}…

Let $\mathbb{S}_n$ denote the symmetric group on $[n]=\{1,\ldots,n\}$ with the uniform probability measure. For a permutation $\pi \in \mathbb{S}_n$ let $X_{\pi}$ denote the simplicial complex on the vertex set $[n]$ whose simplices are all…

In this note we asymptotically determine the maximum number of hyperedges possible in an $r$-uniform, connected $n$-vertex hypergraph without a Berge path of length $k$, as $n$ and $k$ tend to infinity. We show that, unlike in the graph…

Consider the $d$ dimensional lattice $\mathbb{Z}^d$ where each vertex is open or closed with probability $p$ or $1-p$ respectively. An open vertex $\mathbb{u} := (\mathbb{u}(1), \mathbb{u}(2),...,\mathbb{u}(d))$ is connected by an edge to…

Let ${X}_{k}=(x_{k1}, \cdots, x_{kp})', k=1,\cdots,n$, be a random sample of size $n$ coming from a $p$-dimensional population. For a fixed integer $m\geq 2$, consider a hypercubic random tensor $\mathbf{{T}}$ of $m$-th order and rank $n$…

Given an $n$-sample of random vectors $(X_i,Y_i)_{1 \leq i \leq n}$ whose joint law is unknown, the long-standing problem of supervised classification aims to \textit{optimally} predict the label $Y$ of a given a new observation $X$. In…

We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph $G_N$ with vertex set $[N] = \{1,\dots,N\}$ for which the pair of vertices $i,j \in [N]$, $i\neq j$, is connected by an edge with probability $r(\tfrac{i}{N},\tfrac{j}{N})$,…

A commonly used characteristic of statistical dependence of adjacency relations in real networks, the clustering coefficient, evaluates chances that two neighbours of a given vertex are adjacent. An extension is obtained by considering…

We analyze the asymptotic behavior of random variables $x(n,x\_0)$ defined by $x(0,x\_0)=x\_0$ and $x(n+1,x\_0)=A(n)x(n,x\_0)$, where $\sAn$ is a stationary and ergodic sequence of random matrices with entries in the semi-ring…

Dimension is a fundamental property of objects and the space in which they are embedded. Yet ideal notions of dimension, as in Euclidean spaces, do not always translate to physical spaces, which can be constrained by boundaries and…