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.
This chapter is devoted to proving the Milnor–Wolf theorem, which states that a finitely generated solvable group has polynomial growth if and only if it is actually virtually nilpotent.
In this chapter all the basic notation and concepts are introduced.The notions of nilpotent, solvable, free, linear, finitely generated, and finitely presented groups are defined and examples are provided.Spaces of bounded and Lipschitz harmonic functions are defined, as well as harmonic functions of polynomial growths. Group actions are discussed and convolutions over abstract groups are defined.
Here, we dive deeper into the realm of reversible Markov chains, via the perspective of network theory. The notions of conductance and resistance are defined, as well as voltage and current, and the corresponding mathematical theory.The Laplacian and Green function are defined and their relation to harmonic functions explained. The chapter culminates with a proof (using network theory) that recurrence and transience are essentially group properties: these properties remain invariant when changing between different reasonable random walks on the same group (specifically, symmetric and adapted with finite second moment).
We study the noise sensitivity of the minimum spanning tree (MST) of the $n$-vertex complete graph when edges are assigned independent random weights. It is known that when the graph distance is rescaled by $n^{1/3}$ and vertices are given a uniform measure, the MST converges in distribution in the Gromov–Hausdorff–Prokhorov (GHP) topology. We prove that if the weight of each edge is resampled independently with probability $\varepsilon \gg n^{-1/3}$, then the pair of rescaled minimum spanning trees – before and after the noise – converges in distribution to independent random spaces. Conversely, if $\varepsilon \ll n^{-1/3}$, the GHP distance between the rescaled trees goes to $0$ in probability. This implies the noise sensitivity and stability for every property of the MST that corresponds to a continuity set of the random limit. The noise threshold of $n^{-1/3}$ coincides with the critical window of the Erdős-Rényi random graphs. In fact, these results follow from an analog theorem we prove regarding the minimum spanning forest of critical random graphs.
This chapter dives into the theory of (discrete time) martingales.The optional stopping theorem and the martingale convergence theorem are proved.These are used to provide some initial results regarding random walks on groups and bounded harmonic functions. Specifically, the random walk on the integer line is shown to be recurrent. Also, it is shown that the space of bounded harmonic functions is either just the constant functions or has infinite dimension.
The Choquet–Deny theorem states that any random walk on a nilpotent group is Liouville. This theorem is presented and proved. We then present a recent result from 2018 by Frisch, Hartman, Tamuz, and Vahidi-Ferdowski, that these are basically the only such examples.
In this chapter we start applying the tools developed in Part I to study random walks.The notion of amenable groups is defined, and Kesten’s criterion for amenable groups is proved. We then move to define the notion of isopermitric dimension. Inequalities relating the volume growth of a group to the isoperimetric dimension and to the decay of the heat kernel are proved.
In this chapter the basic theory of Markov chains is developed, with a focus on irreducible chains.The transition matrix is introduced as well as the notions of irreducibility, periodicity, recurrence (null and positive), and transience.The theory is applied to the relationship of a random walk on a group to the random walk on a finite-index subgroup induced by the "hitting measure."
Information generating functions (IGFs) have been of great interest to researchers due to their ability to generate various information measures. The IGF of an absolutely continuous random variable (see Golomb, S. (1966). The information generating function of a probability distribution. IEEE Transactions in Information Theory, 12(1), 75–77) depends on its density function. But, there are several models with intractable cumulative distribution functions, but do have explicit quantile functions. For this reason, in this work, we propose quantile version of the IGF, and then explore some of its properties. Effect of increasing transformations on it is then studied. Bounds are also obtained. The proposed generating function is studied especially for escort and generalized escort distributions. Some connections between the quantile-based IGF (Q-IGF) order and well-known stochastic orders are established. Finally, the proposed Q-IGF is extended for residual and past lifetimes as well. Several examples are presented through out to illustrate the theoretical results established here. An inferential application of the proposed methodology is also discussed
Let $\mathcal{V}$ and $\mathcal{U}$ be the point sets of two independent homogeneous Poisson processes on $\mathbb{R}^d$. A graph $\mathcal{G}_\mathcal{V}$ with vertex set $\mathcal{V}$ is constructed by first connecting pairs of points (v, u) with $v\in\mathcal{V}$ and $u\in\mathcal{U}$ independently with probability $g(v-u)$, where g is a non-increasing radial function, and then connecting two points $v_1,v_2\in\mathcal{V}$ if and only if they have a joint neighbor $u\in\mathcal{U}$. This gives rise to a random intersection graph on $\mathbb{R}^d$. Local properties of the graph, including the degree distribution, are investigated and quantified in terms of the intensities of the underlying Poisson processes and the function g. Furthermore, the percolation properties of the graph are characterized and shown to differ depending on whether g has bounded or unbounded support.
Brucellosis, a global zoonosis, is endemic in Israel. We used a national database of culture-confirmed cases (2004–2022) to analyse the trends of brucellosis. Of 2,489 unique cases, 99.8% were bacteraemic, 64% involved males, and the mean age was 30.5 years. Brucella melitensis was the dominant species (99.6%). Most cases occurred among the Arab sector (84.9%) followed by the Jewish (8.5%) and Druze (5.5%) sectors. The average annual incidence rates overall and for the Arab, Druze, and Jewish sectors were 1.6/100,000, 6.6/100,000, 5.5/100,000, and 0.18/100,000, respectively. The annual incidence rates among the Arab (incidence rate ratio (IRR) = 36.4) and the Druze (IRR = 29.6) sectors were significantly higher than among the Jewish sector (p < 0.001). The highest incidence rates among the Arab sector occurred in the South District, peaking at 41.0/100,000 in 2012. The frequencies of B. melitensis isolated biotypes (biotype 1 – 69.1%, biotype 2 – 26.0%, and biotype 3 – 4.3%) differed from most Middle Eastern and European countries. A significant switch between the dominant biotypes was noted in the second half of the study period. Efforts for control and prevention should be sustained and guided by a One Health approach mindful of the differential trends and changing epidemiology.
There is mounting pressure on (re)insurers to quantify the impacts of climate change, notably on the frequency and severity of claims due to weather events such as flooding. This is however a very challenging task for (re)insurers as it requires modeling at the scale of a portfolio and at a high enough spatial resolution to incorporate local climate change effects. In this paper, we introduce a data science approach to climate change risk assessment of pluvial flooding for insurance portfolios over Canada and the United States (US). The underlying flood occurrence model quantifies the financial impacts of short-term (12–48 h) precipitation dynamics over the present (2010–2030) and future climate (2040–2060) by leveraging statistical/machine learning and regional climate models. The flood occurrence model is designed for applications that do not require street-level precision as is often the case for scenario and trend analyses. It is applied at the full scale of Canada and the US over 10–25 km grids. Our analyses show that climate change and urbanization will typically increase losses over Canada and the US, while impacts are strongly heterogeneous from one state or province to another, or even within a territory. Portfolio applications highlight the importance for a (re)insurer to differentiate between future changes in hazard and exposure, as the latter may magnify or attenuate the impacts of climate change on losses.