Grasping the connectivity of random functional graphs
Por:
Romero D., Zertuche F.
Publicada:
1 ene 2005
Resumen:
A functional graph is a directed graph where every node has out-degree one (loops allowed). This paper deals with connectivity aspects of random functional graphs, like the expected number and size of connected components, cycles, and trajectories. Both exact and asymptotic formulas are provided. © 2005 Akadémiai Kiadó, Budapest.
Filiaciones:
Romero D.:
Instituto de Matemáticas, Univ. Nac. Auton. de México, Apartado Postal 273-3, 62251 Cuernavaca, MOR., Mexico
Zertuche F.:
Instituto de Matemáticas, Univ. Nac. Auton. de México, Apartado Postal 273-3, 62251 Cuernavaca, MOR., Mexico
|