Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Some nonequiprobable models of random permutations
-
G. I. Ivchenko
Veröffentlicht/Copyright:
15. November 2011
Abstract
We consider a two-parameter model of random n-permutations, which is a generalisation of the classical model of A-permutations, and investigate the joint distribution of the number of A-cycles and Ā-cycles under various realisations of the subset A ⊂ Xn = {1, 2, . . . , n}.
Received: 2011-04-06
Published Online: 2011-11-15
Published in Print: 2011-November
© de Gruyter 2011
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Some nonequiprobable models of random permutations
- Automaton representation of a free group
- On estimation of the number of graphs in some hereditary classes
- An asymptotic upper bound for the chromatic index of random hypergraphs
- On stability of the gradient algorithm in convex discrete optimisation problems and related questions
- Rings over which all modules are completely integrally closed
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
Artikel in diesem Heft
- Some nonequiprobable models of random permutations
- Automaton representation of a free group
- On estimation of the number of graphs in some hereditary classes
- An asymptotic upper bound for the chromatic index of random hypergraphs
- On stability of the gradient algorithm in convex discrete optimisation problems and related questions
- Rings over which all modules are completely integrally closed
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
