Searcharxiv⌕ Search

arXiv subjects

Ashkan Nikeghbali

Publications and source records attributed to Ashkan Nikeghbali.

At least 37 records · Page 2Linked to original sources

Limit operators for circular ensembles

It is known that a unitary matrix can be decomposed into a product of reflections, one for each dimension, and the Haar measure on the unitary group pushes forward to independent uniform measures on the reflections. We consider the sequence of unitary matrices given by successive products of random reflections. In this coupling, we show that powers of the sequence of matrices converge in a suitable sense to a flow of operators which acts on a random vector space. The vector space has an explicit description as a subspace of the space of sequences of complex numbers. The eigenvalues of the matrices converge almost surely to the eigenvalues of the flow, which are distributed in law according to a sine-kernel point process. The eigenvectors of the matrices converge almost surely to vectors which are distributed in law as Gaussian random fields on a countable set. This flow gives the first example of a random operator with a spectrum distributed according to a sine-kernel point process which is naturally constructed from finite dimensional random matrix theory.

math.PR↗

Mod-Gaussian convergence and its applications for models of statistical mechanics

In this paper we complete our understanding of the role played by the limiting (or residue) function in the context of mod-Gaussian convergence. The question about the probabilistic interpretation of such functions was initially raised by Marc Yor. After recalling our recent result which interprets the limiting function as a measure of "breaking of symmetry" in the Gaussian approximation in the framework of general central limit theorems type results, we introduce the framework of $L^1$-mod-Gaussian convergence in which the residue function is obtained as (up to a normalizing factor) the probability density of some sequences of random variables converging in law after a change of probability measure. In particular we recover some celebrated results due to Ellis and Newman on the convergence in law of dependent random variables arising in statistical mechanics. We complete our results by giving an alternative approach to the Stein method to obtain the rate of convergence in the Ellis-Newman convergence theorem and by proving a new local limit theorem. More generally we illustrate our results with simple models from statistical mechanics.

math.PR↗

A limiting random analytic function related to the CUE

We show in this paper that, when properly rescaled in time and in space, the characteristic polynomial of a random unitary matrix converges almost surely to a random analytic function whose zeros, which are on the real line, form a determinantal point process with sine kernel. We prove this result in the framework of virtual isometries to circumvent the fact that the rescaled characteristic polynomial does not even have a moment of order one, hence making the classical techniques of random matrix theory difficult to apply.

math.PR↗

A new kind of augmentation of filtrations suitable for a change of probability measure by a strict local martingale

In this note we introduce a new kind of augmentation of filtrations along a sequence of stopping times. This augmentation is suitable for the construction of new probability measures associated to a positive strict local martingale as done in \cite{split1}, while it is on the other hand rich enough to make classical results from stochastic analysis hold true on some stochastic interval of interest.

math.PR↗

Random permutation matrices under the generalized Ewens measure

We consider a generalization of the Ewens measure for the symmetric group, calculating moments of the characteristic polynomial and similar multiplicative statistics. In addition, we study the asymptotic behavior of linear statistics (such as the trace of a permutation matrix or of a wreath product) under this new measure.

math.PR↗

Limit theorems for orthogonal polynomials related to circular ensembles

For a natural extension of the circular unitary ensemble of order n, we study as n tends to infinity, the asymptotic behavior of the sequence of orthogonal polynomials with respect to the spectral measure. The last term of this sequence is the characteristic polynomial. After taking logarithm and rescaling, we obtain a process indexed by t in [0,1]. We show that it converges to a deterministic limit, and we describe the fluctuations and the large deviations.

math.PR↗

Large cycles and a functional central limit theorem for generalized weighted random permutations

The objects of our interest are the so-called $A$-permutations, which are permutations whose cycle length lie in a fixed set $A$. They have been extensively studied with respect to the uniform or the Ewens measure. In this paper, we extend some classical results to a more general weighted probability measure which is a natural extension of the Ewens measure and which in particular allows to consider sets $A_n$ depending on the degree $n$ of the permutation. By means of complex analysis arguments and under reasonable conditions on generating functions we study the asymptotic behaviour of classical statistics. More precisely, we generalize results concerning large cycles of random permutations by Vershik, Shmidt and Kingman, namely the weak convergence of the size ordered cycle length to a Poisson-Dirichlet distribution. Furthermore, we apply our tools to the cycle counts and obtain a Brownian motion central limit theorem which extends results by DeLaurentis, Pittel and Hansen.

math.PR↗

On the number of zeros of linear combinations of independent characteristic polynomials of random unitary matrices

We show that almost all the zeros of any finite linear combination of independent characteristic polynomials of random unitary matrices lie on the unit circle. This result is the random matrix analogue of an earlier result by Bombieri and Hejhal on the distribution of zeros of linear combinations of $L$-functions, thus providing further evidence for the conjectured links between the value distribution of the characteristic polynomial of random unitary matrices and the value distribution of $L$-functions on the critical line.

math.PR↗

On the number of cycles in a random permutation

We show that the number of cycles in a random permutation chosen according to generalized Ewens measure is normally distributed and compute asymptotic estimates for the mean and variance.

math.PR↗

A new kind of augmentation of filtrations

Let $(Ω,\mathcal{F},(\mathcal{F}_t)_{t \geq 0},\mathbb{P})$ be a filtered probability space satisfying the usual assumptions: it is usually not possible to extend to $\mathcal{F}_{\infty}$ (the $σ$-algebra generated by $(\mathcal{F}_t)_{t \geq 0}$) a coherent family of probability measures $(\mathbb{Q}_t)$, each of them being defined on $\mathcal{F}_t$. It is known that for instance, on the Wiener space, this extension problem has a positive answer if one takes the filtration generated by the coordinate process, but can have a negative answer if one takes its usual augmentation. On the other hand, the usual assumptions are crucial in order to obtain the existence of regular versions of paths for most stochastic processes of interest, such as the local time of the standard Brownian motion, stochastic integrals, etc. In order to fix this problem, we introduce a new property for filtrations, intermediate between the right continuity and the usual conditions. We show that most of the important results of the theory of stochastic processes which are generally proved under the usual augmentation, such as the existence of regular version of trajectories or the début theorem, still hold under the N-augmentation; moreover this new augmentation allows the extension of a coherent family of probability measures whenever this is possible with the original filtration.

math.PR↗

Mod-$ϕ$ convergence

Using Fourier analysis, we study local limit theorems in weak-convergence problems. Among many applications, we discuss random matrix theory, some probabilistic models in number theory, the winding number of complex brownian motion and the classical situation of the central limit theorem, and a conjecture concerning the distribution of values of the Riemann zeta function on the critical line.

math.PR↗

The generalized weighted probability measure on the symmetric group and the asymptotic behavior of the cycles

The goal of this paper is to analyse the asymptotic behavior of the cycle process and the total number of cycles of weighted and generalized weighted random permutations which are relevant models in physics and which extend the Ewens measure. We combine tools from combinatorics and complex analysis (e.g. singularity analysis of generating functions) to prove that under some analytic conditions (on relevant generating functions) the cycle process converges to a vector of independent Poisson variables and to establish a central limit theorem for the total number of cycles. Our methods allow us to obtain an asymptotic estimate of the characteristic functions of the different random vectors of interest together with an error estimate, thus having a control on the speed of convergence. In fact we are able to prove a finer convergence for the total number of cycles, namely \textit{mod-Poisson convergence}. From there we apply previous results on mod-Poisson convergence to obtain Poisson approximation for the total number of cycles as well as large deviations estimates.

math.PR↗

On a flow of operators associated to virtual permutations

Kerov, Olshanski and Vershik introduced the so-called virtual permutations, defined as families of permutations $(σ_N)_{N \geq 1}$, $σ_N$ in the symmetric group of order $N$, such that the cycle structure of $σ_N$ can be deduced from the structure of $σ_{N+1}$ simply by removing the element $N+1$. The virtual permutations, and in particular the probability measures on the corresponding space which are invariant by conjugation, have been studied in a details by Tsilevich. In the present article, we prove that for a large class of such invariant measures (containing in particular the Ewens measure of any parameter $θ\geq 0$), it is possible to associate a flow $(T^α)_{α\in \mathbb{R}}$ of random operators on a suitable functional space. Moreover, if $(σ_N)_{N \geq 1}$ is a random virtual permutation following a distribution in the class described above, the operator $T^α$ can be interpreted as the limit, in a sense which has to be made precise, of the permutation $σ_N^{α_N}$, where $N$ goes to infinity and $α_N$ is equivalent to $αN$. In relation with this interpretation, we prove that the eigenvalues of the infinitesimal generator of $(T^α)_{α\in \mathbb{R}}$ are equal to the limit of the rescaled eigenangles of the permutation matrix associated to $σ_N$.

math.PR↗

The distribution of eigenvalues of randomized permutation matrices

In this article we study in detail a family of random matrix ensembles which are obtained from random permutations matrices (chosen at random according to the Ewens measure of parameter $θ>0$) by replacing the entries equal to one by more general non-vanishing complex random variables. For these ensembles, in contrast with more classical models as the Gaussian Unitary Ensemble, or the Circular Unitary Ensemble, the eigenvalues can be very explicitly computed by using the cycle structure of the permutations. Moreover, by using the so-called virtual permutations, first introduced by Kerov, Olshanski and Vershik, and studied with a probabilistic point of view by Tsilevich, we are able to define, on the same probability space, a model for each dimension greater than or equal to one, which gives a meaning to the notion of almost sure convergence when the dimension tends to infinity. In the present paper, depending on the precise model which is considered, we obtain a number of different results of convergence for the point measure of the eigenvalues, some of these results giving a strong convergence, which is not common in random matrix theory.

math.PR↗

Ewens measures on compact groups and hypergeometric kernels

On unitary compact groups the decomposition of a generic element into product of reflections induces a decomposition of the characteristic polynomial into a product of factors. When the group is equipped with the Haar probability measure, these factors become independent random variables with explicit distributions. Beyond the known results on the orthogonal and unitary groups (O(n) and U(n)), we treat the symplectic case. In U(n), this induces a family of probability changes analogous to the biassing in the Ewens sampling formula known for the symmetric group. Then we study the spectral properties of these measures, connected to the pure Fisher-Hartvig symbol on the unit circle. The associated orthogonal polynomials give rise, as $n$ tends to infinity to a limit kernel at the singularity.

math.PR↗

Circular Jacobi Ensembles and deformed Verblunsky coefficients

Using the spectral theory of unitary operators and the theory of orthogonal polynomials on the unit circle, we propose a simple matrix model for the following circular analogue of the Jacobi ensemble: $$c_{δ,β}^{(n)} \prod_{1\leq k -1/2$. If $e$ is a cyclic vector for a unitary $n\times n$ matrix $U$, the spectral measure of the pair $(U,e)$ is well parameterized by its Verblunsky coefficients $(α_0, ..., α_{n-1})$. We introduce here a deformation $(γ_0, >..., γ_{n-1})$ of these coefficients so that the associated Hessenberg matrix (called GGT) can be decomposed into a product $r(γ_0)... r(γ_{n-1})$ of elementary reflections parameterized by these coefficients. If $γ_0, ..., γ_{n-1}$ are independent random variables with some remarkable distributions, then the eigenvalues of the GGT matrix follow the circular Jacobi distribution above. These deformed Verblunsky coefficients also allow to prove that, in the regime $δ= δ(n)$ with $δ(n)/n \to \dd$, the spectral measure and the empirical spectral distribution weakly converge to an explicit nontrivial probability measure supported by an arc of the unit circle. We also prove the large deviations for the empirical spectral distribution.

math.PR↗

Mod-Gaussian convergence: new limit theorems in probability and number theory

We introduce a new type of convergence in probability theory, which we call ``mod-Gaussian convergence''. It is directly inspired by theorems and conjectures, in random matrix theory and number theory, concerning moments of values of characteristic polynomials or zeta functions. We study this type of convergence in detail in the framework of infinitely divisible distributions, and exhibit some unconditional occurrences in number theory, in particular for families of $L$-functions over function fields in the Katz-Sarnak framework. A similar phenomenon of ``mod-Poisson convergence'' turns out to also appear in the classical Erdős-Kác Theorem.

math.NT↗

A new construction of the $σ$-finite measures associated with submartingales of class $(Σ)$

In a previous paper, we proved that for any submartingale $(X_t)_{t \geq 0}$ of class $(Σ)$, defined on a filtered probability space $(Ω, \mathcal{F}, \mathbb{P}, (\mathcal{F}_t)_{t \geq 0})$, which satisfies some technical conditions, one can construct a $σ$-finite measure $\mathcal{Q}$ on $(Ω, \mathcal{F})$, such that for all $t \geq 0$, and for all events $Λ_t \in \mathcal{F}_t$: $$ \mathcal{Q} [Λ_t, g\leq t] = \mathbb{E}_{\mathbb{P}} [\mathds{1}_{Λ_t} X_t]$$ where $g$ is the last hitting time of zero of the process $X$. Some particular cases of this construction are related with Brownian penalisation or mathematical finance. In this note, we give a simpler construction of $\mathcal{Q}$, and we show that an analog of this measure can also be defined for discrete-time submartingales.

math.PR↗