Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On one characteristic of a random mapping with given number of cycles

On one characteristic of a random mapping with given number of cycles We consider the random variable equal to the number of trees of given size in the graph of a random one-to-one mapping of an n -element set into itself with m connected components. We obtain limit theorems which describe the distribution of this characteristic in the case where n → ∞, m / ln n → ∞, m / ln n = O (ln n ). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete Mathematics and Applications de Gruyter

On one characteristic of a random mapping with given number of cycles

Download PDF
19 pages

Loading next page...
 
/lp/de-gruyter/on-one-characteristic-of-a-random-mapping-with-given-number-of-cycles-sQHGR0Z7t9

References (7)

Publisher
de Gruyter
Copyright
Copyright 2006, Walter de Gruyter
ISSN
0924-9265
eISSN
1569-3929
DOI
10.1515/156939206779238454
Publisher site
See Article on Publisher Site

Abstract

We consider the random variable equal to the number of trees of given size in the graph of a random one-to-one mapping of an n -element set into itself with m connected components. We obtain limit theorems which describe the distribution of this characteristic in the case where n → ∞, m / ln n → ∞, m / ln n = O (ln n ).

Journal

Discrete Mathematics and Applications – de Gruyter

Published: Sep 1, 2006

There are no references for this article.