HACK'S LAW IN A DRAINAGE NETWORK MODEL: A BROWNIAN WEB APPROACH

• 成果类型: Article
• 署名作者: Roy, Rahul; Saha, Kumarjit; Sarkar, Anish
• 署名单位: Indian Statistical Institute; Indian Statistical Institute Delhi
• 刊物名称: ANNALS OF APPLIED PROBABILITY
• ISSN/ISSBN: 1050-5164
• DOI: 10.1214/15-AAP1134
• 发表日期: 2016
• 页码: 1807-1836
• 关键词: random-walks; CONVERGENCE; excursion; limit; meander; trees

摘要

Hack [Studies of longitudinal stream profiles in Virginia and Maryland (1957). Report], while studying the drainage system in the Shenandoah valley and the adjacent mountains of Virginia, observed a power law relation l similar to a(0.6) between the length l of a stream from its source to a divide and the area a of the basin that collects the precipitation contributing to the stream as tributaries. We study the tributary structure of Howard's drainage network model of headward growth and branching studied by Gangopadhyay, Roy and Sarkar [Ann. Appl. Probab. 14 (2004) 1242-1266]. We show that the exponent of Hack's law is 2/3 for Howard's model. Our study is based on a scaling of the process whereby the limit of the watershed area of a stream is area of a Brownian excursion process. To obtain this, we define a dual of the model and show that under diffusive scaling, both the original network and its dual converge jointly to the standard Brownian web and its dual.