arXiv Analytics

Sign in

arXiv:2310.16434 [math.PR]AbstractReferencesReviewsResources

Spectral gap of convex combination of a random permutation and a bistochastic matrix

Sarah Timhadjelt

Published 2023-10-25Version 1

We consider a random bistochastic matrix of size N of the form (1-r)M + rQ where 0<r<1, M is a uniformly distributed permutation and Q is a given bistochastic matrix. Under sparsity and regularity assumptions on the *-distribution of Q, we prove that the second largest eigenvalue (1-r)M + rQ is essentially bounded by an approximation of the spectral radius of a deterministic asymptotic equivalent given by free probability theory.

Comments: arXiv admin note: text overlap with arXiv:1805.06205 by other authors
Categories: math.PR
Related articles: Most relevant | Search more
arXiv:2307.05768 [math.PR] (Published 2023-07-11)
Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons
arXiv:math/0405356 [math.PR] (Published 2004-05-18, updated 2005-08-25)
Complexities of convex combinations and bounding the generalization error in classification
arXiv:1104.4953 [math.PR] (Published 2011-04-26, updated 2012-05-03)
A generalization of the Erdős-Turán law for the order of random permutation