Use this URL to cite or link to this record in EThOS:
Title: Renormalisation of random hierarchial systems
Author: Jordan, Jonathan
ISNI:       0000 0001 3593 0839
Awarding Body: University of Oxford
Current Institution: University of Oxford
Date of Award: 2003
Availability of Full Text:
Access from EThOS:
Full text unavailable from EThOS. Please try the link below.
Access from Institution:
This thesis considers a number of problems which are related to the study of random fractals. We define a class of iterations (which we call random hierarchical systems) of probability distributions, which are defined by applying a random map to a set of k independent and identically distributed random variables. Classical examples of this sort of iteration include the Strong Law of Large Numbers, Galton-Watson branching processes, and the construction of random self-similar sets. In Chapter 2, we consider random hierarchical systems on ℝ, under the condition that the random map is bounded above by a random weighted mean, and that the initial distribution is bounded below. Under moment conditions on the initial distribution we show that there exists almost sure convergence to a constant. In Chapters 3 to 5 we consider the asymptotics of some examples of random hierarchical systems, some of which arise when considering certain properties of random fractal graphs. In one example, which is related to first-passage percolation on a random hierarchical lattice, we show the existence of a family of non-degenerate fixed points and show that the sequence of distributions will converge to one of these. The results of some simulations are reported in Chapter 7. Part III investigates the spectral properties of random fractal graphs. In Chapter 8 we look at one example in detail, showing that there exist localised eigenfunctions which lead to certain eigenvalues having very high multiplicity. We also investigate the behaviour of the Cheeger constants of this example. We then consider eigenvalues of homogeneous random fractal graphs, which preserve some of the symmetry of deterministic fractals. We then use relationships between homogeneous graphs and more general random fractal graphs to obtain results on the eigenvalues of the latter. Finally, we consider a few further examples.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Fractals ; Research ; Eigenvalues