Related papers: Computing the probability of intersection

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $0 \leq k \leq n$, let ${[n] \choose \leq…

Here, we present results on the intrinsic collision probabilities, $ P_I$, and range of collision speeds, $V_I$, as a function of the heliocentric distance, $r$, in the trans-Neptunian region. The collision speed is one of the parameters,…

The probability of finding a prime multiplet, i.e., a sequence of primes $p$ and $p+a_i$, $i=1... m$, being all primes where $p$ is some prime less than the integer $n$ is naively $1/log(n)^{m+1}$. It is shown that, in reality, it is…

The exact lower bound on the probability of the occurrence of exactly one of $n$ random events each of probability $p$ is obtained.

Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…

A method of calculating probability values from a system of marginal constraints is presented. Previous systems for finding the probability of a single attribute have either made an independence assumption concerning the evidence or have…

Let $n > m\ge 2$ be integers and let $\mathcal{A}=\{A_1,\dots,A_m\}$ be a partition of $[n]=\{1,\dots,n\}$. For $X \subseteq [n]$, its $\mathcal{A}$-boundary region $\mathcal{A}(X)$ is defined to be the union of those blocks $A_i$ of…

The numerical condition of the problem of intersecting a fixed $m$-dimensional irreducible complex projective variety $Z\subseteq\mathbb{P}^n$ with a varying linear subspace $L\subseteq\mathbb{P}^n$ of complementary dimension $s=n-m$ is…

We prove an explicit finite-sample version of the Borel--Cantelli lemma under $m$-dependence. Given any $m$-dependent sequence of events $(A_k)_{1\leq k\leq N}$, we show that \[ \mathbb{P}\Bigl(\bigcup_{k=1}^N A_k\Bigr) \ge 1 -…

Let $\mathbb{F}$ be a field, let $P \subseteq \mathbb{F}^d$ be a finite set of points, and let $\alpha,\beta \in \mathbb{F} \setminus \{0\}$. We study the quantity \[|\Pi_{\alpha, \beta}| = \{(p,q,r) \in P \times P \times P \mid p \cdot q =…

We consider the problem of sketching the $p$-th frequency moment of a vector, $p>2$, with multiplicative error at most $1\pm \epsilon$ and \emph{with high confidence} $1-\delta$. Despite the long sequence of work on this problem, tight…

We show that by restricting the degrees of the vertices of a graph to an arbitrary set \( \Delta \), the threshold point $ \alpha(\Delta) $ of the phase transition for a random graph with $ n $ vertices and $ m = \alpha(\Delta) n $ edges…

This paper reconsiders the problem of calculating the expected set of probabilities <p_i>, given the observed set of items {m_i}, that are distributed among n bins with an (unknown) set of probabilities {p_i} for being placed in the ith…

Fix $p>1$, not necessarily integer, with $p(d-2)<d$. We study the $p$-fold self-intersection local time of a simple random walk on the lattice $\Z^d$ up to time $t$. This is the $p$-norm of the vector of the walker's local times, $\ell_t$.…

We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an…

Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. samples $X_1, \dots, X_N$ drawn uniformly from $E$, what is the probability that $\cup_i \mathbf{B}(X_i, \delta)$, the union of $\delta$-balls…

In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…

This paper proposes an easy-to-compute upper bound for the overlap index between two probability distributions without requiring any knowledge of the distribution models. The computation of our bound is time-efficient and memory-efficient…

A polygon C is an intersecting polygon for a set O of objects in the plane if C intersects each object in O, where the polygon includes its interior. We study the problem of computing the minimum-perimeter intersecting polygon and the…

Nuclear reaction rates in plasmas depend on the overlap (contact) probability of the reacting ions. Path integral Monte Carlo (PIMC) calculations are used here to determine these contact probabilities, g(0), for the one component plasma…