Abstract
We consider the set of mappings of the integers $\{1, 2, \ldots, n\}$ into $\{1, 2, \ldots, n\}$ and put a uniform probability measure on this set. Any such mapping can be represented as a directed graph on $n$ labelled vertices. We study the component structure of the associated graphs as $n \rightarrow \infty$. To each mapping we associate a step function on $\lbrack 0, 1 \rbrack$. Each jump in the function equals the number of connected components of a certain size in the graph which represents the map. We normalize these functions and show that the induced measures on $D\lbrack 0, 1 \rbrack$ converge to Wiener measure. This result complements another result by Aldous on random mappings.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.