Asymptotic enumeration for combinatorial structures Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/n009w467k

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • There are many combinatorial structures which can be regarded as complexes of certain basic blocks. Familiar examples are involutions, finite graphs, and Stirling numbers of the first and second kind. Generating functions for these complexes have special forms relating the number of basic blocks to the number of complexes. Previous results on asymptotic enumeration have yielded implicit formulae for the mean and variance of the counts of blocks, together with Gaussian approximations with these parameters. We will provide explicit formulae for these basic quantities, together with large deviation estimates for decay rates from the mean. As a result we obtain laws of large numbers and, under certain convexity conditions, a new approach to Gaussian approximations previously obtained by more cumbersome analysis. In regard to applications, we will provide a new connection between these combinatorial structures and a class of self-similar trees. Extensive data analysis of naturally occurring river networks has been shown by hydrologists to be nicely modeled by this class of self-similar trees. Through this connection, we will obtain new results on the number of paths of various Horton orders.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using Capture Perfect 3.0.82 on a Canon DR-9080C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2010-07-19T15:54:42Z (GMT). No. of bitstreams: 1 MaxwellMarkM1995.pdf: 389241 bytes, checksum: 57ae3eddfa6a5d9cde357d9fc0835b67 (MD5)
  • description.provenance : Submitted by Nitin Mohan (mohanni@onid.orst.edu) on 2010-07-15T22:58:29Z No. of bitstreams: 1 MaxwellMarkM1995.pdf: 389241 bytes, checksum: 57ae3eddfa6a5d9cde357d9fc0835b67 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2010-07-19T15:51:58Z (GMT) No. of bitstreams: 1 MaxwellMarkM1995.pdf: 389241 bytes, checksum: 57ae3eddfa6a5d9cde357d9fc0835b67 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2010-07-19T15:54:42Z (GMT) No. of bitstreams: 1 MaxwellMarkM1995.pdf: 389241 bytes, checksum: 57ae3eddfa6a5d9cde357d9fc0835b67 (MD5)

Relationships

In Administrative Set:
Last modified: 08/08/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items