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.
52
votes
4
answers
13k
views
Central limit theorem via maximal entropy
Let $\rho(x)$ be a probability density function on $\mathbb{R}$ with prescribed variance $\sigma^2$, so that:
$$\int_\mathbb{R} \rho(x)\, dx = 1$$
and
$$\int_\mathbb{R} x^2 \rho(x), dx = \sigma^2$$
Fa …
18
votes
2
answers
947
views
Is there an axiomatic characterization of the entropy of a continuous random variable?
Let $X$ be a random variable taking values in $\{1,\ldots,n\}$, and let $p_i$ denote the probability of the event $\{X = i\}$. Shannon defined the entropy of $X$ to be the quantity
$$H(X) = -\sum_i …
14
votes
2
answers
382
views
What are some useful invariants for distinguishing between random graph models?
Quite a few probabilistic algorithms for generating random graphs exist in the literature, such as:
The Erdős-Rényi model
The Stochastic Block model
The Watts-Strogatz model
The Barabasi-Albert mode …
26
votes
List of proofs where existence through probabilistic method has not been constructivised
There is an example of this which is important in machine learning: finding linear maps with the restricted isometry property. Given a set $S$ of $m$ points in $\mathbb{R}^N$ (with $N$ very large) an …
1
vote
Topologies for which the ensemble of probability measures is complete
As I asserted in my comments, I think it is too much to hope for a reasonable topology on the space of random variables which makes the map $X \mapsto E(X)$ continuous. This is a bit like hoping that …
10
votes
Probabilistic method used to prove existence theorems
Problem: given points $x_1, \ldots, x_n$ in $\mathbb{R}^d$ with $n << d$ and $0 < \epsilon < 1$, find a linear map $T \colon \mathbb{R}^d \to \mathbb{R}^k$, $k << d$, such that
$$(1 - \epsilon) ||x_i …
5
votes
1
answer
274
views
Is there a good notion of "random bounded linear map" on a separable Hilbert space?
Let $H$ be a separable Hilbert space and let $\{e_i\}$ be an orthonormal basis. My first question is:
Is there a probability measure on $B(H)$ such that for $T$ chosen uniformly randomly the matr …
20
votes
4
answers
3k
views
Is there a statistical interpretation of Green's theorem, Stokes' theorem, or the divergence...
This is cross-posted from math.stackexchange and stats.stackexchange. Probably there is no great answer to this question, but I thought I'd give it a shot here.
I'm teaching a class on integration o …
3
votes
0
answers
471
views
What is the expected Cheeger constant of a random graph?
Recall that the Cheeger constant (AKA isoperimetric constant) of a graph $G$ is the infimum of $\frac{\partial S}{vol S}$ over all subsets $S$ of $G$ with volume no larger than $vol(G)/2$. I would li …
16
votes
How to quantify noncommutativity?
One common way to quantify non-commutativity which is especially popular in operator algebra theory and non-commutative geometry is to use the Schatten norms. Given a bounded operator $T$ on a separa …