Related papers: Random Distances Associated with Arbitrary Triangl…
A formalism is presented for analytically obtaining the probability density function, (P_{n}(s)), for the random distance (s) between two random points in an (n)-dimensional spherical object of radius (R). Our formalism allows (P_{n}(s)) to…
We study discrete random fields $\{X_t: t\in \mathbb{Z}^d\}$ parameterized on the $d$-dimensional integer lattice $\mathbb{Z}^d$. For a fixed threshold $u$, the excursion set $\{t \in \mathbb{Z}^d : X_t > u\}$ decomposes into connected…
A flat membrane with given shape is displayed; two points in the membrane are randomly selected; the probability that the separation between the points have a specified value is sought. A simple method to evaluate the probability density is…
Proximity maps and regions are defined based on the relative allocation of points from two or more classes in an area of interest and are used to construct random graphs called proximity catch digraphs (PCDs) which have applications in…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
In this article we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set out to define a proper distance measure…
We consider the discrete three dimensional scan statistics. Viewed as the maximum of an 1-dependent stationary r.v.'s sequence, we provide approximations and error bounds for the probability distribution of the three dimensional scan…
Analytical expressions for the distribution of the length of chords corresponding to the affine invariant measure on the set of chords are given for convex polygons. These analytical expressions are a computational improvement over other…
In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points,…
The Dirac's chord method may be suitable in different areas of physics for the representation of certain six-dimensional integrals for a convex body using the probability density of the chord length distribution. For a homogeneous model…
Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…
We propose a computationally efficient random walk on a convex body which rapidly mixes and closely tracks a time-varying log-concave distribution. We develop general theoretical guarantees on the required number of steps; this number can…
We describe a randomized algorithm that, given a set $P$ of points in the plane, computes the best location to insert a new point $p$, such that the Delaunay triangulation of $P\cup\{p\}$ has the largest possible minimum angle. The expected…
Many real-world networks exhibit degree-degree correlations between nodes separated by more than one step. Such long-range degree correlations (LRDCs) can be fully described by one joint and four conditional probability distributions with…
Consider that the coordinates of $N$ points are randomly generated along the edges of a $d$-dimensional hypercube (random point problem). The probability that an arbitrary point is the $m$th nearest neighbor to its own $n$th nearest…
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…
We study the convex hull of the set of points visited by a two-dimensional random walker of T discrete time steps. Two natural observables that characterize the convex hull in two dimensions are its perimeter L and area A. While the mean…
We derive conditions under which random sequences of polarizations (two-point symmetrizations) converge almost surely to the symmetric decreasing rearrangement. The parameters for the polarizations are independent random variables whose…
An $m$-distance set is a collection of points such that the distances between any two points have $m$ possible values. We use two different methods to construct large $m$-distance sets on the triangular lattices. One is to use the first m…
We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…