On random trees

@inproceedings{Mri2002OnRT,
  title={On random trees},
  author={Tam{\'a}s F. M{\'o}ri},
  year={2002}
}
In a one-parameter model for evolution of random trees strong law of large numbers and central limit theorem are proved for the number of vertices with low degree. The proof is based on elementary martingale theory. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 48 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

MSO Asymptotics on Random Acyclic Graphs , submitted forpublication MSO Zero - One Laws on Random Labelled Acyclic Graphs , submitted for publication

F. Harary
  • Various proofs of Cayley ' s formula for counting trees
  • 1985

Introduction to Probabilistic Automata

A. Paz
  • (Acad. Pr.,
  • 1971

On nodes of outdegree in random trees

J. W. Moon
  • A seminar on graph theory ( Holt , Rinehart & Winston
  • 1967

Colouring rules for nite trees , and probabilities of monadicsecond order sentences

A. R. Woods
  • J . LondonMath . Soc .