Skip to main content

All Questions

Filter by
Sorted by
Tagged with
12 votes
1 answer
883 views

The dance marathon problem

In his book, "The Strange Logic of Random Graphs", Joel Spencer describes the "Dance Marathon" problem: Imagine $n$ couples at a Dance Marathon. Each dance each couple remains ...
Bill Bradley's user avatar
  • 3,979
7 votes
1 answer
186 views

$d$-ball approximation for $d\gg 1$ with a convex hull of random points on its boundary

Given a $d$-ball $\mathcal{S}^{d}$, let $P_n$ a set of $n$ points selected uniformly at random on the boundary $\mathcal{S}^{d-1}$ of $\mathcal{S}^{d}$. Let $\mathcal{C}_n$ the convex hull of $P_n$. ...
Penelope Benenati's user avatar
19 votes
5 answers
18k views

Time-inhomogeneous Markov chains

I'm trying to find out what is known about time-inhomogeneous ergodic Markov Chains where the transition matrix can vary over time. All textbooks and lecture notes I could find initially introduce ...
markov-imitator's user avatar
9 votes
2 answers
878 views

Is there a combinatorial/topological treatment of statistical independence?

Is there any reference which studies sets of random variables as independence systems, a type of combinatorial object (see below)? Motivation: In particular, since independence systems are abstract ...
Chill2Macht's user avatar
  • 2,680
7 votes
2 answers
3k views

The largest Wasserstein distance to uniform distribution among all probability distributions with uniform marginals

I am looking for the largest Wasserstein distance to the uniform distribution among all probability distributions with uniform marginals. More specifically, let $\Xi=\{1,2,\ldots,N\}^2$, and let $\nu$...
O. Richard's user avatar
4 votes
1 answer
197 views

On a double sum involving binomial coefficients

For natural $n$, let \begin{equation} p_n:=2^{1-n}\sum_{v=1}^l \binom l{(v+l)/2}1(v\equiv l) \sum_{u=1-v}^{v-1}\binom k{(u+k)/2}1(u\equiv k), \tag{1}\label{1} \end{equation} where $k:=\lfloor(n+1)/...
Iosif Pinelis's user avatar
4 votes
0 answers
188 views

Distributions over permutation groups $\mathcal{S}_n$

Partly inspired by recent developments in enumeration of pattern avoiding permutations, which is known to be connected with Brownian excursions [Hoffman&Rizzolo]. The exciting milestone is the ...
Henry.L's user avatar
  • 8,071
3 votes
1 answer
229 views

Inequality for difference of consecutive atom probabilities for binomial distribution

Edit: This post was originally two questions, the first of which has been answered, but a reference would still be appreciated if existent. The second question has been removed and migrated to its ...
Pat Devlin's user avatar
  • 2,720
3 votes
1 answer
253 views

Bounds for duplicate finding with limited independence

(This is a follow up to this previous question on math.stackexchange.com.) Assume a process that samples uniformly at random from the range $[1,\ldots,n]$. I am interested in the time to find a ...
Raphael's user avatar
  • 33