DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Chang Wan | ko |
dc.contributor.author | Kim D.H. | ko |
dc.date.accessioned | 2013-03-03T13:39:39Z | - |
dc.date.available | 2013-03-03T13:39:39Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS, v.10, no.3, pp.581 - 587 | - |
dc.identifier.issn | 1078-0947 | - |
dc.identifier.uri | http://hdl.handle.net/10203/78909 | - |
dc.description.abstract | Let T be a transformation from I = [0, 1) onto itself and let Q(n) (x) be the subinterval [i/2(n), (i+1)/2(n)), 0 less than or equal to i < 2(n) containing x. Define K-n(x) = min{j &GE; 1 : T-j(x) &ISIN; Q(n) (x)} and K-n(x,y) = min{j &GE; 1 : Tj-1(y) &ISIN; Q(n)(x)}. For various transformations defined on I, we show that [GRAPHICS] | - |
dc.language | English | - |
dc.publisher | AMER INST MATHEMATICAL SCIENCES | - |
dc.subject | POINCARE RECURRENCE | - |
dc.subject | DATA-COMPRESSION | - |
dc.subject | WAITING TIME | - |
dc.subject | DIMENSIONS | - |
dc.subject | ENTROPY | - |
dc.subject | NUMBER | - |
dc.title | On the law of logarithm of the recurrence time | - |
dc.type | Article | - |
dc.identifier.wosid | 000187071800001 | - |
dc.identifier.scopusid | 2-s2.0-1042267862 | - |
dc.type.rims | ART | - |
dc.citation.volume | 10 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 581 | - |
dc.citation.endingpage | 587 | - |
dc.citation.publicationname | DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS | - |
dc.contributor.nonIdAuthor | Kim D.H. | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | recurrence time | - |
dc.subject.keywordAuthor | the first return time | - |
dc.subject.keywordAuthor | waiting time | - |
dc.subject.keywordPlus | POINCARE RECURRENCE | - |
dc.subject.keywordPlus | DATA-COMPRESSION | - |
dc.subject.keywordPlus | WAITING TIME | - |
dc.subject.keywordPlus | DIMENSIONS | - |
dc.subject.keywordPlus | ENTROPY | - |
dc.subject.keywordPlus | NUMBER | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.