Found problems: 70
Let $ \varepsilon_1,\varepsilon_2,...,\varepsilon_{2n}$ be independent random variables such that $ P(\varepsilon_i\equal{}1)\equal{}P(\varepsilon_i\equal{}\minus{}1)\equal{}\frac 12$ for all $ i$, and define $ S_k\equal{}\sum_{i\equal{}1}^k \varepsilon_i, \;1\leq k \leq 2n$. Let $ N_{2n}$ denote the number of integers $ k\in [2,2n]$ such that either $ S_k>0$, or $ S_k\equal{}0$ and $ S_{k\minus{}1}>0$. Compute the variance of $ N_{2n}$.
Let $\xi_1 , \xi_2 , ...$ be a series of independent, zero-expected-value random variables for which $\lim_{n\to\infty} E(\xi_n ^ 2) = 0$, and $S_n = \sum_{j = 1}^n \xi_j$ . Denote by I(A) the indicator function of event A. Prove that
$$\frac{1}{\log n} \sum_{k = 1}^n \frac1k I\bigg(\max_{1\leq j\leq k} |S_j|>\sqrt k\bigg) \to 0$$
with probability 1 if $n\to\infty$ .
Petya and Vasya are playing the following game. Petya chooses a non-negative random value $\xi$ with expectation $\mathbb{E} [\xi ] = 1$, after which Vasya chooses his own value $\eta$ with expectation $\mathbb{E} [\eta ] = 1$ without reference to the value of $\xi$. For which maximal value $p$ can Petya choose a value $\xi$ in such a way that for any choice of Vasya's $\eta$, the inequality $\mathbb{P}[\eta \geq \xi ] \leq p$ holds?
$\xi, \xi'$ are iid random variables. let F have the distribution function $\xi+\xi'$, and G have the uniform distribution over the interval [-1,1]. Prove that $\max | F ( x ) - G ( x ) | \geq 10^{-1994}$ .
Let $ P$ be a probability distribution defined on the Borel sets of the real line. Suppose that $ P$ is symmetric with respect to the origin, absolutely continuous with respect to the Lebesgue measure, and its density function $ p$ is zero outside the interval $ [\minus{}1,1]$ and inside this interval it is between the positive numbers $ c$ and $ d$ ($ c < d$). Prove that there is no distribution whose convolution square equals $ P$.
[i]T. F. Mori, G. J. Szekely[/i]
Let $n, k \geq 3$ be integers, and let $S$ be a circle. Let $n$ blue points and $k$ red points be
chosen uniformly and independently at random on the circle $S$. Denote by $F$ the intersection of the
convex hull of the red points and the convex hull of the blue points. Let $m$ be the number of vertices
of the convex polygon $F$ (in particular, $m=0$ when $F$ is empty). Find the expected value of $m$.
Let $ \vartheta_1,...,\vartheta_n$ be independent, uniformly distributed, random variables in the unit interval $ [0,1]$. Define \[ h(x)\equal{} \frac1n \# \{k: \; \vartheta_k<x\ \}.\] Prove that the probability that there is an $ x_0 \in (0,1)$ such that $ h(x_0)\equal{}x_0$, is equal to $ 1\minus{} \frac1n.$
[i]G. Tusnady[/i]
Determine the value of \[ \sup_{ 1 \leq \xi \leq 2} [\log E \xi\minus{}E \log \xi],\] where $ \xi$ is a random variable and $ E$ denotes expectation.
[i]Z. Daroczy[/i]
Let $ \xi_1,\xi_2,...$ be independent random variables such that $ E\xi_n=m>0$ and $ \textrm{Var}(\xi_n)=\sigma^2 < \infty \;(n=1,2,...)\ .$ Let $ \{a_n \}$ be a sequence of positive numbers such that $ a_n\rightarrow 0$ and $ \sum_{n=1}^{\infty} a_n= \infty$. Prove that \[ P \left( \lim_{n\rightarrow \infty} %Error. "diaplaymath" is a bad command.
\sum_{k=1}^n a_k \xi_k =\infty \right)=1.\]
[i]P. Revesz[/i]
Let $ \mu$ and $ \nu$ be two probability measures on the Borel sets of the plane. Prove that there are random variables $ \xi_1, \xi_2, \eta_1, \eta_2$ such that
(a) the distribution of $ (\xi_1, \xi_2)$ is $ \mu$ and the distribution of $ (\eta_1, \eta_2)$ is $ \nu$,
(b) $ \xi_1 \leq \eta_1, \xi_2 \leq \eta_2$ almost everywhere, if an only if $ \mu(G) \geq \nu(G)$ for all sets of the form $ G\equal{}\cup_{i\equal{}1}^k (\minus{}\infty, x_i) \times (\minus{}\infty, y_i).$
[i]P. Major[/i]
Let $\alpha$ be an irrational number, and denote $F = \{ (x,y) \in R^2 : y \geq \alpha x \}$ as a closed half-plane bounded by a line. Let $P(\alpha,n) = P(X_1,...,X_n \in F)$, where $X_n$ is a simple, symmetric random walk that starts at the origin and moves with probability 1/4 in each direction. Prove that $P(\alpha,n)$ does not depend on $\alpha$.
Let $ Y_n$ be a binomial random variable with parameters $ n$ and $ p$. Assume that a certain set $ H$ of positive integers has a density and that this density is equal to $ d$. Prove the following statements:
(a) $ \lim _{n \rightarrow \infty}P(Y_n\in H)\equal{}d$ if $ H$ is an arithmetic progression.
(b) The previous limit relation is not valid for arbitrary $ H$.
(c) If $ H$ is such that $ P(Y_n \in H)$ is convergent, then the limit must be equal to $ d$.
[i]L. Posa[/i]
suppose that $S_{\mathbb N}$ is the set of all permutations of natural numbers. finite permutations are a subset of $S_{\mathbb N}$ that behave like the identity permutation from somewhere. in other words bijective functions like $\pi: \mathbb N \longrightarrow \mathbb N$ that only for finite natural numbers $i$, $\pi(i)\neq i$. prove that we cannot put probability measure that is countably additive on $\wp(S_{\mathbb N})$ (family of all the subsets of $S_{\mathbb N}$) that is invarient under finite permutations.
We place n points in the unit square independently, according to a uniform distribution. These points are the vertices of a graph $G_n$. Two points are connected by an edge if the slope of the segment connecting them is nonnegative. Denote by $M_n$ the event that the graph $G_n$ has a 1-factor. Prove that $\lim_{n \to \infty} P(M_ {2n}) = 1$.
Let $U$ be a random variable that is uniformly distributed on the interval $[0,1]$, and let
\[S_n= 2\sum_{k=1}^n \sin(2kU\pi).\]
Show that, as $n\to \infty$, the limit distribution of $S_n$ is the Cauchy distribution with density function $f(x)=\frac1{\pi(1+x^2)}$.
A point $ P$ is performing a random walk on the $ X$-axis. At the instant $ t\equal{}0$, $ P$ is at a point $ x_0$ ($ |x_0|\le N$, where $ x_0$ and $ N$ denote integers, $ N>0$). If at an instant $ t$ ($ t$ being a nonnegative integer), $ P$ is at a point of $ x$ integer abscissa and $ |x|<N$, then by the instant $ t\plus{}1$ it reaches either the point $ x\plus{}1$ or the point $ x\minus{}1$, each with probability $ \frac12$. If at the instant $ t$, $ P$ is at the point $ x\equal{}N$ [$ x\equal{}\minus{}N$], then by the instant $ t\plus{}1$ it is certain to reach the point $ N\minus{}1$ [$ \minus{}N\plus{}1$]. Denote by $ P_k(t)$ the probability of $ P$ being at $ x\equal{}k$ at instant $ t$ ($ k$ is an integer). Find $ \lim_{t\to \infty}P_{k}(2t)$ and $ \lim_{t\to \infty}P_k(2t\plus{}1)$ for every fixed $ k$.
Let $ \{\xi_{k \ell} \}_{k,\ell=1}^{\infty}$ be a double sequence of random variables such that
\[ \Bbb{E}( \xi_{ij} \xi_{k\ell})= \mathcal{O} \left(\frac{ \log(2|i-k|+2)}{ \log(2|j-\ell|+2)^{2}}\right) \;\;\;(i,j,k,\ell =1,2, \ldots ) \\\ .\]
Prove that with probability one,
\[ \frac{1}{mn} \sum_{k=1}^m \sum_{\ell=1}^n \xi_{k\ell} \rightarrow 0 \;\;\textrm{as} \; \max (m,n)\rightarrow \infty\ \\ .\]
[i]F. Moricz[/i]
Let $U_1 , U_2 , U_3$ be iid random variables on [0,1], which in order of magnitude, $U_1^{\ast} \le U_2^{\ast} \leq U_3 ^ {\ast}$. Let $\alpha, p_1 , p_2 , p_3 \in [0,1]$ such that $P(U_j ^ {\ast} \ge p_j)= \alpha$ ( j = 1,2,3). Prove that
$$P \left( p_1 + (p_2-p_1) U_3^{\ast} + (p_3- p_2) U_2^{\ast} + (1-p_3) U_1^{\ast} \geq \frac{1}{2} \right) \geq 1-\alpha$$
suppose that $0\le p \le 1$ and we have a wooden square with side length $1$. in the first step we cut this square into $4$ smaller squares with side length $\frac{1}{2}$ and leave each square with probability $p$ or take it with probability $1-p$. in the next step we cut every remaining square from the previous step to $4$ smaller squares (as above) and take them with probability $1-p$. it's obvios that at the end what remains is a subset of the first square.
[b]a)[/b] show that there exists a number $0<p_0<1$ such that for $p>p_0$ the probability that the remainig set is not empty is positive and for $p<p_0$ this probability is zero.
[b]b)[/b] show that for every $p\neq 1$ with probability $1$, the remainig set has size zero.
[b]c)[/b] for this statement that the right side of the square is connected to the left side of the square with a path, write anything that you can.
For $p_0,\dots,p_d\in\mathbb{R}^d$, let
\[
S(p_0,\dots,p_d)=\left\{ \alpha_0p_0+\dots+\alpha_dp_d : \alpha_i\le 1, \sum_{i=0}^d \alpha_i =1 \right\}.
\]
Let $\pi$ be an arbitrary probability distribution on $\mathbb{R}^d$, and choose $p_0,\dots,p_d$ independently with distribution $\pi$. Prove that the expectation of $\pi(S(p_0,\dots,p_d))$ is at least $1/(d+2)$.
For a real number $ x$ in the interval $ (0,1)$ with decimal representation
\[ 0.a_1(x)a_2(x)...a_n(x)...,\]
denote by $ n(x)$ the smallest nonnegative integer such that
\[ \overline{a_{n(x)\plus{}1}a_{n(x)\plus{}2}a_{n(x)\plus{}3}a_{n(x)\plus{}4}}\equal{}1966 .\]
Determine $ \int_0^1n(x)dx$. ($ \overline{abcd}$ denotes the decimal number with digits $ a,b,c,d .$)
[i]A. Renyi[/i]
From a given triangle of unit area, we choose two points independetly with uniform distribution. The straight line connecting these points divides the triangle. with probability one, into a triangle and a quadrilateral. Calculate the expected values of the areas of these two regions. [A. Renyi]
Let $ 2n$ distinct points on a circle be given. Arrange them into disjoint pairs in an arbitrary way and join the couples by chords. Determine the probability that no two of these $ n$ chords intersect. (All possible arrangement into pairs are supposed to have the same probability.)
An unfair coin, which has the probability of $a\ \left(0<a<\frac 12\right)$ for showing $Heads$ and $1-a$ for showing $Tails$, is flipped $n\geq 2$ times. After $n$-th trial, denote by $A_n$ the event that heads are showing on at least two times and by$B_n$ the event that are not showing in the order of $tails\rightarrow heads$, until the trials $T_1,\ T_2,\ \cdots ,\ T_n$ will be finished . Answer the following questions:
(1) Find the probabilities $P(A_n),\ P(B_n)$.
(2) Find the probability $P(A_n\cap B_n )$.
(3) Find the limit $\lim_{n\to\infty} \frac{P(A_n) P(B_n)}{P(A_n\cap B_n )}.$
You may use $\lim_{n\to\infty} nr^n=0\ (0<r<1).$
Let $Y_1 , ..., Y_n$ be exchangeable random variables, ie for all permutations $\pi$ , the distribution of $(Y_{\pi (1)}, \dots, Y_{\pi (n)} )$ is equal to the distribution of $(Y_1 , ..., Y_n)$. Let $S_0 = 0$ and
$$S_j = \sum_{i = 1}^j Y_i \qquad j = 1,\dots,n$$
Denote $S_{(0)} , ..., S_{(n)}$ by the ordered statistics formed by the random variables $S_0 , ..., S_n$. Show that the distribution of $S_{(j)}$ is equal to the distribution of $\max_{0 \le i \le j} S_i + \min_ {0 \le i \le n-j} (S_{j + i} -S_j)$.