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 | |
Results tagged with stochastic-processes
Search options not deleted
user 78525
A stochastic process is a collection of random variables usually indexed by a totally ordered set.
9
votes
Recurrence of Poisson binomial distributed random walk
The result is not true for a general sequence of probabilities $p_n$. For example, if $p_n=1/n^2$ then $\sum_n p_n <\infty$ and therefore by the Borel-Cantelli lemma, almost surely $X_k=0$ (and theref …
- 2,549
2
votes
Simple linear asymptotics for leaving time of particle in open-boundary TASEP
The $O(n)$ statement in your original question is true. (For the $O(j)$ statement, see the note at the bottom.)
If $n$ is your parameter defining the size of the system, and $k\ge1$ is another paramet …
- 2,549
4
votes
Particularities about the honeycomb lattice for the computation of connectivity constant
It's worth mentioning that there is another lattice for which the precise value of the connective constant has been established. In the paper "Self-avoiding walks and trails on the $3.12^2$ lattice" b …
- 2,549
3
votes
What is the derivative of this integral?
The first question is easy: the derivative of $f(t)$ is just $-\alpha(t)$ (except on the almost surely discrete set of points where $\alpha(t)$ has a jump discontinuity, where $f(t)$ is nondifferentia …
- 2,549