All Questions
Tagged with pr.probability co.combinatorics
802 questions
9
votes
1
answer
1k
views
Points on binary hemispheres of the n-sphere
Let $\mathbb{S}^{n-1}=${$ x\in \mathbb{R}^n| \sum_{k=1}^n x_k^2 =1 $} be the $n-1$ sphere and $n_i\in\mathbb{R}^n$ with components $n_{ij}\in${$-1,1$}$\ \forall\ j=1,2,\dots,n$. There are obviously $2^...
- 91
9
votes
1
answer
889
views
Combinatorics for the action of Virasoro / Kac–Schwarz operators: partition polynomials of free probability theory
In the background sections below, I establish the relations among characterizations of the action of Virasoro / Kac–Schwarz operators of 2D gravity models presented in terms of Laurent series by ...
- 10.5k
9
votes
0
answers
467
views
Measuring the randomness of texts
The question concerns statistic properties of random words in a finite alphabet $A$.
By $A^{<\omega}$ we denote the set of all words in the alphabet $A$, i.e. finite sequences of elements of $A$.
...
- 41.9k
9
votes
1
answer
1k
views
Bounding the probability that two binomials are equal
Note: This question was migrated from this earlier post, where it initially appeared. Following suggestions, I moved this into its own question.
Let $B_{n,p}$ denote the usual binomial random ...
- 2,720
9
votes
0
answers
1k
views
Balls and bins -- concentration bounds pertaining to the minimal load bin
Consider the standard balls and bins process, where $m$ balls are thrown uniformly at random into $n$ bins. Previous work has been done on estimating the value of the maximum load (i.e., the number of ...
- 201
8
votes
3
answers
675
views
What are the odds of a tie in a random election with k candidates?
Consider an election with $N$ voters and $k$ candidates, where each voter votes randomly for one of the candidates. What are the odds of a tie?
Here "tie" means that multiple candidates get the ...
- 83
8
votes
1
answer
598
views
Expected value of biggest distance of adjacent points uniformly picked in $[0,1]$
We pick $n\ge 2$ points in $[0,1]$ with uniform distribution. What is the expected value of the largest distance of $2$ adjacent points?
- 48.9k
8
votes
2
answers
990
views
What is the tropical Robinson-Schensted-Knuth correspondence?
And what are it's applications? A conceptual explanation would be great! Is there an expository note about this somewhere?
Some references have already appeared in the answers and comments below. To ...
- 85.6k
8
votes
1
answer
380
views
Question about estimating random symmetric sums modulo p
Let $n > 0$ be a positive integer (large) and $p > 2$ a fixed prime number. What is the probability that $$\sum_{ 1 \leq i < j \leq n} a_ia_j = 0 \mod p$$ where $a_1, a_2, \dots a_n$ are ...
- 1,101
8
votes
2
answers
512
views
The average of reciprocal binomials
This question is motivated by the MO problem here. Perhaps it is not that difficult.
Question. Here is an cute formula.
$$\frac1n\sum_{k=0}^{n-1}\frac1{\binom{n-1}k}=\sum_{k=1}^n\frac1{k2^{n-k}}...
- 43.2k
8
votes
1
answer
171
views
On the existence of a particular type of finite measure on $\mathbb N$
Let $\mathbb N$ denote the set of all positive integers. Does there exist a countably additive measure $\mu : \mathcal P(\mathbb N) \to [0,\infty)$ such that $\mu(\mathbb N)<\infty$ and $\mu(\{nk: ...
- 1,209
8
votes
3
answers
789
views
A Variance-Tail Description for Continuous Probability Distributions
Start with a continuous probability distribution given by a density function f(x). Let X be a real random variable whose distribution is given by the probability distribution.
I would like to ask ...
- 24.7k
8
votes
2
answers
484
views
Inductive definition of Bernstein polynomials
For $n\in \mathbb{N}$ let $B_n$ be the linear operator taking a function $f$ on the unit interval $I=[0,1]$ to its $n$-th Bernstein polynomial $B_nf$,
$$ B_nf(x):=\sum_{k=0}^n\binom{n}{k} f\Big(\...
- 60.5k
8
votes
3
answers
411
views
Identifying a subset with as few tests as possible
Informal description: You are given a set of $n$ blood samples, each having probability $p$ of being infected with a disease. Your goal is to determine the set $P$ of infected samples with as few ...
- 32.5k
8
votes
2
answers
379
views
Sets whose elements are mutually "weakly" coprime?
Fix $n$ and $k$. I want a set $S\subseteq\{1,\ldots,n\}$ with the property that for every $x\in S$,
$$\mathrm{gcd}\bigg(x,\prod_{y\in S\setminus\{x\}}y\bigg)<\frac{x}{k}.$$
How small should a ...
- 7,633
8
votes
1
answer
576
views
probability theory for combinatorialists
More than one combinator(ial?)ist has asked me to recommend a good book to learn probability from, and I never know what to say; the probability theory that I use in my research up was mostly learned ...
8
votes
1
answer
723
views
Does $|A+A|$ concentrate near its mean?
Fix $N$ to be a large prime. Let $A \subset \mathbb{Z}/N\mathbb{Z}$ be a random subset defined by $\mathbb{P}(a \in A) = p$, where $p = N^{-2/3 + \epsilon}$ for some fixed $\epsilon > 0$. My ...
- 2,283
8
votes
4
answers
1k
views
A Pascal's-triangle -like random process
I was exploring Pascal's triangle on a cylinder when I encountered this puzzle-like problem.
It is surely elementary, but perhaps weekend-entertaining.
Start with a permutation of $(1,2,3, \ldots, n)$...
- 151k
8
votes
1
answer
452
views
What is the probability that a random subset of a finite group is generic?
Definition 1: Given a group $G$, a subset $X \subseteq G$, and a natural number $k$,
we say that $X$ is (left) $k$-generic in $G$ if there are $k$ many left translates of $X$ that cover $G$.
That is, ...
- 83
8
votes
2
answers
475
views
Random permutations without double rises (avoiding consecutive pattern $\underline{123}$)
A permutation avoiding a consecutive pattern $\underline{123}$ is permutation
$\pi = \pi_1 \pi_2 \ldots \pi_n$ with the property that there does not exists $i \in [1, n-2]$
such that $\pi_i < \pi_{...
- 345
8
votes
1
answer
174
views
Equalizing Geometric means of Graph Cycles
Consider a strongly connected directed graph $G$. I have been stuck on the following question: can you assign real numbers in $[0,1]$ to each edge of $G$ so that the geometric mean of all cycles are ...
- 183
8
votes
1
answer
2k
views
Van Den Berg-Kesten-Reimer inequality
Van Den Berg-Kesten-Reimer inequality
Let $n$ be a positive integer. For $i\in[n]$, let $\Omega_i$ be a finite set and $\mu_i$ a probability measure on it. Set $\Omega=\Omega_1\!\times\!\ldots\!\...
- 148
8
votes
2
answers
240
views
Mixed moments for the birthday problem
Let $X_1,X_2,\dots$ be iid draws from the uniform distribution on $\{1,2,...,m\}$, and let the random variable $N$ be the minimum $j$ such that $X_j = X_i$ for some $i<j$.
I'm aware that the ...
- 19.7k
8
votes
1
answer
1k
views
How to generate Voronoi diagram with polygons of equal area?
I would like to generate some random set of points so that their Voronoi diagram consist of equal-area polygons. Is it possible to impose some constraints on the points in order to have the same areas ...
8
votes
1
answer
478
views
Scheduling "parent talks" at school
Real life motivation. In my younger son's class, there are $18$ students. His teacher provided $18$ time slots for the parents of each child to have a 30-minute conversation of their kid's progress in ...
- 48.9k
8
votes
1
answer
461
views
Probability of good colorings in randomly-colored graphs
Each vertex in a graph is randomly and independently colored either red or blue with equal probability.
A coloring is called $r$-good, for some fraction $r\in[0,1]$, if at least a fraction $r$ of the ...
- 3,549
8
votes
1
answer
227
views
Distribution of entries of a doubly-sorted random matrix
Take an $n \times n$ random matrix whose entries are i.i.d. with uniform distribution in $[0,1]$. Look at the sums of the elements of each row and then permute the rows so that these sums form an ...
- 2,479
8
votes
1
answer
350
views
Distribution of big component of set partitions
Consider the set $S_n = \{1, \dotsc, n\},$ and consider the set $P(n, k)$ of partitions of $S_n$ into $k$ parts (the cardinality of $P(n, k)$ is the Stirling number of the second kind $S(n, k).$ ...
- 96.4k
8
votes
1
answer
327
views
Transitive closure of balanced mass transport in Z (move to close)
Given two atomic measures $\mu$ and $\nu$ on $\mathbb{Z}$, write $\mu \sim \nu$ iff there exist countable decompositions $\mu = \mu_1 + \mu_2 + \cdots$ and $\nu = \nu_1 + \nu_2 + \cdots$ along with ...
- 19.7k
8
votes
1
answer
534
views
The cars problem, again
Consider the following simple problem: We are given $2n$ parking spots, labelled from 0 to $2n-1$. There are $n$ cars on the first $n$ spots, and the remaining $n$ spots are free. At every step, every ...
8
votes
1
answer
270
views
Sizes of connected components from a random choice in a grid
This is inspired by the illustration in this recently updated question. So we take a (fairly big) $n$ and an $n \times n$ grid where we draw at random one diagonal in each of the $1 \times 1$ squares. ...
- 13.4k
8
votes
1
answer
198
views
Tail bound of a distribution
Let $X_1, X_2, \ldots, X_n, Y_1, Y_2, \ldots, Y_n$ be independent binary random variables each being $1$ with probability $\frac{1}{k}$.
Let $Z = X_1(Y_1 + \cdots + Y_k) + X_2(Y_2 + \cdots + Y_{k+1})...
- 305
8
votes
1
answer
519
views
devise a joint distribution of $\alpha$ and $\beta$
If we assume probability density distribution functions of random variables $\alpha$, $\beta$ and $\alpha/ \beta$, we would like to devise a joint distribution of $\alpha$ and $\beta$. Although ...
- 81
8
votes
0
answers
304
views
"Meritocratic" pyramid schemes
There have been a couple of times in my life when people from multi-level marketing organizations attempted to recruit me. I listened to what they had to say, and both times I did not get involved ...
- 2,075
8
votes
0
answers
181
views
Self-avoiding walks on strips
A strip is a locally finite graph which admits a quasi-transitive (i.e. finitley many orbits on vertices) action of $\mathbb Z$. A self avoiding walk is a walk which visits no vertex more than once.
...
- 2,671
8
votes
0
answers
240
views
Stepanov phase transition in random graph
Consider the classical random graph model G(n,p), with p=c/n, as proposed by Erd\"os and R\'enyi.
At this scaling, the most prominent feature is arguably the abrupt change of the topology that the ...
- 468
8
votes
0
answers
254
views
Quantum coupon collection: positivity of an alternating sum of matrices
It is well-known that in the classic coupon collecting problem (CCP), the expected waiting time is
\begin{equation*}
T_n(x_1,\ldots,x_n) = \sum_{k=1}^n (-1)^{k+1}\sum_{1\le i_1 < \cdots < i_k \...
- 28.6k
8
votes
0
answers
241
views
Generalised Polya's urn with i.i.d. replacement
Let $\mu$ be a fixed measure (possibly with moment conditions) on $\mathbb N$ and $X_1,X_2,\dots$ be i.i.d. samples from $\mu$. Start with one white and one black ball in the urn. At the $n$-th step, ...
- 491
7
votes
3
answers
790
views
Expected cardinality of a randomly chosen element of the family of subsets of $\{1,\ldots,n\}$ with at most $k$-elements
Assume that $1\le k \le n$ and let $\mathscr{Z}$ be the family of all subsets of $\{1,\ldots,n\}$ with at most $k$ elements. Pick a random element $X$ of $\mathscr{Z}$ (we consider the probablity ...
- 1,658
7
votes
5
answers
682
views
Bound on sum of complex summands involving binomial coefficients
I am trying to find the asymptotic behavior of the sum:
$$ \sum^n_{i=0} \begin{pmatrix} 2n \\ i \end{pmatrix} x^i y^{2n-i}$$
as $n\rightarrow\infty$. Here $x$, $y$ are complex numbers and I have $|x|...
- 93
7
votes
4
answers
1k
views
Recent impressive combinatorial developments in probability theory
In the preface to the second edition of Daniel Stroock's book "Probability Theory: An Analytic View", there is this striking claim (on p. xv)
... I suspect that, for at least a decade, the most ...
- 1,302
7
votes
3
answers
2k
views
Problem about expectation of maximum partial sum
Given a number $m$, a random composition (strong) of this number into $n$ positive parts so that we can get $n$ random variable $X_1, X_2,\dots, X_n$ with $$X_1+X_2+\cdots+X_n=m$$
Note that all ...
- 177
7
votes
3
answers
346
views
Concentration Bound of $0/1$ permanent
If I pick a random $0/1$ $n\times n$ matrix with $0$ occuring with probability $p$ then what does the distribution of the permanent look like?
- 13.9k
7
votes
2
answers
627
views
Probability vertices are adjacent in a polygon
With regard to my original question:
A subset of k vertices is chosen from the vertices of a regular N-gon. What is the probability that two vertices are adjacent?
I suppose that the responses ...
- 73
7
votes
2
answers
347
views
Matrices over $\mathbb{F}_p$ that have nonzero determinant under any element permutation
$\DeclareMathOperator\GL{GL}$A few months ago, the following discussion took place on AoPS, concerning matrices that have nonzero determinant under any permutation of their entries: https://...
- 541
7
votes
2
answers
2k
views
Assigning positive edge weights to a graph so that the weight incident to each vertex is 1.
Let $\Gamma=(G,E)$ be a connected undirected graph, with no loops or multiple edges. $G$ is finite or countably infinite. For each edge $e=\{x,y\}\in E$, we assign a positive, symmetric edge weight $...
- 269
7
votes
2
answers
366
views
On permanent of a square of a doubly stochastic matrix
Let $A = (a_{i,j})$ be a double stochastic matrix with positive entries. That is, all entries are positive real numbers, and each row and column sums to one. A permanent of a matrix $A = (a_{i,j})$ is ...
user125543
7
votes
3
answers
330
views
Quantifying the noninvertibility of a function
Given a function $f$ from a finite set $X$ to itself, it seems natural to consider $\kappa_f := (\sum_{x \in X} |f^{-1}(x)|^2)/|X|$ as a measure of the non-invertibility of $f$: it equals 1 if $f$ is ...
- 19.7k
7
votes
1
answer
318
views
Finding a short path using $(0.99n)!$ permutations
Suppose I have $n$ points $x_1,\dots,x_n$ that are all independent uniform samples in the unit square, and I'd like to find a short path (in terms of Euclidean length) that touches all of them (a ...
- 4,049
7
votes
3
answers
1k
views
Sum of inverse of multinomial coefficients
Find an asymptotically tight estimate for the sum
$$
A_n^{k}(\lambda)= \sum_{
\substack{a_i\geq \lambda_i
\\
a_1+a_2+\dots a_k=n
}} \prod_{i=1}^k a_i!
$$
Is the leading term going to be
$$|\textrm{...
- 1,306