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 describe couplings between Schramm–Loewner Evolution (SLE) curves and variants of the Gaussian free field (GFF). In particular, we give a complete proof of Sheffield’s construction of -quantum boundary length along an curve, as measured by an independent underlying GFF. The main input for this proof is a rigorous construction of the so-called quantum gravity zipper, which is a stationary dynamic on quantum surfaces (defined using a GFF) decorated by SLE. Another consequence of this construction is that drawing an SLE curve on top of an appropriate independent quantum surface splits the surface into two independent and identically distributed (sub)-surfaces, glued according to boundary length. In particular, this shows that SLE curves are solutions of natural random conformal welding problems.
Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree conditions on the hypergraph $ \mathcal{H}$ and the conflicts to be avoided, a conflict-free almost-perfect matching can be extended to one covering all vertices in a particular subset of $ V(\mathcal{H})$, by using an additional set of edges; in particular, we ensure that our matching avoids all additional conflicts, which may consist of both old and new edges. This setup is useful for various applications in design theory and Ramsey theory. For example, our main result provides a crucial tool in the recent proof of the high-girth existence conjecture due to Delcourt and Postle. It also provides a black box which encapsulates many long and tedious calculations, greatly simplifying the proofs of results in generalised Ramsey theory.
In this chapter, we introduce the Liouville measures associated with the continuum two-dimensional Gaussian free field (GFF). Informally speaking, for a fixed parameter (the so-called coupling constant), the -Liouville measure is obtained by exponentiating times the GFF and taking this as a density with respect to Lebesgue measure. Since the GFF is not defined pointwise, the rigorous construction of this measure requires an approximation procedure. The bulk of this chapter is dedicated to establishing appropriate approximations, justifying their convergence, and proving uniqueness of the resulting measures. We also prove an important change-of-coordinates formula. The construction will be generalised in Chapter 3, which treats the overarching theory of Gaussian multiplicative chaos measures. These are measures of the same form discussed above, but constructed from a general underlying log-correlated Gaussian field. While the two-dimensional GFF is really just a specific example of such a field, some arguments specific to the GFF can be used to simplify the presentation and introduce relevant ideas in a clean way, without the need to introduce too much machinery.
In this chapter, we provide a comprehensive exposition of the theory of Gaussian multiplicative chaos (GMC), which generalises the construction of Liouville measures (discussed in Chapter 2) to the setup of logarithmically correlated Gaussian fields in arbitrary dimension and reference measures satisfying an energy condition. We first construct the Gaussian multiplicative chaos, which can be viewed as the measure obtained by exponentiating this logarithmically correlated field against the reference measure. We show that this measure can be characterised axiomatically (Shamov’s theorem). We then present a number of key tools for the study of GMC, including Girsanov’s lemma, Kahane’s convexity inequality and the explicit construction of certain fields enjoying a notion of exact scale invariance. Together, these two tools can be used to perform a multifractal study of GMC. This allows us to characterise the positive and negative moments that are finite. Finally, we apply these results to describe a rigorous version of the so-called KPZ (named after Knizhnik, Polyakov and Zamolodchikov) scaling relation.
In this appendix, we define radial Loewner chains and radial Schramm–Loewner evolutions (SLE). This includes the case of radial SLE with force points. We prove some of their main properties and their connection to chordal SLE. We conclude by discussing the particular version of radial SLE that satisfies invariance with respect to its target point.
In this appendix, we give an overview of the (deterministic) theory of chordal Loewner chains. We then define (chordal) Schramm–Loewner evolutions, including the case where force points are added, and describe some of their key properties.
We study a queueing system with a fixed number of parallel service stations of infinite servers, each having a dedicated arrival process, and one flexible arrival stream that is routed to one of the service stations according to a ‘weighted’ shortest queue policy. We consider the model with general arrival processes and general service time distributions. Assuming that the dedicated arrival rates are of order n and the flexible arrival rate is of order $\sqrt{n}$, we show that the diffusion-scaled queueing processes converge to a stochastic Volterra integral equation with ‘ranks’ driven by a continuous Gaussian process. It reduces to the limiting diffusion with a discontinuous drift in the Markovian setting.
Belief network analysis (BNA) has enabled major advances in the study of belief systems, capturing Converse’s understanding of the interdependence among multiple beliefs (i.e., constraint) more intuitively than many conventional statistics. However, BNA struggles with representing political divisions that follow a spatial logic, such as the “left–right” or “liberal-conservative” ideological divide. We argue that Response Item Networks (ResINs) have important advantages for modeling political cleavage lines as they organically capture belief systems in a latent ideological space. In addition to retaining many desirable properties inherent to BNA, ResIN can uncover ideological polarization in a visually intuitive, theoretically grounded, and statistically robust fashion. We demonstrate the advantages of ResIN by analyzing ideological polarization with regard to five hot-button issues from 2000 to 2020 using the American National Election Studies (ANES), and by comparing it against an equivalent procedure using BNA. We further introduce system-level and attitude-level polarization measures afforded by ResIN and discuss their potential to enrich the analysis of ideological polarization. Our analysis shows that ResIN allows us to observe much more detailed dynamics of polarization than classic BNA approaches.
This article examines the implications of adopting a socio-technical perspective on the design and implementation of GovTech solutions. To observe the phenomenon, it adopts a case study approach focusing on the WiseTown solution and its City Digital Twin (CDT), developed by the Italian company TeamDev. The article investigates how integrating social factors, such as urban governance, with technical elements, like data analysis and modeling, can enhance the conceptualization, design, and implementation of user-centric, data-driven digital solutions as part of a broader digital transformation strategy. The article explores an Italian best practice that is developing four dimensions of the GovTech socio-technical framework: Governance Structures, Institutional Arrangements, User and Context Understanding, and Technological Development. It critically examines and discusses the challenges and opportunities associated with the adoption of CDTs and their impact on public policy implementation. The analysis is centered on two main aspects that emerged from the case study: data integration and sharing within CDTs, and the social implications associated with data usage for decision-making. Ultimately, the article explores the role of stakeholder collaboration (public-private partnerships) and the creation of innovation ecosystems—GovTech ecosystem in this specific case—to inform and steer policymaking through and beyond the adoption of CDTs.
In many African countries, limited population data pose a challenge for tax administrations struggling with informal economies. This study examines Uganda’s integration of national ID data into tax registration through “Instant TIN,” an interface linking the Uganda Revenue Authority (URA) with the National Identification and Registration Agency (NIRA) and the Uganda Registration Service Bureau (URSB). This reform aims to streamline taxpayer registration and improve data quality. Using a mixed-methods approach—combining interviews with government officials and administrative data analysis—we identify three key findings. First, Instant TIN registrants differ significantly from those using the conventional process. They are more likely to be individuals, female, younger, and previously informal, highlighting the reform’s role in bringing in marginalised taxpayers. Second, Instant TIN improves data quality. It reduces TIN duplications for individuals and enhances contact accuracy, decreasing invalid or missing email addresses by eight percentage points and invalid phone numbers by six. However, it worsens sector data quality, increasing missing or incorrect sector information by 12 percentage points. Third, while Instant TIN reduces duplication, manual data entry, and administrative burdens, challenges remain. Infrequent updates in external datasets and a lack of validation within the interface increase administrative costs and complicate taxpayer engagement. Additionally, mandatory in-person updates and invalid contact details add to compliance burdens. Overall, Uganda’s experience highlights both the potential and limitations of integrating national ID data for tax administration, offering insights for other countries considering similar reforms.
How can we make global sensitivity analysis accessible and viable for engineering practice? In this translation article, we present a methodology to enable sensitivity analysis for structural and geotechnical engineering for built environment design and assessment workflows. Our technique wraps computational mechanics and geomechanics finite element (FE) simulations and combines high-performance computing on public cloud with surrogate modeling using machine learning. A key question we address is: “Is there a noticeable loss in fidelity of results from the sensitivity analysis when substituting a simulation model with a surrogate model?” We answer this question for both linear and nonlinear FE simulations.
In 1976, Cameron, Goethals, Seidel, and Shult classified all the graphs whose smallest eigenvalue is at least $-2$ by relating such graphs to root systems that appear in the classification of semisimple Lie algebras. In this paper, extending their beautiful theorem, we give a complete classification of all connected graphs whose smallest eigenvalue lies in $(\! -\lambda ^*, -2)$, where $\lambda ^* = ho ^{1/2} + ho ^{-1/2} \approx 2.01980$, and $ho$ is the unique real root of $x^3 = x + 1$. Our result is the first classification of infinitely many connected graphs with their smallest eigenvalue in $(\! -\lambda , -2)$ for any constant $\lambda \gt 2$.
In machine learning-based mortality models, interpretation methods are well established, and they can reveal structures resembling the age or time effects in traditional mortality models. However, in the reverse direction, using such traditional components to guide the initialization of a neural network remains highly challenging due to information loss during model interpretation. This study addresses this gap by exploring how components from pre-fitted traditional mortality models can be used to initialize neural networks, enabling structural information to be incorporated into a deep learning framework. We introduce Kolmogorov–Arnold Networks (KAN) and first construct two shallow models, KAN[2,1] and ARIMAKAN, to examine their applicability to mortality modeling. We then extend the Combined Actuarial Neural Network (CANN) into a KAN-based Actuarial Neural Network (KANN), in which classical model components calibrated via generalized nonlinear models or generalized additive models are naturally used for initialization. Three KANN variants, namely KANN[2,1], KANNLC, and KANNAPC, are proposed. In these models, neural networks assist in improving the accuracy of traditional models and help refine the original parameter estimates. All KANN-based models can also produce smooth mortality curves as well as smooth age, period, and cohort effects through simple regularization. Experiments on 34 populations demonstrate that KAN-based approaches achieve stable performance while balancing interpretability, smoothness, and predictive accuracy.
Google Trends is used in research and surveillance as a proxy for community infection incidence. Signals are difficult to validate, as most surveillance biases towards severe outcomes and certain demographics.
Using Winter COVID-19 Infection Study (WCIS) data in England, symptom prevalence is estimated via generalized additive model with multilevel-regression and poststratification. Symptom duration was estimated using interval censored time delay modelling, converting prevalence to incidence. Google Trends and WCIS incidence and growth rates were compared using cross-correlation.
Google Trends and WCIS agreement varied by symptom and age group. The national maximum growth rate cross-correlation for sore throat was 0.81, with 90% prediction intervals of [0.69, 0.90]. Google Trends growth rates generally lagged the WCIS growth rates across symptoms (cough: −5.0 days [−8.0, 0.0], fever: −3.0 days [−6.0, 1.0], loss of smell: −9.0 days [−13, −3.0], shortness of breath: −12 days [−16, −5.0], and sore throat: −4.0 days [−5.0, −2.0]).
This work shows Google Trends and community symptom incidence can align, although substantial variation between symptoms and age groups exists, underscoring utility in predicting other surveillance indicators.