Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
A stochastic process is a collection of random variables usually indexed by a totally ordered set.
0
votes
Accepted
Is there a Conditionally Stationary, non-stationary Process which is (strictly) $m-$Dependent?
Let $\{X_i\}_{i=0}^{\infty}$ be an i.i.d. Bernoulli sequence with $P[X_i=1]=P[X_i=0]=1/2$. Consider:
$$\{X_1, X_0, X_2, X_1, X_3, X_2, X_4, X_3, X_5, X_4, X_6, X_5, ...\}$$
1
vote
Accepted
Upper bound of the waiting time of a sum process
This looks like a "Wald equality" question. Define $Y=\sum_{i=1}^{T_n} X_i$. Then:
\begin{align}
1 + x_{max} \geq Y =\sum_{i=1}^{\infty} X_i1\{T_n\geq i\}\\
\end{align}
where $1\{T_n\geq i\}$ is a …
4
votes
2
answers
489
views
Cramér–Rao type bound for absolute estimation error
Let $\{X_1, X_2, \dotsc, X_n\}$ be independent and identically distributed (i.i.d.) random variables sampled from a common distribution with density $f_{\theta}(x)$, where $\theta$ is an unknown param …
1
vote
Expectation over Pareto Sums
For each $i \in \{1, 2, 3, ...\}$ define $Y_i = X_i^{-\alpha/2}$. Define $Z_k$ by:
$$Z_k = \left[ 1 + \left( \frac{1}{1+\sum_{i=1}^kY_i} \right)^{\alpha/2} \right]^{k+1} $$
Note that $1 \leq Y_i < …