Structural Transition in Random Mappings

In this paper we characterise the  structural transition in random mappings with in-degree restrictions. Specifically, for integers $0~\!\!\leq~\!\!r\leq~\!\!n$, we  consider a random mapping model $\hat{T}_n^r$ from $[n]=\{1,2, \ldots , n\}$ into $[n]$ such that $\hat{G}_n^r$, the directed graph on $n$ labelled vertices which represents the mapping $\hat{T}_n^r$, has $r$ vertices that are constrained to have in-degree at most $1$ and the remaining vertices have in-degree at most 2. When $r=n$, $\hat{T}_n^r$ is a uniform random permutation and when $r<n$, we can view $\hat{T}_n^r$ as a 'corrupted' permutation. We investigate structural transition in $\hat{G}_n^r$ as we vary the integer parameter $r$ relative to the total number of vertices $n$. We obtain  exact and asymptotic distributions for the number of cyclic vertices, the number of components,  and the size of the typical component in $\hat{G}_n^r$, and we characterise the dependence of the limiting distributions  of these variables on the relationship between the parameters $n$ and $r$ as $n\to\infty$. We show that the number of cyclic vertices in $\hat{G}_n^r$ is $\Theta({n\over\sqrt{a}})$ and the number of components is $\Theta(\log({n\over \sqrt{a}}))$ where $a=n-r$. In contrast, provided only that $a=n-r\to\infty$, we show that the asymptotic distribution of the order statistics of the normalised component sizes of $\hat{G}_n^r$ is always the  Poisson-Dirichlet(1/2) distribution as in the case of uniform random mappings with no in-degree restrictions.

[1]  G. Grimmett,et al.  On the asymptotic distribution of large prime factors , 1993 .

[2]  Philippe Flajolet,et al.  Random Mapping Statistics , 1990, EUROCRYPT.

[3]  Jean-Jacques Quisquater,et al.  How Easy is Collision Search? Application to DES (Extended Summary) , 1990, EUROCRYPT.

[4]  Jennie C. Hansen,et al.  A Functional Central Limit Theorem for Random Mappings , 1989 .

[5]  Dudley Stark LOGARITHMIC COMBINATORIAL STRUCTURES: A PROBABILISTIC APPROACH (EMS Monographs in Mathematics) By R ICHARD A RRATIA , A. D. B ARBOUR and S IMON T AVARÉ : 363 pp., €69.00, ISBN 3-03719-000-0 (European Mathematical Society, 2003) , 2005 .

[6]  A. Vershik,et al.  Limit Measures Arising in the Asympyotic Theory of Symmetric Groups. I. , 1977 .

[7]  E. Bender,et al.  Random mappings with constraints on coalescence and number of origins , 1982 .

[8]  Boris Pittel,et al.  Random permutations and Brownian motion , 1985 .

[9]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[10]  Jim Pitman,et al.  Brownian bridge asymptotics for random mappings , 1992, Advances in Applied Probability.

[11]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[12]  Jennie C. Hansen,et al.  How random is the characteristic polynomial of a random matrix , 1993 .

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

[14]  A. W. Kemp,et al.  Univariate Discrete Distributions , 1993 .

[15]  V. E. Stepanov Limit Distributions of Certain Characteristics of Random Mappings , 1969 .

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

[17]  D. Aldous Exchangeability and related topics , 1985 .

[18]  Jerzy Jaworski,et al.  Random mappings with a given number of cyclical points , 2010, Ars Comb..

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

[20]  Boris Pittel,et al.  On Distributions Related to Transitive Closures of Random Finite Mappings , 1983 .

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

[22]  I. Gertsbakh Epidemic process on a random graph: some preliminary results , 1977, Journal of Applied Probability.

[23]  A. W. Kemp,et al.  Univariate Discrete Distributions , 1993 .

[24]  R. Arratia,et al.  Logarithmic Combinatorial Structures: A Probabilistic Approach , 2003 .

[25]  Jerzy Jaworski,et al.  Random mappings with exchangeable in-degrees , 2008 .

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

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

[28]  Paul C. van Oorschot,et al.  Parallel collision search with application to hash functions and discrete logarithms , 1994, CCS '94.