English
Related papers

Related papers: Random sorting networks: local statistics via rand…

200 papers

We consider the probability of two large gaps (intervals without eigenvalues) in the bulk scaling limit of the Gaussian Unitary Ensemble of random matrices. We determine the multiplicative constant in the asymptotics. We also provide the…

Mathematical Physics · Physics 2020-03-19 Benjamin Fahs , Igor Krasovsky

In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…

Probability · Mathematics 2018-01-09 Antar Bandyopadhyay , Debleena Thacker

We consider a general class of $N\times N$ random matrices whose entries $h_{ij}$ are independent up to a symmetry constraint, but not necessarily identically distributed. Our main result is a local semicircle law which improves previous…

Probability · Mathematics 2013-05-28 Laszlo Erdos , Antti Knowles , Horng-Tzer Yau , Jun Yin

The problem of finding large average submatrices of a real-valued matrix arises in the exploratory analysis of data from a variety of disciplines, ranging from genomics to social sciences. In this paper we provide a detailed asymptotic…

Probability · Mathematics 2013-06-17 Shankar Bhamidi , Partha S. Dey , Andrew B. Nobel

In this article, we consider limit theorems for some weighted type random sums (or discrete rough integrals). We introduce a general transfer principle from limit theorems for unweighted sums to limit theorems for weighted sums via rough…

Probability · Mathematics 2017-07-07 Yanghui Liu , Samy Tindel

Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…

Social and Information Networks · Computer Science 2016-11-17 Alexander P. Kartun-Giles , Orestis Georgiou , Carl P. Dettmann

In this paper we study the number of key exchanges required by Hoare's FIND algorithm (also called Quickselect) when operating on a uniformly distributed random permutation and selecting an independent uniformly distributed rank. After…

Probability · Mathematics 2013-11-20 Benjamin Dadoun , Ralph Neininger

The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it pattern}. The main result is a central limit theorem for these…

Combinatorics · Mathematics 2024-06-11 Michael Drmota , Eva-Maria Hainzl , Nick Wormald

Consider $N\times N$ Hermitian or symmetric random matrices $H$ where the distribution of the $(i,j)$ matrix element is given by a probability measure $\nu_{ij}$ with a subexponential decay. Let $\sigma_{ij}^2$ be the variance for the…

Mathematical Physics · Physics 2011-09-27 Laszlo Erdos , Horng-Tzer Yau , Jun Yin

We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…

Combinatorics · Mathematics 2020-02-06 Sho Matsumoto , Piotr Śniady

The \emph{generalized sorting problem} is a restricted version of standard comparison sorting where we wish to sort $n$ elements but only a subset of pairs are allowed to be compared. Formally, there is some known graph $G = (V, E)$ on the…

Data Structures and Algorithms · Computer Science 2021-11-16 William Kuszmaul , Shyam Narayanan

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

Probability · Mathematics 2016-04-08 Charles Bordenave , Pietro Caputo

We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…

Information Theory · Computer Science 2023-03-22 Cornelia Ott , Sven Puchinger , Martin Bossert

The global clustering coefficient serves as a powerful metric for the structural analysis and comparison of complex networks. Random geometric graphs offer a realistic framework for representing the spatial constraints and geometry often…

Statistics Theory · Mathematics 2026-02-23 Mingao Yuan , Md. Niamul Islam Sium

We study the nodal intersections number of random Gaussian toral Laplace eigenfunctions ("arithmetic random waves") against a fixed smooth reference curve. The expected intersection number is proportional to the the square root of the…

Probability · Mathematics 2018-09-26 Maurizia Rossi , Igor Wigman

We consider unitary random matrix ensembles Z_{n,s,t}^{-1}e^{-n tr V_{s,t}(M)}dM on the space of Hermitian n x n matrices M, where the confining potential V_{s,t} is such that the limiting mean density of eigenvalues (as n\to\infty and…

Mathematical Physics · Physics 2009-11-11 T. Claeys , M. Vanlessen

For correlated real symmetric or complex Hermitian random matrices, we prove that the local eigenvalue statistics at any cusp singularity are universal. Since the density of states typically exhibits only square root edge or cubic root cusp…

Probability · Mathematics 2024-11-05 László Erdős , Joscha Henheik , Volodymyr Riabov

We study two one-parameter families of point processes connected to random matrices: the Sine_beta and Sch_tau processes. The first one is the bulk point process limit for the Gaussian beta-ensemble. For beta=1, 2 and 4 it gives the limit…

Probability · Mathematics 2013-11-19 Diane Holcomb , Benedek Valkó

We discuss an approach to compute the first and second moments of the number of eigenvalues $I_N$ that lie in an arbitrary interval of the real line for $N \times N$ Gaussian random matrices. The method combines the standard…

Statistical Mechanics · Physics 2017-11-22 Fernando L. Metz

We study the expected number of solutions of a system of identically distributed exponential sums with centered Gaussian coefficient and arbitrary variance. We use the Adler and Taylor theory of Gaussian random fields to identify a moment…

Probability · Mathematics 2025-04-23 Léo Mathis
‹ Prev 1 3 4 5 6 7 10 Next ›