A limit theorem for the six-length of random functional graphs with a fixed degree sequence
The electronic journal of combinatorics, Tome 26 (2019) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We obtain results on the limiting distribution of the six-length of a random functional graph, also called a functional digraph or random mapping, with given in-degree sequence. The six-length of a vertex $v\in V$ is defined from the associated mapping, $f:V\to V$, to be the maximum $i\in V$ such that the elements $v, f(v), \ldots, f^{i-1}(v)$ are all distinct. This has relevance to the study of algorithms for integer factorisation.
DOI : 10.37236/7710
Classification : 05C80, 05C20, 05C85, 05C05, 60C05
Mots-clés : algorithms for integer factorisation

Kevin Leckey  1   ; Nick Wormald  2

1 Technische Universit\"at Dortmund
2 Monash University
@article{10_37236_7710,
     author = {Kevin Leckey and Nick Wormald},
     title = {A limit theorem for the six-length of random functional graphs with a fixed degree sequence},
     journal = {The electronic journal of combinatorics},
     year = {2019},
     volume = {26},
     number = {4},
     doi = {10.37236/7710},
     zbl = {1428.05283},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/7710/}
}
TY  - JOUR
AU  - Kevin Leckey
AU  - Nick Wormald
TI  - A limit theorem for the six-length of random functional graphs with a fixed degree sequence
JO  - The electronic journal of combinatorics
PY  - 2019
VL  - 26
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/7710/
DO  - 10.37236/7710
ID  - 10_37236_7710
ER  - 
%0 Journal Article
%A Kevin Leckey
%A Nick Wormald
%T A limit theorem for the six-length of random functional graphs with a fixed degree sequence
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/7710/
%R 10.37236/7710
%F 10_37236_7710
Kevin Leckey; Nick Wormald. A limit theorem for the six-length of random functional graphs with a fixed degree sequence. The electronic journal of combinatorics, Tome 26 (2019) no. 4. doi: 10.37236/7710

Cité par Sources :