Abstract
Some mathematical problems involving the asymptotic analysis of rooted random tree graphs and branching patterns for large numbers of vertices are described. The motivation comes from applications to hydrology and geomorphology in which one seeks formulae for the average behavior of various contours (level sets) associated with river networks and which depend on only a few large scale parameters. While this paper is mainly an overview, a new formula is derived in a special case as an illustration. Scaling problems and connections with Aldous’s new theory of “self-similar”continuum random trees are noted.
Department of Mathematics, Oregon State University, Corvallis, OR 97331. Research for this paper was partially supported by NSF grant DMS-8801466, ARO grant 27772-GS. The author gratefully acknowledges support from the Center for the Study of Earth from Space/CIRES and the Program in Applied Mathematics, University of Colorado, Boulder, CO 80309, during the final stages of preparation of this manuscript.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Aldous, The continuum random tree I, preprint, (1989a), The University of California, Berkeley, CA.
D. Aldous, Discrete and continuum random trees:The Notebook, preprint,(1989b). The University of California, Berkeley, CA.
D. Aldous, Exchangeability, in: Lecture Notes in Mathematics, no.1117, Ecole d’életé de probabilités de Sain Flour,(1985) Springer-Verlag, Berlin.
K.B. Athreya, P.E. Ney, Branching Processes, (1972) Springer-Verlag, N.Y.
J.W. Cohen, G. Hooghiemstra, Brownian excursion, the M/M/1 queue and their occupation times, Math.Oper.Res., 6(4), (1981) pp.608–629.
R. Durrett, H. Kesten, E. Waymire, On weighted heights of random trees, Jour. Theor. Probab., (in press).
M. Dwass, The total progeny in a branching process, Jour. Appld. Probab., 6 (1969), pp.682–686.
P. Flajolet, A. Odlyzko, The average height of binary trees and other simple trees, Jour. Comput. Syst. Science 25 (1982), pp.171–213.
G. Grimmett, Random labelled trees and their branching networks, Jour. Austral. Math. Soc. (Ser.A), 30 (1980), pp.229–237.
V. K. Gupta, O. Mesa, and E. Waymire, Tree dependent extreme values: The exponential case, Jour.Appl.Probab., 27 (1990) pp.124–133.
V.K. Gupta, E. Waymire, Statistical self-similarity in river networks parameterized by elevation, 25(3) Water Resour. Res. (1989), pp.463–476.
V.K. Gupta and E. Waymire, The spatial geometry of random networks and a problem in river basin hydrology, in: IMS Lecture Notes, Proc. of AMS-IMS-SIAM Summer Conference on Spatial Statistics and Imaging, ed by A. Possolo, (1989), in press.
V.K. Gupta and E. Waymire, On scaling and multiscaling theories in geophysics, Reviews in Geophysics (1991) to appear
D.P. Kennedy, The Galton-Watson process conditioned on the total progeny, J.Appl. Prob., 12 (1975), pp.800–806.
D.P. Kennedy, The distribution of the maximum Brownian excursion, J. Appl. Prob., 13 (1976), pp.371–376.
H. Kesten, personal communication.
V. Kolchin, Branching processes, random trees, and a generalized scheme fo arrangements of particles, Math.Notes (1977), pp.386–394.
V. Kolchin, Moment of degeneration of a branching process and height of a random tree, Math.Notes, 24 (1978), pp.954–961
J.W. Moon, On the expected diameter of random channel networks, Water Resour. Res., 16(6), (1980) pp.1119–1120.
B. Ngyuen, Percolation of coalescing random walks, Jour. Appld. Probab., 27 (1990) 269–277.
L. Smith, P.Diaconis, Honest bernoulli excursions, Jour. Appld. Probab., 25 pp.464–477
F. Spitzer, Principles of Random Walk, 2nd ed., (1976) Springer-Verlag, N.Y.
B. Troutman, M. Karlinger, On the expected width function for topologically random channel networks, Jour. Appld. Probab., 21 pp.836–849.
X. Wang, E. Waymire, Central limit theorems for Horton ratios, SIAM Jour. Discrete Math., (1991) to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag New York, Inc.
About this paper
Cite this paper
Waymire, E.C. (1993). On Network Structure Function Computations. In: Brillinger, D., Caines, P., Geweke, J., Parzen, E., Rosenblatt, M., Taqqu, M.S. (eds) New Directions in Time Series Analysis. The IMA Volumes in Mathematics and its Applications, vol 46. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9296-5_21
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9296-5_21
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9298-9
Online ISBN: 978-1-4613-9296-5
eBook Packages: Springer Book Archive