Related papers: Angle between two random segments
Visual segmentation is a key perceptual function that partitions visual space and allows for detection, recognition and discrimination of objects in complex environments. The processes underlying human segmentation of natural images are…
The paper is concerned with constructing pairwise dependence between $m$ random density functions each of which is modeled as a mixture of Dirichlet process model. The key to this is how to create dependencies between random Dirichlet…
We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…
Distance control in many-particle systems is a fundamental problem in nature. This becomes particularly relevant in systems of active agents, which can sense their environment and react by adjusting their direction of motion. We employ…
Let $\mathcal{V}$ and $\mathcal{U}$ be the point sets of two independent homogeneous Poisson processes on $\mathbb{R}^d$. A graph $\mathcal{G}_\mathcal{V}$ with vertex set $\mathcal{V}$ is constructed by first connecting pairs of points…
We introduce a class of stochastic integer sequences. In these sequences, every element is a sum of two previous elements, at least one of which is chosen randomly. The interplay between randomness and memory underlying these sequences…
Given $iid$ observations from an unknown absolute continuous distribution defined on some domain $\Omega$, we propose a nonparametric method to learn a piecewise constant function to approximate the underlying probability density function.…
We study the entanglement properties of random pure stabilizer states in spin-1/2 particles. For two contiguous groups of spins of arbitrary size we obtain a compact and exact expression for the probability distribution for the entanglement…
The dimension of random simplicial complexes (defined as the maximal dimension among all faces) is a natural extreme value associated with the complex, and is closely related to other functionals defined by a maximum, such as the clique…
We study the kinetics of random sequential adsorption of a mixture of particles with continuous distribution of sizes for different deposition rules. It appears in the long time limit the resulting system can be described using the fractal…
We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…
Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…
Consider randomly picked points inside the n-dimensional unit hypersphere centered at the origin of the Cartesian coordinate system. The Cartesian coordinates of the points are random variables, which form an n-dimensional vector for each…
We study a recent model of random networks based on the presence of an intrinsic character of the vertices called fitness. The vertices fitnesses are drawn from a given probability distribution density. The edges between pair of vertices…
The ensemble inter-relations to be considered are special features of classical cases, where the joint eigenvalue probability density can be computed explicitly. Attention will be focussed too on the consequences of these inter-relations,…
For any graph consisting of $k$ vertices and $m$ edges we construct an ensemble of random pure quantum states which describe a system composed of $2m$ subsystems. Each edge of the graph represents a bi-partite, maximally entangled state.…
For a set $S$ of vertices of a graph $G$, we define its density $0 \leq \sigma(S) \leq 1$ as the ratio of the number of edges of $G$ spanned by the vertices of $S$ to ${|S| \choose 2}$. We show that, given a graph $G$ with $n$ vertices and…
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…
In this paper, we study how the probability of presence of a particle is distributed between the two parts of a composite fermionic system. We uncover that the difference of probability depends on the energy in a striking way and show the…
We consider branching particle processes on discrete structures like the hypercube in a random fitness landscape (i.e., random branching/killing rates). The main question is about the location where the main part of the population sits at a…