Limit theorem concerning random mapping patterns

From MaRDI portal
Publication:1110176





Mapping patterns may be represented by unlabelled directed graphs in which each point has out-degree one. Assuming uniform probability distribution on the set of all mapping patterns on n points, we obtain limit distributions of some characteristics associated with the graphs of mapping patterns (connected and disconnected), as \(n\to \infty\). In particular, we study the number of points belonging to cycles, the number of cycles and components having prescribed (fixed) number of points and the total number of components.











This page was built for publication: Limit theorem concerning random mapping patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1110176)