All Questions
3 questions
1
vote
1
answer
92
views
Geometric sampling problem in the Euclidean space in high dimensions
Let $T$ be the triangle whose vertices are three given points $\mathbf{x}, \mathbf{y}, \mathbf{z}\in\mathbb{R}^d$.
Question: What computationally efficient strategy can we use to sample a point $\...
1
vote
2
answers
197
views
Sampling method for a specific distribution in high dimensions
We are given a set $X$ of $n$ points $\mathbf{x}_1, \mathbf{x}_2, \ldots, \mathbf{x}_n\in\mathbb{R}^d$, where $d\ll n$. Given any point $\mathbf{p}$ on the unit $(d-1)$-sphere $\mathcal{S}$, we define
...
3
votes
0
answers
134
views
Algorithm to calculate moments of uniform distribution on convex polyhedra
There is system of linear inequalities
$$
Ax \leq K,
$$
$$
x\geq a, x\leq b.
$$
$A$ is $(n\times m)$-matrix, where $n\approx 100$ and $m\approx 10000$, $rank(A)=n$.
Suppose that on set of solutions ...