Related papers: GUE minors, maximal Brownian functionals and longe…

A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…

Let G be a simple connected graph of order n with degree sequence d_1, d_2, ..., d_n in non-increasing order. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer L at most n, we give…

We investigate the longest common substring problem for encoded sequences and its asymptotic behaviour. The main result is a strong law of large numbers for a re-scaled version of this quantity, which presents an explicit relation with the…

The expectation of the descent number of a random Young tableau of a fixed shape is given, and concentration around the mean is shown. This result is generalized to the major index and to other descent functions. The proof combines…

We prove a functional limit theorem for Markov chains that, in each step, move up or down by a possibly state dependent constant with probability $1/2$, respectively. The theorem entails that the law of every one-dimensional regular…

We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…

We show that the Brownian continuum random tree is the Gromov-Hausdorff-Prohorov scaling limit of the uniform spanning tree on high-dimensional graphs including the $d$-dimensional torus $\mathbb{Z}_n^d$ with $d>4$, the hypercube…

We consider the fluctuations of the largest eigenvalue of sparse random matrices, the class of random matrices that includes the normalized adjacency matrices of the Erd\H{o}s-R\'enyi graph $G(N, p)$. We show that the fluctuations of the…

Let $G = (V,E)$ be a graph on $n$ vertices and let $m^*(G)$ denote the size of a maximum matching in $G$. We show that for any $\delta > 0$ and for any $1 \leq k \leq (1-\delta)m^*(G)$, the down-up walk on matchings of size $k$ in $G$ mixes…

We prove that the distribution function of the largest eigenvalue in the Gaussian Unitary Ensemble (GUE) in the edge scaling limit is expressible in terms of Painlev\'e II. Our goal is to concentrate on this important example of the…

This paper establishes a strict mathematical relationship between an arbitrary continuous function on a compact set and its global minima, like the well-known first order optimality condition for convex and differentiable functions. By…

We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…

We look at a graph property called reducibility which is closely related to a condition developed by Brown to evaluate Feynman integrals. We show for graphs with a fixed number of external momenta, that reducibility with respect to both…

In the random geometric graph $G(n,r_n)$, $n$ vertices are placed randomly in Euclidean $d$-space and edges are added between any pair of vertices distant at most $r_n$ from each other. We establish strong laws of large numbers (LLNs) for a…

We experiment with some topics in elementary number theory. For matrices defined by Gaussian primes we observe a circular spectral law for the eigenvalues. We look at matrices defined by Gaussian primes and look at the growth of the…

We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…

In this paper, we study a question of Hong from 1993 related to the minimum spectral radii of the adjacency matrices of connected graphs of given order and size. Hong asked if it is true that among all connected graphs of given number of…

We generalise the Erdos-Renyi limit theorem on the maximum of the partial sums of random variables to the case when the number of terms in these sums is randomly distributed. Certain relations between the limiting theorems of this type and…

We consider the diffusion scaling limit of the vicious walkers and derive the time-dependent spatial-distribution function of walkers. The dependence on initial configurations of walkers is generally described by using the symmetric…

In the last decade there has been increasing interest in the fields of random matrices, interacting particle systems, stochastic growth models, and the connections between these areas. For instance, several objects appearing in the limit of…