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.
The previous two chapters have focused on the problem of graph partitioning, which has seen enormous interest and research work in recent years. We continue that aspect of network analysis by introducing the notion of spectral clustering. The main tool of this chapter is the graph Laplacian, which can be unnormalized or normalized. Also discussed is a regularized version of the adjacency matrix.
In recent years, the science of “networks” has become a very popular research topic and a growth area in many different disciplines. Two journals, Social Networks (first published in 1978) and Network Science (first published in 2013), have appeared that focus on network theory and applications. In its inaugural issue, the journal Network Science defined network science as the “study of the collection, management, analysis, interpretation, and presentation of relational data,” and noted that the more one learns about networks, the more one sees networks everywhere.
In this chapter, we recognize that the configurations of almost all networks vary with time. We define dynamic networks, which can be observed in discrete or continuous time. Discrete-time dynamic networks can be visualized as a sequence of snapshots of the network taken at different points in time. Continuous-time dynamic networks are more complicated, both visually and theoretically, and assume that edges can appear and disappear continuously through time. We discuss the idea of dynamic community discovery in which community detection strategies are applied to dynamic networks.
The life distribution of a device subject to shocks governed by a homogeneous Poisson process is shown to have a bathtub failure rate average (BFRA) when the probabilities $\bar{P}_k$ of surviving k shocks possess the corresponding discrete property. We prove closure under the formation of weak limits for BFRA distributions and explore related moment convergence issues within the BFRA family. Similar results for increasing and decreasing failure rate average distributions are obtained either independently or as consequences of our results. We also establish some results outlining the positions of various non-monotonic ageing classes such as bathtub failure rate, increasing initially then decreasing mean residual life, new worse then better than used in expectation, and increasing initially then decreasing mean time to failure in the hierarchy. Finally, an open problem is posed and a partial solution provided.
We present a Markov chain example where non-reversibility and an added edge jointly improve mixing time. When a random edge is added to a cycle of n vertices and a Markov chain with a drift is introduced, we get a mixing time of $O(n^{3/2})$ with probability bounded away from 0. If only one of the two modifications were performed, the mixing time would stay $\Omega(n^2)$.
The impact of individual symptoms reported post-COVID-19 on subjective well-being (SWB) is unknown. We described associations between SWB and selected reported symptoms following SARS-CoV-2 infection. We analysed reported symptoms and subjective well being from 2295 participants (of which 576 reporting previous infection) in an ongoing longitudinal cohort study taking place in Israel. We estimated changes in SWB associated with reported selected symptoms at three follow-up time points (3–6, 6–12 and 12–18 months post infection) among participants reporting previous SARS-CoV-2 infection, adjusted for key demographic variables, using linear regression. Our results suggest that the biggest and most sustained changes in SWB stems from non-specific symptoms (fatigue −7.7 percentage points (pp), confusion/ lack of concentration −10.7 pp, and sleep disorders −11.5pp, P < 0.005), whereas the effect of system-specific symptoms, such as musculoskeletal symptoms (weakness in muscles and muscle pain) on SWB, are less profound and more transient. Taking a similar approach for other symptoms and following individuals over time to describe trends in SWB changes attributable to specific symptoms will help understand the post-acute phase of COVID-19 and how it should be defined and better managed. Post-acute COVID19 symptoms were associated with a significant decrease in subjective well being up to 18 months after initial infection
We study a distributionally robust reinsurance problem with the risk measure being an expectile and under expected value premium principle. The mean and variance of the ground-up loss are known, but the loss distribution is otherwise unspecified. A minimax problem is formulated with its inner problem being a maximization problem over all distributions with known mean and variance. We show that the inner problem is equivalent to maximizing the problem over three-point distributions, reducing the infinite-dimensional optimization problem to a finite-dimensional optimization problem. The finite-dimensional optimization problem can be solved numerically. Numerical examples are given to study the impacts of the parameters involved.
We formalize a consumption–investment–insurance problem with the distinction of a state-dependent relative risk aversion. The state dependence refers to the state of the finite state Markov chain that also formalizes insurable risks such as health and lifetime uncertainty. We derive and analyze the implicit solution to the problem, compare it with special cases in the literature, and illustrate the range of results in a disability model where the relative risk aversion is preserved, decreases, or increases upon disability.
We study a stochastic model for a target benefit pension plan suffering from rising longevity and falling fertility. Policies for postponing retirement are carried out to hedge the payment difficulties caused by the aging population. The plan members’ contributions are set in advance while the pension payments reflect intergenerational equity by a target payment level and intergenerational risk sharing by an adjustment. The pension fund is invested in both a risk-free asset and a risky asset. Applying the stochastic optimal control methods, we derive analytic solutions for optimal investment and benefit payment strategies which minimize the benefit risk. Besides, an optimal delayed retirement age which can hedge against the aging phenomenon under certain parameters is given. Therefore, it can provide a basis for quantifying the delay of retirement time.
We study an optimal investment problem under a joint limited expected relative loss and portfolio insurance constraint with a general random benchmark. By making use of a static Lagrangian method in a complete market setting, the optimal wealth and investment strategy can be fully determined along with the existence and uniqueness of the Lagrangian multipliers. Our numerical demonstration for various commonly used random benchmarks shows a trade-off between the portfolio outperformance and underperformance relative to the benchmark, which may not be captured by the widely used Omega ratio and its utility-transformed version, reflecting the impact of the benchmarking loss constraint. Furthermore, we develop a new portfolio performance measurement indicator that incorporates the agent’s utility loss aversion relative to the benchmark via solving an equivalent optimal asset allocation problem with a benchmark-reference-based preference. We show that the expected utility performance is well depicted by looking at this new portfolio performance ratio, suggesting a more suitable portfolio performance measurement under a limited loss constraint relative to a possibly random benchmark.
One way to model telecommunication networks are static Boolean models. However, dynamics such as node mobility have a significant impact on the performance evaluation of such networks. Consider a Boolean model in $\mathbb {R}^d$ and a random direction movement scheme. Given a fixed time horizon $T>0$, we model these movements via cylinders in $\mathbb {R}^d \times [0,T]$. In this work, we derive central limit theorems for functionals of the union of these cylinders. The volume and the number of isolated cylinders and the Euler characteristic of the random set are considered and give an answer to the achievable throughput, the availability of nodes, and the topological structure of the network.
We investigated seroprevalence and factors associated with Leptospira spp. infections in humans in rural Northern Germany. Sera of 450 participants were tested for leptospira-reactive IgG antibodies by two enzyme-linked immunosorbent assays (ELISA). A narrow (specific) and a broad (sensitive) case definition were applied and results compared in the analysis. Personal data were collected via questionnaire and associations with the serostatus were investigated by multivariable logistic regression. The seroprevalence estimates were 1.6% (95%-confidence interval (CI) = 0.63–3.2) under the narrow and 4.2% (95%-CI = 2.6–6.5%) under the broad case definition. Few (14%) participants knew about the pathogen. No seropositive participant recalled a prior leptospirosis diagnosis. Spending more than two hours a week in the forest was significantly associated with anti-leptospira IgG in both models (broad case definition: adjusted odds ratio (aOR) = 2.8, 95%-CI = 1.2–9.1; narrow case definition: aOR = 11.1, 95%-CI = 1.3–97.1). Regular cleaning of storage rooms was negatively associated in the broad (aOR = 0.17, 95%-CI = 0.03–0.98) and touching a dead rodent in the past 10 years in the narrow case definition model (aOR = 0.23, 95%-CI = 0.05–1.04). Our findings support risk factors identified in previous investigations. To counter the low awareness for the pathogen, we recommend that health authorities communicate risks and preventive measures to the public by using target-group specific channels.
In this paper, we investigate the pricing of vulnerable European options in a market where the underlying stocks are not perfectly liquid. A liquidity discount factor is used to model the effect of liquidity risk in the market, and the default risk of the option issuer is incorporated into the model using a reduced-form model, where the default intensity process is correlated with the liquidity risk. We obtain a semiclosed-form pricing formula of vulnerable options through the inverse Fourier transform. Finally, we illustrate the effects of default risk and liquidity risk on option prices numerically.
Broiler chickens are among the main livestock sectors worldwide. With individual treatments being inapplicable, contrary to many other animal species, the need for antimicrobial use (AMU) is relatively high. AMU in animals is known to drive the emergence and spread of antimicrobial resistance (AMR). High farm biosecurity is a cornerstone for animal health and welfare, as well as food safety, as it protects animals from the introduction and spread of pathogens and therefore the need for AMU. The goal of this study was to identify the main biosecurity practices associated with AMU in broiler farms and to develop a statistical model that produces customised recommendations as to which biosecurity measures could be implemented on a farm to reduce its AMU, including a cost-effectiveness analysis of the recommended measures. AMU and biosecurity data were obtained cross-sectionally in 2014 from 181 broiler farms across nine European countries (Belgium, Bulgaria, Denmark, France, Germany, Italy, the Netherlands, Poland and Spain). Using mixed-effects random forest analysis (Mix-RF), recursive feature elimination was implemented to determine the biosecurity measures that best predicted AMU at the farm level. Subsequently, an algorithm was developed to generate AMU reduction scenarios based on the implementation of these measures. In the final Mix-RF model, 21 factors were present: 10 about internal biosecurity, 8 about external biosecurity and 3 about farm size and productivity, with the latter showing the largest (Gini) importance. Other AMU predictors, in order of importance, were the number of depopulation steps, compliance with a vaccination protocol for non-officially controlled diseases, and requiring visitors to check in before entering the farm. K-means clustering on the proximity matrix of the final Mix-RF model revealed that several measures interacted with each other, indicating that high AMU levels can arise for various reasons depending on the situation. The algorithm utilised the AMU predictive power of biosecurity measures while accounting also for their interactions, representing a first step toward aiding the decision-making process of veterinarians and farmers who are in need of implementing on-farm biosecurity measures to reduce their AMU.
Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory.
We introduce a variant of Shepp’s classical urn problem in which the optimal stopper does not know whether sampling from the urn is done with or without replacement. By considering the problem’s continuous-time analog, we provide bounds on the value function and, in the case of a balanced urn (with an equal number of each ball type), an explicit solution is found. Surprisingly, the optimal strategy for the balanced urn is the same as in the classical urn problem. However, the expected value upon stopping is lower due to the additional uncertainty present.
In the classical framework, a random walk on a group is a Markov chain with independent and identically distributed increments. In some sense, random walks are time and space homogeneous. This paper is devoted to a class of inhomogeneous random walks on $\mathbb{Z}^d$ termed ‘Markov additive processes’ (also known as Markov random walks, random walks with internal degrees of freedom, or semi-Markov processes). In this model, the increments of the walk are still independent but their distributions are dictated by a Markov chain, termed the internal Markov chain. While this model is largely studied in the literature, most of the results involve internal Markov chains whose operator is quasi-compact. This paper extends two results for more general internal operators: a local limit theorem and a sufficient criterion for their transience. These results are thereafter applied to a new family of models of drifted random walks on the lattice $\mathbb{Z}^d$.