相关论文: Martingales and character ratios

Jack characters are a one-parameter deformation of the characters of the symmetric groups; a deformation given by the coefficients in the expansion of Jack symmetric functions in the basis of power-sum symmetric functions. We study Jack…

This work prepares new probability bounds for sums of random, independent, Hermitian tensors. These probability bounds characterize large-deviation behavior of the extreme eigenvalue of the sums of random tensors. We extend Lapalace…

With the aid of utilising tensor products, we give a simplified proof to the fundamental theorem of Benedetto and Fickus about the existence and characterisation of finite, normalised tight frames. We also establish unit-norm tensor…

The aim of this paper is to give a precise asymptotic description of some eigenvalue statistics stemming from random matrix theory. More precisely, we consider random determinants of the GUE, Laguerre, Uniform Gram and Jacobi beta ensembles…

In his classic book on symmetric functions, Macdonald describes a remarkable result by Green relating the character theory of the finite general linear group to transition matrices between bases of symmetric functions. This connection…

We prove a central limit theorem for a random field generated by d commuting probability preserving transformations; the martingale is given by a commuting filtration (cf. D. Khosnevisan, Multiparameter Processes, Springer 2002). The result…

We study random partitions $\lambda=(\lambda_1,\lambda_2,...,\lambda_d)$ of $n$ whose length is not bigger than a fixed number $d$. Suppose a random partition $\lambda$ is distributed according to the Jack measure, which is a deformation of…

We develop a general approach of the almost sure central limit theorem for the quasi-continuous vectorial martingales and we release a quadratic extension of this theorem while specifying speeds of convergence. As an application of this…

Martingale methods are used to study the almost everywhere convergence of general function series. Applications are given to ergodic series, which improves recent results of Fan \cite{FanETDS}, and to dilated series, including Davenport…

The classic model of computable randomness considers martingales that take real or rational values. Recent work by Bienvenu et al. (2012) and Teutsch (2014) shows that fundamental features of the classic model change when the martingales…

In this article, we propose to use the character theory of compact Lie groups and their orthogonality relations for the study of Frobenius distribution and Sato-Tate groups. The results show the advantages of this new approach in several…

Tensor products of ultrafilters have special combinatorial features closely related to Ramsey's Theorem, making them useful tools in applications. Here we first review their fundamental properties and isolate some new ones, including a…

Hambly, Keevash, O'Connell and Stark have proven a central limit theorem for the characteristic polynomial of a permutation matrix with respect to the uniform measure on the symmetric group. We generalize this result in several ways. We…

We evaluate averages involving characteristic polynomials, inverse characteristic polynomials and ratios of characteristic polynomials for a $N\times N$ random matrix taken from a $L$-deformed Chiral Gaussian Unitary Ensemble with an…

For a measure preserving transformation $T$ of a probability space $(X,\mathcal F,\mu)$ we investigate almost sure and distributional convergence of random variables of the form $$x \to \frac{1}{C_n} \sum_{i_1<n,...,i_d<n}…

We consider the problem of computation of the correlation functions for the z-measures with the deformation (Jack) parameters 2 or 1/2. Such measures on partitions are originated from the representation theory of the infinite symmetric…

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…

The martingale method is used to establish concentration inequalities for a class of dependent random sequences on a countable state space, with the constants in the inequalities expressed in terms of certain mixing coefficients. Along the…

Determinantal point processes have arisen in diverse settings in recent years and have been investigated intensively. We study basic combinatorial and probabilistic aspects in the discrete case. Our main results concern relationships with…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…