Old Web
Walks on random digraphs
1996
Abstract A threshold result regarding the lengths of nonreversing walks on random digraphs is obtained as a consequence of a bifurcation in the dynamics of a simple one-dimensional iteration.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
6
References
0
Citations
NaN
KQI