| A. I. Pavlov, Local limit theorems for the number of components of random permutations and mappings, Theory of Probability and Its Applications, 33, 183--187 (1988). |
....components in a random mapping of size n, and we obtain, for example, 2 Gamma 2 log n Delta(x= log n ( 1 A ; uniformly for m = log n x log n, x = o( log n) In particuler, Pi 1 (x) log 2 fl)x, fl being Euler s constant. This improves a result of Pavlov in [27]. Example 2. Components in ordered random mappings. In a random mapping, the order of its components is not taken into account. We can consider its ordered counterpart with generating function 1 1 Gamma w log(1= 1 Gamma C(z) 24) where as above C(z) is the generating function for Cayley ....
A. I. Pavlov, Local limit theorems for the number of components of random permutations and mappings, Theory of Probability and Its Applications, 33, 183--187 (1988).
....in a random mapping of size n, and we obtain, for example, 2 2 log n#(x 2 log n) # # log n # ( log n) # uniformly for m = log n x log n, x = o( # log n) In particuler, # 1 (x) log 2 #)x, # being Euler s constant. This improves a result of Pavlov in [27]. Example 2. Components in ordered random mappings. In a random mapping, the order of its components is not taken into account. We can consider its ordered counterpart with generating function 1 w log(1 (1 C(z) 24) where as above C(z) is the generating function for Cayley trees. For # # ....
A. I. Pavlov, Local limit theorems for the number of components of random permutations and mappings, Theory of Probability and Its Applications, 33, 183--187 (1988).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC