Skip to main content
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
Search options not deleted user 36687

Theory and applications of probability and stochastic processes: e.g. central limit theorems, large deviations, stochastic differential equations, models from statistical mechanics, queuing theory.

6 votes
3 answers
450 views

Regarding Ricci curvature of Markov chains

In Ricci curvature of Markov chains on metric spaces Yann Ollivier, defines a coarse Ricci curvature for a Markov chain with transition kernels $\{m_x\}$ defined on a metric space $(X,d)$ as follows: …
0 votes
1 answer
98 views

Weak convergence to product measure form conditional convergence of marginals

$\newcommand\Ac{\mathcal A}$ $\newcommand\BL{\operatorname{BL}}$ $\newcommand\reals{\mathbb R}$ $\newcommand\eps{\varepsilon}$ $\newcommand\pr{\mathbb P}$ $\newcommand\ex{\mathbb E}$ $\newcommand\give …
2 votes
0 answers
76 views

$\sigma$-fields as closure systems

Let $(\Omega,\mathcal A, P)$ be a probability space and let $\Sigma(\mathcal A) \subset 2^{\mathcal A}$ be the collection of all sub-$\sigma$-fields of $\mathcal A$. Then, $\Sigma(\mathcal A)$ is clos …
9 votes
3 answers
2k views

2-Wasserstein (optimal transport) and extension to the set of all signed measures

Consider the 2-Wasserstein distance between probability measures $\mu$ and $\nu$ (on $\mathbb{R}^d$), defined as $$ d_{W_2}(\mu,\nu) = \inf_{\gamma} \Big[\int \|x-y\|^2 d\gamma(x,y)\Big]^{1/2} $$ wh …
2 votes
0 answers
229 views

Multivariate extensions of Ledoux--Talagrand contraction principle

Let $\{\varepsilon_i\}_{i=1}^n$ be a sequence of independent Radecmacher (i.e., symmetric Bernoulli) variables, and let $\phi_i :\mathbb R \to \mathbb R$ be contraction (i.e., 1-Lipschitz) mappings th …
1 vote

Lower bounding the probability that a zero-mean sequence of random variables stays positive

Filling in the details for Anthony's argument: Assume that $\mathbb E |X|^3 \le c$ for numerical constant $c > 0$. Let $X^+ = X \mathbf 1_{X > 0}$ and $X^- = (-X) \mathbf 1_{X < 0}$. Then, $X = X^+ …
Thomas Dybdahl Ahle's user avatar
1 vote
3 answers
252 views

Lower bounding the probability that a zero-mean sequence of random variables stays positive

Assume that $X_n$ is a sequence of a zero-mean and unit variance random variables (and maybe having density w.r.t. to Lebesgue). Can we conclude that $ P(X_n \in [0,R_n]) $ is bounded away from zero e …
1 vote
Accepted

Hanson-Wright inequality with random matrix

Let $x \sim N(0,I_n)$. For any independent rank-1 projection $A$, conditioned on $A$, we have $$x^T A x \sim \chi^2_1.$$ So unconditionally, $x^T A x = O(1)$ with high probability. Now, let $A = \fr …
passerby51's user avatar
  • 1,731
3 votes
1 answer
290 views

Lipschitz functions that saturate the Lipschitz inequality on the average (part 1)

Consider a 1-Lipschitz function $f: \mathbb R^n \to \mathbb R$ satisfying the inequality \begin{align*} |f(x) - f(y)| \le \|x-y\|_2, \;\forall x,y \in \mathbb R^n. \end{align*} For $n \ge 2$, can we f …
3 votes
1 answer
200 views

Quantitative CLT bound

Consider an independent collection of random variables $W_i, i=1,\dots,n.$ and let $Z \sim N(0,1)$. Roughly speaking, we know that $W_i$ are close in distribution to $Z$, say each is itself a sum of $ …
5 votes
2 answers
541 views

Concentration of U-statistics for exchangable distributions (and the unbounded case)

Consider the following so-called $U$-statistic of order 2: $$U = \frac1{\binom{m}{2}} \sum_{i < j} h(w_i,w_j)$$ where $w_1,\dots,w_m$ are IID from some distribution and $h$ is symmetric. If $|h(w_1,w_ …
3 votes
Accepted

Covariance matrix as optimization problem solution?

I believe you can do something like this: Let $X$ be zero mean. Then the covariance matrix is $ \text{cov}(X) = \mathbb{E}[XX^T]$. Hence, by the same argument: \begin{align*} \text{cov}(X) = \text{ …
passerby51's user avatar
  • 1,731
5 votes
3 answers
133 views

Random partitions with prescribed pairwise membership probabilities

Let $(p_{ij}) \in [0,1]^{n \times n}$ be a given symmetric matrix, with $1$ on the diagonal. Suppose $\pi$ is a partition of $[n]=\{1,\dots,n\}$ and let us write $i \stackrel{\pi}{\sim} j$ if $i$ and …
3 votes
0 answers
631 views

Wasserstein distance, convex polytopes and extreme points

Let us consider convex polytopes with $K$ extreme points in $\mathbb{R}^d$. Let $\mathbf{P}$ be such polytope, and let $\text{ext}(\mathbf{P})$ denote its set of extreme points, so that $\mathbf{P} = …
9 votes
Accepted

Random walk with positive uniformly distributed steps

Let $X_t$ be the number of points in $[0,t]$. Then, $X_t$ is a renewal process. Let $m(t) = E[X_t]$. Then renewal theorem says $$ m(t+h) -m(t) \stackrel{t \to \infty}{\longrightarrow} \frac{h}{\mu} …
passerby51's user avatar
  • 1,731

15 30 50 per page