A normal law for matchings
From MaRDI portal
Publication:5932660
DOI10.1007/PL00009835zbMath0963.05111MaRDI QIDQ5932660
Publication date: 12 June 2001
Published in: Combinatorica (Search for Journal in Brave)
Central limit and other weak theorems (60F05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (18)
Correlation bounds for fields and matroids ⋮ Central limit theorems, Lee-Yang zeros, and graph-counting polynomials ⋮ Asymptotic normality of some graph sequences ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ Random spanning forests and hyperbolic symmetry ⋮ Several improved asymptotic normality criteria and their applications to graph polynomials ⋮ Lorentzian polynomials ⋮ The edge correlation of random forests ⋮ MAX-plus objects to study the complexity of graphs ⋮ A strong log-concavity property for measures on Boolean algebras ⋮ Asymptotic normality of Laplacian coefficients of graphs ⋮ Negative correlation and log-concavity ⋮ Some open questions about random walks, involutions, limiting distributions, and generating functions ⋮ Weighted enumeration of spanning subgraphs with degree constraints ⋮ On the stochastic independence properties of hard-core distributions ⋮ Asymptotic normality of associated Lah numbers ⋮ Tree and forest weights and their application to nonuniform random graphs ⋮ The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs
This page was built for publication: A normal law for matchings
