Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noela Müller, Manuel Penschuck, Guangyan Zhou
We show that throughout the satisfiable phase the normalised number of satisfying assignments of a random $2$-SAT formula converges in probability to an expression predicted by the cavity method from statistical physics. The proof is based on showing that the Belief Propagation algorithm renders the correct marginal probability that a variable is set to `true' under a uniformly random satisfying assignment.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We explore some probabilistic applications arising in connections with $K$-theoretic symmetric functions. For instance, we determine certain corner distributions of random lozenge tilings and plane partitions. We also introduce some distributions that are naturally related to the corner growth model. Our main tools are dual symmetric Grothendieck polynomials and normalized Schur functions.
In this paper, we introduce polynomial time algorithms that generate random 3-noncrossing partitions and 2-regular, 3-noncrossing partitions with uniform probability. A 3-noncrossing partition does not contain any three mutually crossing arcs in its canonical representation and is 2-regular if the latter does not contain arcs of the form $(i,i+1)$. Using a bijection of Chen {\it et al.} \cite{Chen,Reidys:08tan}, we interpret 3-noncrossing partitions and 2-regular, 3-noncrossing partitions as restricted generalized vacillating tableaux. Furthermore, we interpret the tableaux as sampling paths o…
Unimodality for Radon partitions of random vectors
本文研究随机高斯向量Radon划分中随机选取部分的规模分布，证明该分布具有强单峰性。
Let $λ$ be a partition of the positive integer $n$ chosen umiformly at random among all such partitions. Let $L_n=L_n(λ)$ and $M_n=M_n(λ)$ be the largest part size and its multiplicity, respectively. For large $n$, we focus on a comparison between the partition statistics $L_n$ and $L_n M_n$. In terms of convergence in distribution, we show that they behave in the same way. However, it turns out that the expectation of $L_n M_n -L_n$ grows as fast as $\frac{1}{2}\log{n}$ We obtain a precise asymptotic expansion for this expectation and conclude with an open problem arising from this study.
We consider procedures of sampling parts from a random integer partition. We determine asymptotically the probabilty distribution of the randomly-selected part whenever the positive integer that is partitioned becomes large.
We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to a continuous-time Markov process. The state space of this process is the infinite-dimensional simplex consisting of all nonincreasing infinite sequences of nonnegative numbers with sum less than or equal to one. The main result about the limit process is the expression of its the pre-generator as a formal second order differential operator in a polynomial a…
For any partition of $\{1, 2, ..., n\}$ we define its {\it increments} $X_i, 1 \le i \le n$ by $X_i = 1$ if $i$ is the smallest element in the partition block that contains it, $X_i = 0$ otherwise. We prove that for partially exchangeable random partitions (where the probability of a partition depends only on its block sizes in order of appearance), the law of the increments uniquely determines the law of the partition. One consequence is that the Chinese Restaurant Process CRP($θ$) (the partition with distribution given by the Ewens sampling formula with parameter $θ$) is the only exchangeabl…
Plant differently colored points in the plane, then let random points ("Poisson rain") fall, and give each new point the color of the nearest existing point. Previous investigation and simulations strongly suggest that the colored regions converge (in some sense) to a random partition of the plane. We prove a weak version of this, showing that normalized empirical measures converge to Lebesgue measures on a random partition into measurable sets. Topological properties remain an open problem. In the course of the proof, which heavily exploits time-reversals, we encounter a novel self-similar pr…
For a given sequence of weights (non-negative numbers), we consider partitions of the positive integer n. Each n-partition is selected uniformly at random from the set of all such partitions. Under a classical scheme of assumptions on the weight sequence, which are due to Meinardus (1954), we show that the largest part in a random weighted partition, appropriately normalized, converges weakly, as n tends to infinity, to a random variable having the extreme value (Gumbel's) distribution. This limit theorem extends some known results on particular types of integer partitions and on the Bose-Eins…
Let $(X_1,X_2,...)$ be a random partition of the unit interval $[0,1]$, i.e. $X_i\geq0$ and $\sum_{i\geq1} X_i=1$, and let $(\varepsilon_1,\varepsilon_2,...)$ be i.i.d. Bernoulli random variables of parameter $p \in (0,1)$. The Bernoulli convolution of the partition is the random variable $Z =\sum_{i\geq1} \varepsilon_i X_i$. The question addressed in this article is: Knowing the distribution of $Z$ for some fixed $p\in(0,1)$, what can we infer about the random partition? We consider random partitions formed by residual allocation and prove that their distributions are fully characterised by t…
Radon Partitions of Random Gaussian Polytopes
本文提出概率框架研究随机高斯点的Radon划分，通过定义Radon多面体编码划分信息，推导概率表达式，并为Reay松弛Tverberg猜想提供新视角。
We propose discrete random-field models that are based on random partitions of $\mathbb{N}^2$. The covariance structure of each random field is determined by the underlying random partition. Functional central limit theorems are established for the proposed models, and fractional Brownian sheets, with full range of Hurst indices, arise in the limit. Our models could be viewed as discrete analogues of fractional Brownian sheets, in the same spirit that the simple random walk is the discrete analogue of the Brownian motion.
We consider shifts $Π_{n,m}$ of a partially exchangeable random partition $Π_\infty$ of $\mathbb{N}$ obtained by restricting $Π_\infty$ to $\{n+1,n+2,\dots, n+m\}$ and then subtracting $n$ from each element to get a partition of $[m]:= \{1, \ldots, m \}$. We show that for each fixed $m$ the distribution of $Π_{n,m}$ converges to the distribution of the restriction to $[m]$ of the exchangeable random partition of $\mathbb{N}$ with the same ranked frequencies as $Π_\infty$. As a consequence, the partially exchangeable random partition $Π_\infty$ is exchangeable if and only if $Π_\infty$ is stati…
We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions of all of the parts together and that of the largest part as $n$ tends to infinity while $m$ is fixed or tends to infinity. In particular, if $m$ goes to infinity not too fast, the largest part satisfies the central limit theorem. The second measure is very general. It includes the Dirichlet distribution and the uniform distribution as special cases. We deri…
We investigate combinatorial properties of a family of probability distributions on finite abelian p-groups. This family includes several well-known distributions as specializations. These specializations have been studied in the context of Cohen-Lenstra heuristics and cokernels of families of random p-adic matrices.
Fix $t \geq 2$. We first give an asymptotic formula for certain sums of the number of $t$-cores. We then use this result to compute the distribution of the size of the $t$-core of a uniformly random partition of an integer $n$. We show that this converges weakly to a gamma distribution after dividing by $\sqrt{n}$. As a consequence, we find that the size of the $t$-core is of the order of $\sqrt{n}$ in expectation. We then apply this result to show that the probability that $t$ divides the hook length of a uniformly random cell in a uniformly random partition equals $1/t$ in the limit. Finally…
This paper presents some general formulas for random partitions of a finite set derived by Kingman's model of random sampling from an interval partition generated by subintervals whose lengths are the points of a Poisson point process. These lengths can be also interpreted as the jumps of a subordinator, that is an increasing process with stationary independent increments. Examples include the two-parameter family of Poisson-Dirichlet models derived from the Poisson process of jumps of a stable subordinator. Applications are made to the random partition generated by the lengths of excursions o…
The hitting partitions are random partitions that arise from the investigation of so-called hitting scenarios of max-infinitely-divisible (max-i.d.)~distributions. We study a class of max-i.d.~laws with exchangeable hitting partitions obtained by size-biased sampling from the jumps of a Lévy subordinator. We obtain explicit formulae for the distributions of these partitions in the case of the multivariate $α$-logistic and another family of exchangeable max-i.d.\ distributions. Specifically, the hitting partitions for these two cases are shown to coincide with the well-known Poisson--Dirichlet …
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an integer parameter N. Then we emulate the theory of random matrices in a combinatorial framework: for any parameter N, we introduce a family of linear forms on the partition algebras which allows us to define a notion of weak convergence similar to the convergence in moments in random matrices theory. A renormalization of the partition algebras allows us to c…
The lattice of the set partitions of $[n]$ ordered by refinement is studied. Given a map $ϕ: [n] \rightarrow [n]$, by taking preimages of elements we construct a partition of $[n]$. Suppose $t$ partitions $p_1,p_2,\dots,p_t$ are chosen independently according to the uniform measure on the set of mappings $[n]\rightarrow [n]$. The probability that the coarsest refinement of all $p_i$'s is the finest partitions $\{\{1\},\dots,\{n\}\}$ is shown to approach $1$ for any $t\geq 3$ and $e^{-1/2}$ for $t=2$. The probability that the finest coarsening of all $p_i$'s is the one-block partition is shown …
Bayesian estimators of diversity indexes on exchangeable random partitions
本文研究可交换随机划分上多样性指数的贝叶斯估计量，证明其为几乎必然且依均值收敛于共同极限的鞅，且局部行为与插入式估计量一致。
We prove a lower bound expansion on the probability that a random $\pm 1$ matrix is singular, and conjecture that such expansions govern the actual probability of singularity. These expansions are based on naming the most likely, second most likely, and so on, ways that a Bernoulli matrix can be singular; the most likely way is to have a null vector of the form $e_i \pm e_j$, which corresponds to the integer partition 11, with two parts of size 1. The second most likely way is to have a null vector of the form $e_i \pm e_j \pm e_k \pm e_\ell$, which corresponds to the partition 1111. The fifth…
We consider a family of distributions on spatial random partitions that provide a coupling between different models of interest: the ideal Bose gas; the zero-range process; particle clustering; and spatial permutations. These distributions are invariant for a "chain of Chinese restaurants" stochastic process. We obtain results for the distribution of the size of the largest component.
We prove a long-standing conjecture which characterises the Ewens-Pitman two-parameter family of exchangeable random partitions, plus a short list of limit and exceptional cases, by the following property: for each $n = 2,3, >...$, if one of $n$ individuals is chosen uniformly at random, independently of the random partition $π_n$ of these individuals into various types, and all individuals of the same type as the chosen individual are deleted, then for each $r > 0$, given that $r$ individuals remain, these individuals are partitioned according to $π_r'$ for some sequence of random partitions …
Using techniques from integrable systems, we obtain a number of exact results for random partitions. In particular, we prove a simple formula for correlation functions of what we call the Schur measure on partitions (which is a far reaching generalization of the Plancherel measure, see math.CO/9905032) and also show that these correlations functions are tau-functions for the Toda lattice hierarchy. Also we give a new proof of the formula due to Bloch and the author, see alg-geom/9712009, for the so called n-point functions of the uniform measure on partitions and comment on the local structure…
In this paper we study random partitions of 1,...n, where every cluster of size j can be in any of w\_j possible internal states. The Gibbs (n,k,w) distribution is obtained by sampling uniformly among such partitions with k clusters. We provide conditions on the weight sequence w allowing construction of a partition valued random process where at step k the state has the Gibbs (n,k,w) distribution, so the partition is subject to irreversible fragmentation as time evolves. For a particular one-parameter family of weight sequences w\_j, the time-reversed process is the discrete Marcus-Lushnikov …
We use k-Schur functions to get the minimal boundary of the k-bounded partition poset. This permits to describe the central random walks on affine Grassmannian elements of type A and yields a polynomial expression for their drift. We also recover Rietsch's parametriza-tion of totally nonnegative unitriangular Toeplitz matrices without using quantum cohomology of flag varieties. All the homeomorphisms we define can moreover be made explicit by using the combinatorics of k-Schur functions and elementary computations based on Perron-Frobenius theorem.
We construct a new sufficient conditions for boundedness or continuity of arbitrary random fields relying on the so-called partition scheme, alike in the classical majorizing measure method. We deduce also the used in the practice (statistics, method Monte-Carlo etc.) exact exponential estimates for tail of distribution of maximum for random field satisfying formulated in this report conditions.
Let $Z^1$ and $Z^2$ be partition functions in the random polymer model in the same environment but driven by different underlying random walks. We give a comparison in concave stochastic order between $Z^1$ and $Z^2$ if one of the random walks has "more randomness" than the other. We also treat some related models: The parabolic Anderson model with space-time Lévy noise; Brownian motion among space-time obstacles; and branching random walks in space-time random environments. We also obtain a necessary and sufficient criterion for $Z^1\preceq_{cv}Z^2$ if the lattice is replaced by a regular tre…
We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In particular, we deduce from the general theory developed here a limit result conjectured previously for Ford's alpha model and its extension, the alpha-gamma model, where restricted exchangeability arises naturally.
Suppose some random resource (energy, mass or space) $χ\geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}χ=θ<\infty $ and suppose the amount of the individual share is necessarily bounded from above by 1. This random partitioning model can naturally be identified with the study of infinitely divisible random variables with Lévy measure concentrated on the interval% $.$ Special emphasis is put on these special partitioning models in the Poisson-Kingman class. The masses attached to the atoms of such partitions are sorted in decrea…
$q$-deformation of random partitions, determinantal structure, and Riemann-Hilbert problem
本文研究q-变形的随机分割，通过q-变形的离散Bessel核推导相关函数的行列式公式，并从q-差Lax形式中推导出q-Painlevé方程。
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 models of diversity in various phenomena. Some distributional results on ordered sizes in the Gibbs partition are established by introducing associated partial Bell polynomials and analysis of the generating functions. The combinatorial approach is applied to derive explicit results on asymptotic behavior of the extreme sizes in the Gibbs partition. Especially,…
An integer partition is called graphical if it is the degree sequence of a simple graph. We prove that the probability that a uniformly chosen partition of size $n$ is graphical decreases to zero faster than $n^{-.003}$, answering a question of Pittel. A lower bound of $n^{-1/2}$ was proven by Erdős and Richmond, and so this demonstrates that the probability decreases polynomially. Key to our argument is an asymptotic result of Pittel characterizing the joint distribution of the first rows and columns of a uniformly random partition, combined with a characterization of graphical partitions due…
Asymptotic Normality and Concentration Inequalities of Statistics of Core Partitions with Bounded Perimeters
本文证明了有界周长均匀随机核分拆的若干统计量在Kolmogorov和Wasserstein距离下具有渐近正态性与次高斯性，并借助Stein方法、Hoeffding分解及Efron-Stein不等式等工具，将Zaleski猜想推广到严格$(n,dn+1)$-核分拆情形。
This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of subpartitions are explicit. The key ideas are to use large deviations estimates for random walks, together with convex analysis and the Hardy-Ramanujan asymptotics. Our limit shape coincides with Vershik's limit shape for uniform random partitions.
In this expository article, we highlight the direct connection between card shuffling and the functions known as $P$-partitions that come from algebraic combinatorics. While many (but not all) of the results we discuss are known, we give a unified treatment. The key idea is this: the probability of obtaining a permutation $π$ from shelf shuffling is the probability that a random $P$-partition is sorted by $π$, and the probability of obtaining $π$ from riffle shuffling is the probability that a random $P$-partition is sorted by $π^{-1}$.
Problem 1.5.7 from Pitman's Saint-Flour lecture notes: Does there exist for each n a fragmentation process (Π_{n,k}, 1 \leq k \leq n) taking values in the space of partitions of {1,2,...,n} such that Π_{n,k} is distributed like the partition generated by cycles of a uniform random permutation of {1,2,...,n} conditioned to have k cycles? We show that the answer is yes. We also give a partial extension to general exchangeable Gibbs partitions.
We analyze Ising/Curie-Weiss models on the Erdős-Rényi graph with $N$ vertices and edge probability $p=p(N)$ that were introduced by Bovier and Gayrard [J.\ Statist.\ Phys., 72(3-4):643--664, 1993] and investigated in two previous articles by the authors. We prove Central Limit Theorems for the partition function of the model and -- at other decay regimes of $p(N)$ -- for the logarithmic partition function. We find critical regimes for $p(N)$ at which the behavior of the fluctuations of the partition function changes.
The distribution of age-ordered frequencies arising from an exchangeable Gibbs partition is studied in relation with the distribution of the positions at which new mutations appear in a sample.
Let $λ$ be a partition of the positive integer $n$, selected uniformly at random among all such partitions. Corteel et al. (1999) proposed three different procedures of sampling parts of $λ$ at random. They obtained limiting distributions of the multiplicity $μ_n=μ_n(λ)$ of the randomly-chosen part as $n\to\infty$. The asymptotic behavior of the part size $σ_n=σ_n(λ)$, under these sampling conditions, was found by Fristedt (1993) and Mutafchiev (2014). All these results motivated us to study the relationship between the size and the multiplicity of a randomly-selected part of a random partitio…
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- and soft-edge distributions of random matrix theory. As a corollary we obtain an asymptotic transition between Gumbel and Tracy--Widom GUE fluctuations for the largest part of such plane partitions, with the continuous Bessel kernel providing the interpolation. We interpret our results in terms of two natural models of directed last passage percolation (LPP):…
Random skew plane partitions of large size distributed according to an appropriately scaled Schur process develop limit shapes. In the present work we consider the limit of large random skew plane partitions where the inner boundary approaches a piecewise linear curve with non-lattice slopes, describing the limit shape and the local fluctuations in various regions. This analysis is fairly similar to that in [OR2], but we do find some new behavior. For instance, the boundary of the limit shape is now a single smooth (not algebraic) curve, whereas the boundary in [OR2] is singular. We also obser…
We study the length statistics of the components of a random multicurve on a surface of genus $g \geq 2$. For each fixed genus, the existence of such statistics follows from the work of M.~Mirzakhani, F.~Arana-Herrera and M.~Liu. We prove that as the genus $g$ tends to infinity the statistics converge in law to the Poisson--Dirichlet distribution of parameter $θ=1/2$. In particular, as the genus tends to infinity the mean length of the three longest components converge respectively to $75.8\%$, $17.1\%$ and $4.9\%$ of the total length.
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 shapes, provided that the representation character ratios and their cumulants converge to zero at some prescribed speed. Our class of examples includes uniformly random shifted standard tableaux with prescribed shape as well as shifted tableaux generated by some natural combinatorial algorithms (such as shifted Robinson-Schensted-Knuth correspondence) applied t…
Symmetries of Random Partitions
本文研究有限集上随机划分的对称性层次，证明单轨道可交换划分在可扩展和部分可交换平稳分布中仍是极值点，并发现n=5时首次出现非可交换极值划分。
Universal Cusp Scaling in Random Partitions
本文研究Schur测度下随机划分的普适标度极限，扩展先前工作获得高阶Pearcey核，并推导间隙概率的耦合非线性微分方程及大间隙渐近行为。
Let $\mathcal{P}=\{p_1,p_2,...\}$ be the set of all odd primes arranged in increasing order. A Goldbach partition of the even integer $2k>4$ is a way of writing it as a sum of two primes from $\mathcal{P}$ without regard to order. Let $Q(2k)$ be the number of all Goldbach partitions of the number $2k$. Assume that $2k$ is selected uniformly at random from the interval $(4,2n], n>2$, and let $Y_n=Q(2k)$ with probability $1/(n-2)$. We prove that the random variable $\frac{Y_n}{n/\left(\frac{1}{2}\log{n}\right)^2}$ converges weakly, as $n\to\infty$, to a uniformly distributed random variable in t…
We study N=2 supersymmetric four dimensional gauge theories, in a certain N=2 supergravity background, called Omega-background. The partition function of the theory in the Omega-background can be calculated explicitly. We investigate various representations for this partition function: a statistical sum over random partitions, a partition function of the ensemble of random curves, a free fermion correlator. These representations allow to derive rigorously the Seiberg-Witten geometry, the curves, the differentials, and the prepotential. We study pure N=2 theory, as well as the theory with matte…
Gibbs-type random probability measures and the exchangeable random partitions they induce represent an important framework both from a theoretical and applied point of view. In the present paper, motivated by species sampling problems, we investigate some properties concerning the conditional distribution of the number of blocks with a certain frequency generated by Gibbs-type random partitions. The general results are then specialized to three noteworthy examples yielding completely explicit expressions of their distributions, moments and asymptotic behaviors. Such expressions can be interpre…
We study right tail large deviations of the logarithm of the partition function for directed lattice paths in i.i.d. random potentials. The main purpose is the derivation of explicit formulas for the $1+1$-dimensional exactly solvable case with log-gamma distributed random weights. Along the way we establish some regularity results for this rate function for general distributions in arbitrary dimensions.
We establish the universal edge scaling limit of random partitions with the infinite-parameter distribution called the Schur measure. We explore the asymptotic behavior of the wave function, which is a building block of the corresponding kernel, based on the Schr{ö}dinger-type differential equation. We show that the wave function is in general asymptotic to the Airy function and its higher-order analogs in the edge scaling limit. We construct the corresponding higher-order Airy kernel and the Tracy-Widom distribution from the wave function in the scalins limit, and discuss its implication to t…
We study the problem of assortative and disassortative partitions on random $d$-regular graphs. Nodes in the graph are partitioned into two non-empty groups. In the assortative partition every node requires at least $H$ of their neighbors to be in their own group. In the disassortative partition they require less than $H$ neighbors to be in their own group. Using the cavity method based on analysis of the Belief Propagation algorithm we establish for which combinations of parameters $(d,H)$ these partitions exist with high probability and for which they do not. For $H>\lceil \frac{d}{2} \rceil…
This habilitation thesis summarizes the research that I have carried out from 2005 to 2019. It is organized in four chapters. The first three deal with random planar maps. Chapter 1 is about their metric properties: from a general map-mobile bijection, we compute the three-point function of quadrangulations, before discussing the connection with continued fractions. Chapter 2 presents the slice decomposition, a unified bijective approach that applies notably to irreducible maps. Chapter 3 concerns the $O(n)$ loop model on planar maps: by a combinatorial decomposition, we obtain the phase diagr…
We classify extremal traces on the seven direct limit algebras of noncrossing partitions arising from the classification of free partition quantum groups of Banica-Speicher (arXiv:0808.2628) and Weber (arXiv:1201.4723). For the infinite-dimensional Temperley-Lieb-algebra (corresponding to the quantum group $O^+_N$) and the Motzkin algebra ($B^+_N$), the classification of extremal traces implies a classification result for well-known types of central random lattice paths. For the $2$-Fuss-Catalan algebra ($H_N^+$) we solve the classification problem by computing the \emph{minimal or exit bounda…
We introduce a class of birth-and-death Polya urns, which allow for both sampling and removal of observations governed by an auxiliary inhomogeneous Bernoulli process, and investigate the asymptotic behaviour of the induced allelic partitions. By exploiting some embedded models, we show that the asymptotic regimes exhibit a phase transition from partitions with almost surely infinitely many blocks and independent counts, to stationary partitions with a random number of blocks. The first regime corresponds to limits of Ewens-type partitions and includes a result of Arratia, Barbour and Tavaré (…
We present a solution to a problem suggested by Philippe Biane: We prove that a certain Plancherel-type probability distribution on partitions converges, as partitions get large, to a new determinantal random point process on the set {0,1,2,...} of nonnegative integers. This can be viewed as an edge limit ransition. The limit process is determined by a correlation kernel on {0,1,2,...} which is expressed through the Hermite polynomials, we call it the discrete Hermite kernel. The proof is based on a simple argument which derives convergence of correlation kernels from convergence of unbounded …
On Partition Functions for Time-Inhomogeneous Branching Random Walks
研究时间非齐次分支随机游走的配分函数相变与普遍性，通过改进GMC框架证明其临界值与时间齐次一致，并在亚临界区域证明配分函数L1收敛，扩展临界参数下的衰减率，提出GMC框架在非对数相关领域的新路径。
Gaussian measure on the dual of $\mathrm{U}(N)$, random partitions, and topological expansion of the partition function
本文研究 U(N) 对偶上的高斯测度，证明随机最高权可分解为两个独立 q-均匀随机分拆与 U(1) 最高权的耦合，并证明配分函数具有与椭圆曲线分歧覆盖计数相关的拓扑展开，从而严格证明二维环面 Yang-Mills 理论的规范/弦对偶。
We suggest an hierarchy of all the results known so far about the connection of the asymptotics of combinatorial or representation theoretic problems with ``beta=2 ensembles'' arising in the random matrix theory. We show that all such results are, essentially, degenerations of one general situation arising from so-called generalized regular representations of the infinite symmetric group.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。