Several improved asymptotic normality criteria and their applications to graph polynomials

DOI10.1016/j.disc.2022.113303OpenAlexW4313892765MaRDI QIDQ2689478

Ting-Wei Chao, Yeong-Nan Yeh, Zhibin Du

Publication date: 10 March 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113303

zbMATH Keywords

generating functionsasymptotic normalitygraph polynomialscombinatorial statisticsgraph numberscoefficients of a polynomial

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Central limit and other weak theorems (60F05) Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15)

Related Items (1)

The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
• Central limit theorems, Lee-Yang zeros, and graph-counting polynomials
• Asymptotic normality of some graph sequences
• Some results on signless Laplacian coefficients of graphs
• Legendre-Stirling permutations
• The behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal
• On the Laplacian coefficients of acyclic graphs
• The roots of the independence polynomial of a clawfree graph
• Signless Laplacians of finite graphs
• Trees with minimal Laplacian coefficients
• On the Laplacian coefficients of unicyclic graphs
• Asymptotic normality of graph statistics
• On chromatic coefficients
• Chromatic coefficients of linear uniform hypergraphs
• Laplacian matrices of graphs: A survey
• Non-chordal graphs having integral-root chromatic polynomials. II
• Claw-free graphs---a survey
• A certain polynomial of a graph and graphs with an extremal number of trees
• Matching behaviour is asymptotically normal
• Asymptotic normality of Laplacian coefficients of graphs
• The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs
• Analytic aspects of Delannoy numbers
• On the asymptotic normality of the Legendre-Stirling numbers of the second kind
• On the signless Laplacian coefficients of unicyclic graphs
• The signless Laplacian coefficients and incidence energy of bicyclic graphs
• Coefficients of chromatic polynomials
• Central and local limit theorems applied to asymptotic enumeration
• Asymptotics of Stirling and Chebyshev-Stirling Numbers of the Second Kind
• Signless Laplacian coefficients and incidence energy of unicyclic graphs with the matching number
• A connection between ordinary and Laplacian spectra of bipartite graphs
• Asymptotic normality of some Graph-Related statistics
• Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley
• Stirling Behavior is Asymptotically Normal
• An introduction to chromatic polynomials
• A note on coefficients of chromatic polynomials
• Asymptotic properties of eulerian numbers
• The fundamental limit theorems in probability
• A normal law for matchings

This page was built for publication: Several improved asymptotic normality criteria and their applications to graph polynomials