Computational aspects of stable distributions

Author(s):  
John P. Nolan
2016 ◽  
Vol 39 (1) ◽  
pp. 109-128 ◽  
Author(s):  
Jorge A. Achcar ◽  
Sílvia R. C. Lopes

<p>In this paper, we present some computational aspects for a Bayesian analysis involving stable distributions. It is well known that, in general, there is no closed form for the probability density function of a stable distribution. However, the use of a latent or auxiliary random variable facilitates obtaining any posterior distribution when related to stable distributions. To show the usefulness of the computational aspects, the methodology is applied to linear and non-linear regression models. Posterior summaries of interest are obtained using the OpenBUGS software.</p>


2013 ◽  
Vol 03 (04) ◽  
pp. 268-277 ◽  
Author(s):  
Jorge A. Achcar ◽  
Sílvia R. C. Lopes ◽  
Josmar Mazucheli ◽  
Raquel R. Linhares

Author(s):  
Abdulkarim Magomedov ◽  
S.A. Lavrenchenko

New laconic proofs of two classical statements of combinatorics are proposed, computational aspects of binomial coefficients are considered, and examples of their application to problems of elementary mathematics are given.


Sign in / Sign up

Export Citation Format

Share Document