scholarly journals SOME RESULTS RELATED TO DISTRIBUTION FUNCTIONS OF CHI-SQUARE TYPE RANDOM VARIABLES WITH RANDOM DEGREES OF FREEDOM

2008 ◽  
Vol 45 (3) ◽  
pp. 509-522 ◽  
Author(s):  
Tran Loc Hung ◽  
Tran Thien Thanh ◽  
Bui Quang Vu
2019 ◽  
Vol 22 (1) ◽  
pp. 180-184
Author(s):  
Tran Loc Hung

The chi-square distribution with degrees of freedom has an important role in probability, statistics and various applied fields as a special probability distribution. This paper concerns the relations between geometric random sums and chi-square type distributions whose degrees of freedom are geometric random variables. Some characterizations of chi-square type random variables with geometric degrees of freedom are calculated. Moreover, several weak limit theorems for the sequences of chi-square type random variables with geometric random degrees of freedom are established via asymptotic behaviors of normalized geometric random sums.


2020 ◽  
Vol 70 (1) ◽  
pp. 213-232
Author(s):  
Tran Loc Hung

AbstractThe purpose of this paper is to study a chi-square-type distribution who degrees of freedom are geometric random variables in connection with weak limiting distributions of geometric random sums of squares of independent, standard normal distributed random variables. Some characteristics of chi-square-type random variables with geometrically distributed degrees of freedom including probability density function, probability distribution function, mean and variance are calculated. Some asymptotic behaviors of chi-square-type random variables with geometrically distributed degrees of freedom are also established via weak limit theorems for normalized geometric random sums of squares of independent, standard normal distributed random variables. The rates of convergence in desired weak limit theorems also estimated through Trotter’s distance. The received results are extensions and generalizations of several known results.


1998 ◽  
Vol 14 (3) ◽  
pp. 339-354 ◽  
Author(s):  
Stefan Mittnik ◽  
Svetlozar T. Rachev ◽  
Jeong-Ryeol Kim

The distribution of sums of squared random variables with heavy-tailed distributions is investigated. Considering random variables in the domain of attraction of a stable Paretian law we derive the limiting distribution as the degrees of freedom approach infinity. The finite-degrees-of-freedom behavior for stable Paretian variates is simulated. Response surface techniques are employed to compactly summarize the simulation results for a relevant range of significance levels.


Author(s):  
T. V. Oblakova

The paper is studying the justification of the Pearson criterion for checking the hypothesis on the uniform distribution of the general totality. If the distribution parameters are unknown, then estimates of the theoretical frequencies are used [1, 2, 3]. In this case the quantile of the chi-square distribution with the number of degrees of freedom, reduced by the number of parameters evaluated, is used to determine the upper threshold of the main hypothesis acceptance [7]. However, in the case of a uniform law, the application of Pearson's criterion does not extend to complex hypotheses, since the likelihood function does not allow differentiation with respect to parameters, which is used in the proof of the theorem mentioned [7, 10, 11].A statistical experiment is proposed in order to study the distribution of Pearson statistics for samples from a uniform law. The essence of the experiment is that at first a statistically significant number of one-type samples from a given uniform distribution is modeled, then for each sample Pearson statistics are calculated, and then the law of distribution of the totality of these statistics is studied. Modeling and processing of samples were performed in the Mathcad 15 package using the built-in random number generator and array processing facilities.In all the experiments carried out, the hypothesis that the Pearson statistics conform to the chi-square law was unambiguously accepted (confidence level 0.95). It is also statistically proved that the number of degrees of freedom in the case of a complex hypothesis need not be corrected. That is, the maximum likelihood estimates of the uniform law parameters implicitly used in calculating Pearson statistics do not affect the number of degrees of freedom, which is thus determined by the number of grouping intervals only.


Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 981
Author(s):  
Patricia Ortega-Jiménez ◽  
Miguel A. Sordo ◽  
Alfonso Suárez-Llorens

The aim of this paper is twofold. First, we show that the expectation of the absolute value of the difference between two copies, not necessarily independent, of a random variable is a measure of its variability in the sense of Bickel and Lehmann (1979). Moreover, if the two copies are negatively dependent through stochastic ordering, this measure is subadditive. The second purpose of this paper is to provide sufficient conditions for comparing several distances between pairs of random variables (with possibly different distribution functions) in terms of various stochastic orderings. Applications in actuarial and financial risk management are given.


Genetics ◽  
2002 ◽  
Vol 160 (4) ◽  
pp. 1631-1639 ◽  
Author(s):  
G P Copenhaver ◽  
E A Housworth ◽  
F W Stahl

AbstractThe crossover distribution in meiotic tetrads of Arabidopsis thaliana differs from those previously described for Drosophila and Neurospora. Whereas a chi-square distribution with an even number of degrees of freedom provides a good fit for the latter organisms, the fit for Arabidopsis was substantially improved by assuming an additional set of crossovers sprinkled, at random, among those distributed as per chi square. This result is compatible with the view that Arabidopsis has two pathways for meiotic crossing over, only one of which is subject to interference. The results further suggest that Arabidopsis meiosis has >10 times as many double-strand breaks as crossovers.


Author(s):  
Alireza Rezvanian ◽  
Mohammad Reza Meybodi

Because of unpredictable, uncertain and time-varying nature of real networks it seems that stochastic graphs, in which weights associated to the edges are random variables, may be a better candidate as a graph model for real world networks. Once the graph model is chosen to be a stochastic graph, every feature of the graph such as path, clique, spanning tree and dominating set, to mention a few, should be treated as a stochastic feature. For example, choosing stochastic graph as the graph model of an online social network and defining community structure in terms of clique, and the associations among the individuals within the community as random variables, the concept of stochastic clique may be used to study community structure properties. In this paper maximum clique in stochastic graph is first defined and then several learning automata-based algorithms are proposed for solving maximum clique problem in stochastic graph where the probability distribution functions of the weights associated with the edges of the graph are unknown. It is shown that by a proper choice of the parameters of the proposed algorithms, one can make the probability of finding maximum clique in stochastic graph as close to unity as possible. Experimental results show that the proposed algorithms significantly reduce the number of samples needed to be taken from the edges of the stochastic graph as compared to the number of samples needed by standard sampling method at a given confidence level.


Sign in / Sign up

Export Citation Format

Share Document