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.
9
votes
Accepted
Brownian motion in $n$ dimensions
The process $\|B(t)\|$ is called $n$-dimensional Bessel process (or Bessel process with parameter $\nu=\frac{n}{2}-1$). I think formula $\bf 4$.1.1.4 of Borodin-Salminen "Handbook of Brownian Motion - …
7
votes
Accepted
Recurrence of Poisson binomial distributed random walk
$S_n$ is a martingale with bounded jumps, and there is a result that it should either converge to a finite limit, or fluctuate, in the sense that $\limsup S_n=+\infty$, $\liminf S_n=-\infty$ (this, I …
5
votes
Accepted
Brownian motion in $\mathbb{R}^n$, probability of hitting a set
It's not that simple. See about polar/nonpolar points/sets e.g. in http://wiki.math.toronto.edu/TorontoMathWiki/index.php/Brownian_Motion_and_Harmonic_functions
If I remember correctly, a set is not …
3
votes
The Borel-Cantelli lemma for random walks
Just a quick remark about another counterexample that one may construct: take a Simple Random Walk (on the integer lattice) in dimension $d\geq 3$ (so it is transient); then, an infinite set can be re …
3
votes
Is the departure process of an infinite server queue independent of the arrival process?
The arrival and departure processes are obviously not independent: suppose that, with some very bad luck, no customers arrived to the system up to now; then (after the completion of the service of tho …
2
votes
More precise formula for small deviations of the Wiener process
See formula (7.15) on p.218 of Mörters-Peres "Brownian motion" (it is better suited for the case $r\to 0$ than (7.14) of Theorem 7.45 there).
2
votes
Accepted
CLT for Bernoulli RV with negative correlation
No, the CLT need not hold under these assumptions. Consider the following example: take $p=1/2$ for definiteness, and divide the (discrete) time into intervals $I_1=[1,2]$, $I_n=(2^{n-1}, 2^n]$, $n\ge …
2
votes
0
answers
95
views
Local martingale for a (two-dimensional) diffusion
Let $X$ be a two-dimensional diffusion (a solution of $dX_t=f(X_t)\,dt+dB_t$, with $B$ a standard two-dimensional Brownian motion) living on some open set $\Lambda\subset \mathbb{R}^2$. Let $h:\Lambda …
1
vote
Problem of random scheduling of queues of tasks
Heuristically, this probability should behave as $O(\sqrt{L/n})$, I guess. Observe that each queue, when not empty, is a random walk with zero drift, that actually moves once every $O(L^{-1})$ instanc …
1
vote
0
answers
44
views
Comparison between the entrance measure and the harmonic measure
Consider the standard two-dimensional Brownian motion, and define $\tau(A)$ to be the hitting time of $A\subset \mathbb{R}^2$. Let $hm_A$ be the harmonic measure (from infinity) on $A$. Let $B(r)$ be …
1
vote
1
answer
108
views
Regularity of the entrance measure of SRW
Let $S(n)$ be the discrete sphere of radius $n$ (i.e., the internal boundary of the Euclidean discrete ball $B(n)$) centered in the origin, and consider a simple random walk starting at some $x\in\mat …
1
vote
Analyzing a multiple-queue single-server model
Let $\lambda:=1-\epsilon_1$, $\mu:=1-\epsilon_2$; also, denote $p_L:=\frac{\lambda}{L}(1-\frac{\mu}{L})$ and $q_L:=\frac{\mu}{L}(1-\frac{\lambda}{L})$. Consider a fixed queue (one of those $L$), then …
1
vote
Regularity of the entrance measure of SRW
We now have a proof of a weaker result (only Hölderness), see Proposition 1.3 of https://arxiv.org/abs/1606.05805 . The Lipschitzness is still beyond our reach...
1
vote
How to prove positive recurrence of a queue server system that stops for maintenance?
In this situation the Foster-Lyapunov criterion still works. Let the state of the system be $n$ when there are $n>0$ customers in the system and the server is working, and $0$ when the server is under …
1
vote
1
answer
143
views
The input and output processes in a single-server queue
Consider an $M/M/1$ queue with the arrival rate $\lambda>0$ and the service rate $\mu>\lambda$ (so that it is stable), in the stationary regime. Let $A_t$ be the number of arrivals in the time interva …