All Questions
Tagged with expectation co.combinatorics
8 questions
0
votes
2
answers
239
views
Computing the expectation of a quadratic matrix form involving Bernoulli and Gaussian distributed matrices
I am working with two random matrices, $Z$ and $H$:
$Z$ is an $n \times K$ matrix with entries sampled i.i.d. from a Bernoulli distribution: $Z_{ij} \sim \mathrm{Bernoulli}(p)$.
$H$ is a $K \times K$ ...
- 37
2
votes
0
answers
730
views
Expected value of length of longest cycle in permutation
Let $n$ be a positive integer and let $S_n$ be the collection of permutations $\pi:\{1,\ldots,n\}\to \{1,\ldots,n\}$. For $\pi\in S_n$ let $\text{maxcyc}(\pi)$ denote the length of the longest cycle ...
- 48.8k
1
vote
1
answer
141
views
Expectation of maximum of all period lengths of functions $f:\{1,\ldots,n\}\to\{1,\ldots,n\}$
This is based on an older question.
For $n\in\mathbb{N}$, let $[n]:= \{1,\ldots,n\}$. Let $\text{Fun}(n)$ denote the set of all functions $f:[n]\to[n]$. To $f\in\text{Fun}(n)$ and ''starting value'' $...
- 48.8k
6
votes
2
answers
274
views
Expectation of period length of functions $f:\{1,\ldots,n\}\to \{1,\ldots,n\}$
For $n\in\mathbb{N}$, let $[n]:= \{1,\ldots,n\}$. Let $\text{Fun}(n)$ denote the set of all functions $f:[n]\to[n]$. To $f\in\text{Fun}(n)$ associate a sequence $\text{seq}(f))$ defined recursively by
...
- 48.8k
10
votes
2
answers
270
views
Maximal in-degree in directed voting graph
Real-life motivation. Our team has $n$ members. For the next in-team presentation session, everyone had 1 talk prepared that he or she would be able to present. Now everyone could cast $1$ vote about ...
- 48.8k
2
votes
0
answers
112
views
The expected size of a subtree of any labelled rooted tree
Consider the set of labelled rooted trees of size $n$, $\mathcal{T}_n$. Let $r$ be the root of each tree $T=(V,E)\in\mathcal{T}$, $r\in V(T)$, and let $n(u)$ be the number of vertices of the subtree $...
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.8k
5
votes
2
answers
258
views
Neighboring number of a permutation
For any positive integer $n\in\mathbb{N}$ let $S_n$ denote the set of all bijective maps $\pi:\{1,\ldots,n\}\to\{1,\ldots,n\}$. For $n>1$ and $\pi\in S_n$ define the neighboring number $N_n(\pi)$ ...
- 48.8k