Runs based on discrete order statistics
| dc.contributor.author | Stepanov, Alexei | en_US |
| dc.date.accessioned | 2020-09-21T10:35:31Z | |
| dc.date.available | 2020-09-21T10:35:31Z | |
| dc.date.issued | 2011-08-16 | |
| dc.identifier.citation | Stepanov, A. (2011). Runs based on discrete order statistics. TWMS Journal Of Applied And Engineering Mathematics, 1(2), 185-191. | en_US |
| dc.identifier.issn | 2146-1147 | |
| dc.identifier.issn | 2587-1013 | |
| dc.identifier.uri | https://hdl.handle.net/11729/2430 | |
| dc.identifier.uri | http://jaem.isikun.edu.tr/web/index.php/archive/86-vol1no2/160 | |
| dc.description.abstract | In the present paper, we study runs based on discrete order statistics. Limit results for the total number of such runs and the length of the longest run are derived. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Işık University Press | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
| dc.subject | Runs | en_US |
| dc.subject | Order statistics | en_US |
| dc.subject | Limit laws | en_US |
| dc.title | Runs based on discrete order statistics | en_US |
| dc.type | article | en_US |
| dc.description.version | Publisher's Version | en_US |
| dc.relation.journal | TWMS Journal Of Applied And Engineering Mathematics | en_US |
| dc.identifier.volume | 1 | |
| dc.identifier.issue | 2 | |
| dc.identifier.startpage | 185 | |
| dc.identifier.endpage | 191 | |
| dc.peerreviewed | Yes | en_US |
| dc.publicationstatus | Published | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | en_US |
Files in this item
This item appears in the following Collection(s)
-
Jaem 2011, Vol 1, No 2 [10]
Jaem 2011, Vol 1, No 2 koleksiyonunu içerir.
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess
