On the fast computation of the Dirichlet-multinomial log-likelihood function

Alessandro Languasco () and Mauro Migliardi ()
Additional contact information
Alessandro Languasco: Università di Padova
Mauro Migliardi: Università di Padova

Computational Statistics, 2023, vol. 38, issue 4, No 18, 1995-2013

Abstract: Abstract We introduce a new algorithm to compute the difference between values of the $$\log \Gamma$$ log Γ -function in close points, where $$\Gamma$$ Γ denotes Euler’s gamma function. As a consequence, we obtain a way of computing the Dirichlet-multinomial log-likelihood function which is more accurate, has a better computational complexity and a wider range of application than the previously known ones.

Keywords: Dirichlet multinomial distribution; Log-likelihood; Euler’s Gamma (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00180-022-01311-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:compst:v:38:y:2023:i:4:d:10.1007_s00180-022-01311-7

Ordering information: This journal article can be ordered from
http://www.springer.com/statistics/journal/180/PS2

DOI: 10.1007/s00180-022-01311-7

Access Statistics for this article

Computational Statistics is currently edited by Wataru Sakamoto, Ricardo Cao and Jürgen Symanzik

More articles in Computational Statistics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().