A Constant on a Uniform Bound of a Combinatorial Central Limit Theorem
- Kritsana Neammanee
- Petcharat Rattanawong
Abstract
Let n be a positive integer and Y(i, j), i, j = 1, ..., n, be random variables with finite fourth moments. Let ? be a randompermutation on {1, ..., n} which independent of Y(i, j)’s. In this paper, we use Stein’s method and the technique from
(Laipaporn, K., 2008) to give a uniform bound in a combinatorial central limit theorem of W =
n *i=1
Y(i, ?(i)). For a
sufficient large n, we yield the rate
27.72
?n
. This constant is better than the result in (Neammanee, K., 2005).
Keywords: Uniform bound, Combinatorial central limit theorem, Stein’s method, Random permutation
- Full Text:
PDF
- DOI:10.5539/jmr.v1n2p91
Journal Metrics
- h-index (December 2021): 22
- i10-index (December 2021): 78
- h5-index (December 2021): N/A
- h5-median (December 2021): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org