Related papers: Pattern theorems, ratio limit theorems and Gumbel …

Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each row of X by its sum.…

Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…

We consider a random permutation drawn from the set of permutations of length $n$ that avoid some given set of patterns of length 3. We show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after suitable…

We study the number of occurrences of any fixed vincular permutation pattern. We show that this statistics on uniform random permutations is asymptotically normal and describe the speed of convergence. To prove this central limit theorem,…

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

The circular law asserts that if $X_n$ is a $n \times n$ matrix with iid complex entries of mean zero and unit variance, then the empirical spectral distribution of $\frac{1}{\sqrt{n}} X_n$ converges almost surely to the uniform…

We prove rigorously several results about the site-percolation on random recursive trees, observed in the previous work by Kalay and Ben-Naim [J. Phys. A48(2015), no.4, 0405001, 15 pp.]. For a random recursive tree of size $n$, let every…

We prove that for q>=1, there exists r(q)<1 such that for p>r(q), the number of points in large boxes which belongs to the infinite cluster has a normal central limit behaviour under the random cluster measure phi_{p,q} on Z^d, d>=2.…

Recent empirical work [Leskovec2009] has suggested the existence of a size threshold for the existence of clusters within many real-world networks. We give the first proof that this clustering size threshold exists within a real-world…

We use the cluster method to enumerate permutations avoiding consecutive patterns. We reprove and generalize in a unified way several known results and obtain new ones, including some patterns of length 4 and 5, as well as some infinite…

A sorting network is a shortest path from 12..n to n..21 in the Cayley graph of the symmetric group S(n) generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove…

Motivated by examples from extreme value theory we introduce the general notion of a cluster process as a limiting point process of returns of a certain event in a time series. We explore general invariance properties of cluster processes…

We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…

Any limiting point process for the time normalized exceedances of high levels by a stationary sequence is necessarily compound Poisson under appropriate long range dependence conditions. Typically exceedances appear in clusters. The…

The statistical behavior of the size (or mass) of the largest cluster in subcritical percolation on a finite lattice of size $N$ is investigated (below the upper critical dimension, presumably $d_c=6$). It is argued that as $N \to \infty$…

Fix $\alpha >0$, and sample $N$ integers uniformly at random from $\{1,2,\ldots ,\lfloor e^{\alpha N}\rfloor \}$. Given $\eta >0$, the probability that the maximum of the pairwise GCDs lies between $N^{2-\eta }$ and $N^{2+\eta}$ converges…

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…

We describe an approach that allows us to deduce the limiting return times distribution for arbitrary sets to be compound Poisson distributed. We establish a relation between the limiting return times distribution and the probability of the…

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…