A random mapping with preferential attachment

In this paper we investigate the asymptotic structure of a random mapping model with preferential attachment, T ρ n , which maps the set {1, 2, ..., n} into itself. The model T ρ n was introduced in a companion paper [11] and the asymptotic structure of the associated directed graph Gn which represents the action of T ρ n on the set {1, 2, ..., n} was investigated in [11] and [12] in the case when the attraction parameter ρ > 0 is fixed as n → ∞. In this paper we consider the asymptotic structure of Gn when the attraction parameter ρ ≡ ρ(n) is a function of n as n →∞. We show that there are three distinct regimes during the evolution of Gn: (i) ρn → ∞ as n → ∞, (ii) ρn → β > 0 as n →∞, and (iii) ρn → 0 as n →∞. It turns out that the asymptotic structure of Gn is, in some cases, quite different from the asymptotic structure of well-known models such as the uniform random mapping model and models with an attracting center. In particular, in regime (ii) we obtain some interesting new limiting distributions which are related to the incomplete gamma function.

[1]  V. E. Stepanov Random Mappings with a Single Attracting Center , 1971 .

[2]  Jerzy Jaworski,et al.  The Largest Connected in a Random Mapping , 1994, Random Struct. Algorithms.

[3]  Jerzy Jaworski Predecessors in a random mapping , 1998, Random Struct. Algorithms.

[4]  Simon Tavaré,et al.  Total Variation Asymptotics for Poisson Process Approximations of Logarithmic Combinatorial Assemblies , 1995 .

[5]  Tomasz Luczak,et al.  Cycles in a Uniform Graph Process , 1992, Combinatorics, Probability and Computing.

[6]  L. Mutafchiev On random mappings with a single attracting centre , 1987, Journal of Applied Probability.

[7]  Jerzy Jaworski,et al.  Random mappings with exchangeable in‐degrees , 2008, Random Struct. Algorithms.

[8]  J. Hansen,et al.  A cutting process for random mappings , 2007 .

[9]  Jerzy Jaworski Epidemic processes on digraphs of random mappings , 1999 .

[10]  L. Mutafchiev,et al.  RANDOM MAPPINGS WITH AN ATTRACTING CENTER: LAGRANGIAN DISTRIBUTIONS AND A REGRESSION FUNCTION , 1990 .

[11]  Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees , 2004, math/0401115.

[12]  Jim Pitman,et al.  Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions , 2001 .

[13]  Y. D. Burtin On a simple formula for random mappings and its applications , 1980, Journal of Applied Probability.

[14]  R. Arratia,et al.  Limits of logarithmic combinatorial structures , 2000 .

[15]  . N.S.F.GrantsDmsandDms,et al.  Brownian Bridge Asymptotics for Random p-Mappings , 2004 .

[16]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[17]  Jennie C. Hansen,et al.  Order Statistics for Decomposable Combinatorial Structures , 1994, Random Struct. Algorithms.