• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 5
  • 1
  • Tagged with
  • 7
  • 7
  • 7
  • 5
  • 4
  • 4
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Computation of moment generating and characteristic functions with Mathematica

Shiao, Z-C 24 July 2003 (has links)
Mathematica is an extremely powerful and flexible symbolic computer algebra system that enables the user to deal with complicated algebraic tasks. It can also easily handle the numerical and graphical sides. One such task is the derivation of moment generating functions (MGF) and characteristic functions (CF), demonstrably effective tools to characterize a distribution. In this paper, we define some rules in Mathematica to help in computing the MGF and CF for linear combination of independent random variables. These commands utilizes pattern-matching code that enhances Mathematica's ability to simplify expressions involving the product of algebraic terms. This enhancement to Mathematica's functionality can be of particular benefit for MGF and CF. Applications of these rules to determine mean, variance and distribution are illustrated for various independent random variables.
2

Generating Functions : Powerful Tools for Recurrence Relations. Hermite Polynomials Generating Function

Rydén, Christoffer January 2023 (has links)
In this report we will plunge down in the fascinating world of the generating functions. Generating functions showcase the "power of power series", giving more depth to the word "power" in power series. We start off small to get a good understanding of the generating function and what it does. Also, off course, explaining why it works and why we can do some of the things we do with them. We will see alot of examples throughout the text that helps the reader to grasp the mathematical object that is the generating function. We will look at several kinds of generating functions, the main focus when we establish our understanding of these will be the "ordinary power series" generating function ("ops") that we discuss before moving on to the "exponential generating function" ("egf"). During our discussion on ops we will see a "first time in literature" derivation of the generating function for a recurrence relation regarding "branched coverings". After finishing the discussion regarding egf we move on the Hermite polynomials and show how we derive their generating function. Which is a generating function that generates functions. Lastly we will have a quick look at the "moment generating function".
3

Moments and Quadratic Forms of Matrix Variate Skew Normal Distributions

Zheng, Shimin, Knisley, Jeff, Wang, Kesheng 01 February 2016 (has links)
In 2007, Domínguez-Molina et al. obtained the moment generating function (mgf) of the matrix variate closed skew normal distribution. In this paper, we use their mgf to obtain the first two moments and some additional properties of quadratic forms for the matrix variate skew normal distributions. The quadratic forms are particularly interesting because they are essentially correlation tests that introduce a new type of orthogonality condition.
4

A Study of non-central Skew t Distributions and their Applications in Data Analysis and Change Point Detection.

Hasan, Abeer 26 July 2013 (has links)
No description available.
5

Applications of Generating Functions

Tseng, Chieh-Mei 26 June 2007 (has links)
Generating functions express a sequence as coefficients arising from a power series in variables. They have many applications in combinatorics and probability. In this paper, we will investigate the important properties of four kinds of generating functions in one variables: ordinary generating unction, exponential generating function, probability generating function and moment generating function. Many examples with applications in combinatorics and probability, will be discussed. Finally, some well-known contest problems related to generating functions will be addressed.
6

Exact Analysis of Exponential Two-Component System Failure Data

Zhang, Xuan 01 1900 (has links)
<p>A survival distribution is developed for exponential two-component systems that can survive as long as at least one of the two components in the system function. It is assumed that the two components are initially independent and non-identical. If one of the two components fail (repair is impossible), the surviving component is subject to a different failure rate due to the stress caused by the failure of the other.</p> <p>In this paper, we consider such an exponential two-component system failure model when the observed failure time data are (1) complete, (2) Type-I censored, (3) Type-I censored with partial information on component failures, (4) Type-II censored and (5) Type-II censored with partial information on component failures. In these situations, we discuss the maximum likelihood estimates (MLEs) of the parameters by assuming the lifetimes to be exponentially distributed. The exact distributions (whenever possible) of the MLEs of the parameters are then derived by using the conditional moment generating function approach. Construction of confidence intervals for the model parameters are discussed by using the exact conditional distributions (when available), asymptotic distributions, and two parametric bootstrap methods. The performance of these four confidence intervals, in terms of coverage probabilities are then assessed through Monte Carlo simulation studies. Finally, some examples are presented to illustrate all the methods of inference developed here.</p> <p>In the case of Type-I and Type-II censored data, since there are no closed-form expressions for the MLEs, we present an iterative maximum likelihood estimation procedure for the determination of the MLEs of all the model parameters. We also carry out a Monte Carlo simulation study to examine the bias and variance of the MLEs.</p> <p>In the case of Type-II censored data, since the exact distributions of the MLEs depend on the data, we discuss the exact conditional confidence intervals and asymptotic confidence intervals for the unknown parameters by conditioning on the data observed.</p> / Thesis / Doctor of Philosophy (PhD)
7

Some Contributions to Inferential Issues of Censored Exponential Failure Data

Han, Donghoon 06 1900 (has links)
In this thesis, we investigate several inferential issues regarding the lifetime data from exponential distribution under different censoring schemes. For reasons of time constraint and cost reduction, censored sampling is commonly employed in practice, especially in reliability engineering. Among various censoring schemes, progressive Type-I censoring provides not only the practical advantage of known termination time but also greater flexibility to the experimenter in the design stage by allowing for the removal of test units at non-terminal time points. Hence, we first consider the inference for a progressively Type-I censored life-testing experiment with k uniformly spaced intervals. For small to moderate sample sizes, a practical modification is proposed to the censoring scheme in order to guarantee a feasible life-test under progressive Type-I censoring. Under this setup, we obtain the maximum likelihood estimator (MLE) of the unknown mean parameter and derive the exact sampling distribution of the MLE through the use of conditional moment generating function under the condition that the existence of the MLE is ensured. Using the exact distribution of the MLE as well as its asymptotic distribution and the parametric bootstrap method, we discuss the construction of confidence intervals for the mean parameter and their performance is then assessed through Monte Carlo simulations. Next, we consider a special class of accelerated life tests, known as step-stress tests in reliability testing. In a step-stress test, the stress levels increase discretely at pre-fixed time points and this allows the experimenter to obtain information on the parameters of the lifetime distributions more quickly than under normal operating conditions. Here, we consider a k-step-stress accelerated life testing experiment with an equal step duration τ. In particular, the case of progressively Type-I censored data with a single stress variable is investigated. For small to moderate sample sizes, we introduce another practical modification to the model for a feasible k-step-stress test under progressive censoring, and the optimal τ is searched using the modified model. Next, we seek the optimal τ under the condition that the step-stress test proceeds to the k-th stress level, and the efficiency of this conditional inference is compared to the preceding models. In all cases, censoring is allowed at each change stress point iτ, i = 1, 2, ... , k, and the problem of selecting the optimal Tis discussed using C-optimality, D-optimality, and A-optimality criteria. Moreover, when a test unit fails, there are often more than one fatal cause for the failure, such as mechanical or electrical. Thus, we also consider the simple stepstress models under Type-I and Type-II censoring situations when the lifetime distributions corresponding to the different risk factors are independently exponentially distributed. Under this setup, we derive the MLEs of the unknown mean parameters of the different causes under the assumption of a cumulative exposure model. The exact distributions of the MLEs of the parameters are then derived through the use of conditional moment generating functions. Using these exact distributions as well as the asymptotic distributions and the parametric bootstrap method, we discuss the construction of confidence intervals for the parameters and then assess their performance through Monte Carlo simulations. / Thesis / Doctor of Philosophy (PhD)

Page generated in 0.1675 seconds