Search Results

Let $M_n$ be drawn from $n\times n$ matrices under the Circular Orthogonal Ensemble (COE) distribution. Then the eigenvalues of $M_n$ all lie on the unit circle. Starting on the real line and going co …

Let $\mathbb{Z}^d$ be the usual $d$-dimensional lattice and let $\mathbb{H}:=\mathbb{Z}^{d-1}\times Z_+$, where $Z_+:=[0,1,2,\ldots]$. If we now consider bond percolation on $\mathbb{H}$, it is a wel …

Let $G(n,p)$ be the usual random graph on $n$ vertices with each edge existing independently with probability $p$ (no self loops , or double edges not are allowed). I would like to simulate the distri …

Let $\mathcal{F}$ be a sigma algebra over $\Omega$ and $M$ the set of all probability measures on $\mathcal{F}$. Let $\mathcal{C}$ be some collection of pairs $(A,B)$ with $ \ A,B\in\mathcal{F}$. Now …

This question is crossposted from math.stackexchange.com, where it remains unanswered. Let $Y$ be a Young tableau of shape $\lambda:=(\lambda_1,\ldots,\lambda_n)$, where $\lambda_1\geq\lambda_2\geq\l …

Cramer's decomposition theorem states that if $X$ and $Y$ are independent real random variables and $X+Y$ has normal distribution, then both $X$ and $Y$ are normally distributed. I've seen a few proof …

Let $\gamma(i)$ be a self avoiding walk (SAW) on a 2D lattice $L$ (a square lattice for example) starting at a predefined origin ( $\gamma(0)=(0,0)$ ) and having length $n:=\ell(\gamma)$. Furthermore, …

In the paper by Greene, Nijenhuis and Wilf, an algorithm is proposed for generating uniformly random Young tableaux of shape $\lambda$. The algorithm is to uniformly randomly pick a starting cell, and …

I've seen the following remark in a number of papers but don't know what to make of it. In this paper by Cohn, Elkies and Propp, it is mentioned that the normalized average Height function $\mathcal{H …

I recently read the following "open problem" titled "Pennies on a carpet" in "An Introduction To Probability and Random Processes" by Baclawski and Rota (page viii of book, page 10 of following pdf) …

Take a simple random walk $\gamma$ in the complex plane conditioned to start at point $a$ and end at point $b$. For this random walk, we can define the winding number $W_\gamma(a,b)$ around $b$ in the …

Consider a Markov chain on $\mathbb{Z}^d$ with transition kernel $P$ for adjacent vertices (non-diagonal). Essentially this is a $d$ dimensional random walk with the probability of a transition depend …

Let $D$ be the set of all Dyck paths on square grid of size $n\times n$. For any particular Dyck path, let $S(t)=X_1+X_2+\ldots +X_t$ store the path, where $X_i=\pm 1$. Being a Dyck path, we have $S(0 …

This question is somewhat related to this one. Loosely speaking, when should I expect a GOE/GUE distribution? The angle of my approach to this is not through statements such as "there is a natural inv …

Let $T$ be a uniformly random Standard Young Tableau (SYT) of shape $\lambda=(\lambda_1,\cdots,\lambda_k)$ with $|\lambda|=n$. Let $T_{ij}$ denote the value in box $(i,j)$. I'm interested in what can …