We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We analyse features of the patterns formed from a simple model for a martensitic phase transition that fragments the unit square into rectangles. This is a fragmentation model that can be encoded by a general branching random walk. An important quantity is the distribution of the lengths of the interfaces in the pattern, and we establish limit theorems for some of the asymptotics of the interface profile. In particular, we are able to use a general branching process to show almost sure power law decay of the number of interfaces of at least a certain size and a general branching random walk to examine the numbers of rectangles of a certain aspect ratio. In doing so we extend a theorem on the growth of the general branching random walk as well as developing results on the tail behaviour of the limiting random variable in our general branching process.
This paper investigates the distributions of triangle counts per vertex and edge, as a means for network description, analysis, model building, and other tasks. The main interest is in estimating these distributions through sampling, especially for large networks. A novel sampling method tailored for the estimation analysis is proposed, with three sampling designs motivated by several network access scenarios. An estimation method based on inversion and an asymptotic method are developed to recover the entire distribution. A single method to estimate the distribution using multiple samples is also considered. Algorithms are presented to sample the network under the various access scenarios. Finally, the estimation methods on synthetic and real-world networks are evaluated in a data study.
Power laws (and the special case of Zipf’s law) allow us to characterize cities on a map with a single number, namely the slope of a rank-size curve. These rank-size curves show the rank of a city as a function of its size: the biggest city gets rank 1, the second largest city rank 2, and so on. The slope tells us whether cities are relatively similar in size (small slope) or unevenly sized (steep slope). But what explains the existence of different sized cities? This chapter introduces some urban theories that explain the existence of different sized cities; a graphical representation of the Henderson model and a graphical representation of a state-of-the-art model of differentiated cities as developed by Davis and Dingle.
Power laws (and the special case of Zipf’s law) allow us to characterize cities on a map with a single number, namely the slope of a rank-size curve. These rank-size curves show the rank of a city as a function of its size: the biggest city gets rank 1, the second largest city rank 2, and so on. The slope tells us whether cities are relatively similar in size (small slope) or unevenly sized (steep slope). But what explains the existence of different sized cities? This chapter introduces some urban theories that explain the existence of different sized cities; a graphical representation of the Henderson model and a graphical representation of a state-of-the-art model of differentiated cities as developed by Davis and Dingle.
For an independent percolation model on , where is a homogeneous tree and is a one-dimensional lattice, it is shown, by verifying that the triangle condition is satisfied, that the percolation probability θ (p) is a continuous function of p at the critical point pc, and the critical exponents , γ, δ, and Δ exist and take their mean-field values. Some analogous results for Markov fields on are also obtained.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.