Probabilistic Methods in Combinatorial Analysis
From MaRDI portal
Publication:4856167
DOI10.1017/CBO9780511666193zbMath0874.60020OpenAlexW1544198293MaRDI QIDQ4856167
Publication date: 23 November 1995
Full work available at URL: https://doi.org/10.1017/cbo9780511666193
matchinggenerating functioncentral limit theoremprobabilistic methodrandom permutationrandom graphpermanentrandom mappingsaddle-point method
Central limit and other weak theorems (60F05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01) Combinatorial probability (60C05) Asymptotic enumeration (05A16)
Related Items (36)
Generalized allocation scheme with cell occupancies from a fixed finite set ⋮ Method of moments and sums of random indicators ⋮ The metric space of limit laws for $q$-hook formulas ⋮ A view from the bridge spanning combinatorics and probability ⋮ The topology and geometry of random square-tiled surfaces ⋮ Random partitions of a set with given number of blocks ⋮ Fluctuations of the maximal particle energy of the quantum ideal gas and random partitions ⋮ Глобализация анализа моделей размещения частиц по ячейкам ⋮ Inversions in split trees and conditional Galton--Watson trees ⋮ Zeta Functions and the Log Behaviour of Combinatorial Sequences ⋮ Mod-\( \phi\) convergence of Stirling distributions and limit theorems for zeros of their generating functions ⋮ Random mappings with constraints on the cycle lengths ⋮ The limiting distribution of the coefficients of the 𝑞-Catalan numbers ⋮ Unfair permutations ⋮ A bijection of plane increasing trees with relaxed binary trees of right height at most one ⋮ Local limit theorems for one class of distributions in probabilistic combinatorics ⋮ Случайные подстановки с циклами ограниченной длины и трансформированием ⋮ Limit theorems for the logarithm of the order of a random \(A\)-mapping ⋮ On colored set partitions of type \(B_n\) ⋮ Asymptotics with remainder term for moments of the total cycle number of random \(A\)-permutation ⋮ The number of cycles in random permutations without long cycles is asymptotically Gaussian ⋮ On one characteristic of a random mapping with given number of cycles ⋮ Total variation approximation for random assemblies and a functional limit theorem ⋮ Asymptotic normality of the major index on standard tableaux ⋮ Size distribution of the largest component of a random \(a\)-mapping ⋮ Improved Side-Channel Collision Attacks on AES ⋮ On the Order of Random Permutation with Cycle Weights ⋮ Inversions in Split Trees and Conditional Galton–Watson Trees ⋮ On the number of solutions of a system of random linear equations in a set of vectors of special form ⋮ On the distribution of the mth maximal cycle lengths of random A-permutations ⋮ The limit distribution of the number of cyclic vertices in a random mapping in a special case ⋮ Random Mappings with Component Sizes from a Given Set ⋮ Cluster size distributions of economic agents of many types in a market ⋮ Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks ⋮ Limit distribution of the coefficients of polynomials with only unit roots ⋮ On the asymptotic normality of the Legendre-Stirling numbers of the second kind
This page was built for publication: Probabilistic Methods in Combinatorial Analysis
