Probabilistic Methods in Combinatorial Analysis
From MaRDI portal
Publication:4856167
DOI10.1017/CBO9780511666193zbMath0874.60020MaRDI QIDQ4856167
Publication date: 23 November 1995
matching; generating function; central limit theorem; probabilistic method; random permutation; random graph; permanent; random mapping; saddle-point method
60F05: Central limit and other weak theorems
60-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory
60C05: Combinatorial probability
05A16: Asymptotic enumeration
Related Items
Random partitions of a set with given number of blocks, On one characteristic of a random mapping with given number of cycles, Improved Side-Channel Collision Attacks on AES, 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, Unfair permutations, Total variation approximation for random assemblies and a functional limit theorem, Fluctuations of the maximal particle energy of the quantum ideal gas and random partitions, Cluster size distributions of economic agents of many types in a market, The limit distribution of the number of cyclic vertices in a random mapping in a special case, The limiting distribution of the coefficients of the 𝑞-Catalan numbers
