A Simple Central Limit Theorem Proof of the Asymptotic Distribution of the Student-t Test of the Mean

2019 ◽  
Author(s):  
Timothy Falcon Crack ◽  
Lynn McAlevey ◽  
Anindya Sen
1984 ◽  
Vol 21 (3) ◽  
pp. 639-645 ◽  
Author(s):  
Ştefan P. Niculescu

Using a result of Bikjalis (1971) concerning the rate of convergence in the multidimensional central limit theorem we obtain informations about some limit distributions in multivariate renewal theory.


1984 ◽  
Vol 21 (03) ◽  
pp. 639-645 ◽  
Author(s):  
Ştefan P. Niculescu

Using a result of Bikjalis (1971) concerning the rate of convergence in the multidimensional central limit theorem we obtain informations about some limit distributions in multivariate renewal theory.


Author(s):  
Shuang Tao ◽  
Jamol Pender

As more people move back into densely populated cities, bike sharing is emerging as an important mode of urban mobility. In a typical bike-sharing system (BSS), riders arrive at a station and take a bike if it is available. After retrieving a bike, they ride it for a while, then return it to a station near their final destinations. Since space is limited in cities, each station has a finite capacity of docks, which cannot hold more bikes than its capacity. In this paper, we study BSSs with stations having a finite capacity. By an appropriate scaling of our stochastic model, we prove a mean-field limit and a central limit theorem for an empirical process of the number of stations with k bikes. The mean-field limit and the central limit theorem provide insight on the mean, variance, and sample path dynamics of large-scale BSSs. We also leverage our results to estimate confidence intervals for various performance measures such as the proportion of empty stations, the proportion of full stations, and the number of bikes in circulation. These performance measures have the potential to inform the operations and design of future BSSs.


2012 ◽  
Vol 44 (02) ◽  
pp. 429-451
Author(s):  
Hosam M. Mahmoud ◽  
Robert T. Smythe

The ‘coupon collection problem’ refers to a class of occupancy problems in which j identical items are distributed, independently and at random, to n cells, with no restrictions on multiple occupancy. Identifying the cells as coupons, a coupon is ‘collected’ if the cell is occupied by one or more of the distributed items; thus, some coupons may never be collected, whereas others may be collected once or twice or more. We call the number of coupons collected exactly r times coupons of type r. The coupon collection model we consider is general, in that a random number of purchases occurs at each stage of collecting a large number of coupons; the sample sizes at each stage are independent and identically distributed according to a sampling distribution. The joint behavior of the various types is an intricate problem. In fact, there is a variety of joint central limit theorems (and other limit laws) that arise according to the interrelation between the mean, variance, and range of the sampling distribution, and of course the phase (how far we are in the collection processes). According to an appropriate combination of the mean of the sampling distribution and the number of available coupons, the phase is sublinear, linear, or superlinear. In the sublinear phase, the normalization that produces a Gaussian limit law for uncollected coupons can be used to obtain a multivariate central limit law for at most two other types — depending on the rates of growth of the mean and variance of the sampling distribution, we may have a joint central limit theorem between types 0 and 1, or between types 0, 1, and 2. In the linear phase we have a multivariate central limit theorem among the types 0, 1,…, k for any fixed k.


1989 ◽  
Vol 3 (4) ◽  
pp. 477-491
Author(s):  
Kyle T. Siegrist ◽  
Ashok T. Amin ◽  
Peter J. Slater

Consider the standard network reliability model in which each edge of a given (n, m)-graph G is deleted, independently of all others, with probability q = 1– p (0 <p < 1). The pair-connectivity random variable X is defined to be the number of connected pairs of vertices that remain in G. The mean of X has been proposed as a measure of reliability for failure-prone communications networks in which the edge deletions correspond to failures of the communications links. We consider deviations from the mean, the law of large numbers, and the central limit theorem for X as n → ∞. Some explicit results are obtained when G is a tree using martingale difference sequences. Stars and paths are treated in detail.


Author(s):  
Michael Fleermann ◽  
Werner Kirsch ◽  
Gabor Toth

AbstractWe study a multi-group version of the mean-field Ising model, also called Curie–Weiss model. It is known that, in the high-temperature regime of this model, a central limit theorem holds for the vector of suitably scaled group magnetisations, that is, for the sum of spins belonging to each group. In this article, we prove a local central limit theorem for the group magnetisations in the high-temperature regime.


Sign in / Sign up

Export Citation Format

Share Document