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.
3
votes
Hoeffding's inequality for vector valued random variables
Here is one way to extend it using a simple union bound to control the deviation of every coordinate at once. You could imagine other ways to extend it, but ensuring that every coordinate is near the …
5
votes
0
answers
147
views
Left passage probability of $SLE_8$?
Schramm's formula on left passage probabilities of $SLE_k$ is stated for $k \in [0,8)$ in theorem 2 here. However, after the statement he remarks that the formula simplifies to $1/2$ for $k = 8$. It s …
6
votes
1
answer
128
views
The distribution of the area of a region cut out by chordal SLE?
Let $\mathbb{D}$ be the unit disc. Let $a,b \in \partial \mathbb{D}$. Let $\gamma$ be a chordal $SLE_{k}$ from $a$ to $b$.
For $k \leq 4$, $\gamma$ is a simple curve, and so $\mathbb{D} \setminus \ga …
4
votes
Shannon entropy and doubly stochastic matrices
Consider any $n \times n$ left stochastic matrix $A$, i.e. each column sums up to $1$. We argue that if $H(Ap) \geq H(p)$ for all probability distributions $p$, then $A$ is doubly stochastic.
Take $p$ …
7
votes
0
answers
170
views
What is known about the distribution of lengths of the cycle you get by adding an edge to a ...
Let $G$ be a finite, connected graph. Let $T$ be a uniform spanning tree, and let $e$ be a uniformly random edge not in $T$. When we add $e$ to $T$, we get a subgraph with a unique cycle, $C$. I am in …