中文
相关论文

相关论文: Asymptotics of Plancherel-type random partitions

200 篇论文

We call "Dyson process" any process on ensembles of matrices in which the entries undergo diffusion. We are interested in the distribution of the eigenvalues (or singular values) of such matrices. In the original Dyson process it was the…

概率论 · 数学 2007-05-23 Craig A. Tracy , Harold Widom

Let $\mathcal{P}_k(n)$ denote the set of partitions of $n$ whose largest part is bounded by $k,$ which are in well-known bijection with $(k+1)$-cores $\mathcal{C}_k$. We study a growth process on $\mathcal{C}_k$, whose stationary…

组合数学 · 数学 2026-01-01 Svante Linusson , Alperen Özdemir

We consider the problem of classification of points sampled from an unknown probability measure on a Euclidean space. We study the question of querying the class label at a very small number of judiciously chosen points so as to be able to…

机器学习 · 计算机科学 2020-12-09 Alexander Cloninger , Hrushikesh Mhaskar

This paper presents an algorithm, Voted Kernel Regularization , that provides the flexibility of using potentially very complex kernel functions such as predictors based on much higher-degree polynomial kernels, while benefitting from…

机器学习 · 计算机科学 2015-09-16 Corinna Cortes , Prasoon Goyal , Vitaly Kuznetsov , Mehryar Mohri

Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…

经典分析与常微分方程 · 数学 2015-01-20 Arno B. J. Kuijlaars

A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…

概率论 · 数学 2007-05-23 Alexander V. Gnedin , Yuri Yakubovich

The asymptotic form of the average probability to count $N$ indistinguishable identical particles in a small number $r \ll N$ of binned-together output ports of a $M$-port Haar-random unitary network, proposed recently in \textit{Scientific…

量子物理 · 物理学 2017-12-06 V. S. Shchesnovich

We study probabilistic and combinatorial aspects of natural volume-and-trace weighted plane partitions and their continuous analogues. We prove asymptotic limit laws for the largest parts of these ensembles in terms of new and known hard-…

组合数学 · 数学 2020-11-17 Dan Betea , Alessandra Occelli

The randomized $k$-number partitioning problem is the task to distribute $N$ i.i.d. random variables into $k$ groups in such a way that the sums of the variables in each group are as similar as possible. The restricted $k$-partitioning…

无序系统与神经网络 · 物理学 2007-05-23 Anton Bovier , Irina Kurkova

In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…

概率论 · 数学 2010-06-29 Bela Bollobas , Svante Janson , Oliver Riordan

We study edge asymptotics of poissonized Plancherel-type measures on skew Young diagrams (integer partitions). These measures can be seen as generalizations of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's…

组合数学 · 数学 2021-09-14 Dan Betea , Jérémie Bouttier , Peter Nejjar , Mirjana Vuletić

This paper studies random lozenge tilings of general non-convex polygonal regions. We show that the pairwise interaction of the non-convexities leads asymptotically to new kernels and thus to new statistics for the tiling fluctuations. The…

数学物理 · 物理学 2018-11-21 Mark Adler , Kurt Johansson , Pierre van Moerbeke

We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…

组合数学 · 数学 2013-11-13 Svante Janson , Simone Severini

A common challenge in nonparametric inference is its high computational complexity when data volume is large. In this paper, we develop computationally efficient nonparametric testing by employing a random projection strategy. In the…

统计理论 · 数学 2018-02-20 Meimei Liu , Zuofeng Shang , Guang Cheng

We present a quantum probabilistic algorithm which tests with a polynomial computational complexity whether a given composite number is of the Carmichael type. We also suggest a quantum algorithm which could verify a conjecture by…

量子物理 · 物理学 2009-09-25 A. Carlini , A. Hosoya

We consider n one-dimensional Brownian motions, such that n/2 Brownian motions start at time t=0 in the starting point a and end at time t=1 in the endpoint b and the other n/2 Brownian motions start at time t=0 at the point -a and end at…

复变函数 · 数学 2010-07-30 Evi Daems , Arno Kuijlaars , Wim Veys

Gibbs-type exchangeable random partitions, which is a class of multiplicative measures on the set of positive integer partitions, appear in various contexts, including Bayesian statistics, random combinatorial structures, and stochastic…

统计理论 · 数学 2017-06-14 Shuhei Mano

We study connections between orthogonal polynomials, reproducing kernel functions, and polynomials $p$ minimizing Dirichlet-type norms $\|pf-1\|_{\alpha}$ for a given function $f$. For $\alpha\in [0,1]$ (which includes the Hardy and…

In this note we study a natural measure on plane partitions giving rise to a certain discrete-time Muttalib-Borodin process (MBP): each time-slice is a discrete version of a Muttalib-Borodin ensemble (MBE). The process is determinantal with…

概率论 · 数学 2020-10-30 Dan Betea , Alessandra Occelli

In this paper we studied the double scaling limit of a random unitary matrix ensemble near a singular point where a new cut is emerging from the support of the equilibrium measure. We obtained the asymptotic of the correlation kernel by…

数学物理 · 物理学 2007-11-22 M. Y. Mo