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 |
Theory and applications of probability and stochastic processes: e.g. central limit theorems, large deviations, stochastic differential equations, models from statistical mechanics, queuing theory.
2
votes
Accepted
What is the characteristic function of the devil’s staircase?
This should probably be a comment but I'm 9 points short.
The answer's on wikepedia.
It's $e^{\tfrac{it}2} \prod_{i=1}^\infty cos\left(\frac t{3i}\right)$.
http://en.wikipedia.org/wiki/Cantor_distr …
2
votes
Is this probabilistic principle for stochastic processes known?
I don't think this is true.
Consider one dimensional Brownian motion with $X_0 = 1$ and let $B_i$ be the indicator of the event that the $k$th decimal place is a $0$ (so all of our $B_i$'s are the s …
7
votes
0
answers
635
views
When is an ODE a good approximation to an SDE?
Suppose $X_t$ is a weak solution to a stochastic differential equation in the form
$$d X_t = \sigma(X_t) d W_t + \lambda(X_t) dt$$
for smooth functions $\sigma: \mathbb R^d \to L(\mathbb R^d,\mathbb R …
5
votes
0
answers
95
views
Is there a name for the set of distributions whose probability generating functions are Mobi...
Consider a discrete random variable $N\in\mathbb N$ with
$\mathbb P(N=0) = p$,
$\mathbb P(N=n) = (1-p)(1-q)q^n$ for $n\neq 0$.
Then the probability generating function of $N$
$$\mathbb E(z^N) = \fra …
4
votes
0
answers
152
views
A simplified MCMC / MH algorithm. Are there known convergence results?
Hi, I hope this isn't too basic. We were working on a simulation using a Monte Carlo Within Metropolis algorithm and noticed that the whole thing could be expressed in the form below and simplified dr …
1
vote
Accepted
Giving a general term of a recursive function, and upper bound for it
There's no general upper bound.
Suppose $p_t<1$ for every $t$ and $\sum_{t=1}^\infty p_t = \infty$.
For every $N$ there's a positive probability that $l_N = 0$, then $l_t$ will be larger than $NB …