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 problem of reconstructing a distribution with bounded support from its moments is practically relevant in many fields, such as chemical engineering, electrical engineering, and image analysis. The problem is closely related to a classical moment problem, called the truncated Hausdorff moment problem (THMP). We call a method that finds or approximates a solution to the THMP a Hausdorff moment transform (HMT). In practice, selecting the right HMT for specific objectives remains a challenge. This study introduces a systematic and comprehensive method for comparing HMTs based on accuracy, computational complexity, and precision requirements. To enable fair comparisons, we present approaches for generating representative moment sequences. The study also enhances existing HMTs by reducing their computational complexity. Our findings show that the performances of the approximations differ significantly in their convergence, accuracy, and numerical complexity and that the decay order of the moment sequence strongly affects the accuracy requirement.
This commentary examines the dual role of artificial intelligence (AI) in shaping electoral integrity and combating misinformation, with a focus on the 2025 Philippine elections. It investigates how AI has been weaponised to manipulate narratives and suggests strategies to counteract disinformation. Drawing on case studies from the Philippines, Taiwan, and India—regions in the Indo-Pacific with vibrant democracies, high digital engagement, and recent experiences with election-related misinformation—it highlights the risks of AI-driven content and the innovative measures used to address its spread. The commentary advocates for a balanced approach that incorporates technological solutions, regulatory frameworks, and digital literacy to safeguard democratic processes and promote informed public participation. The rise of generative AI tools has significantly amplified the risks of disinformation, such as deepfakes, and algorithmic biases. These technologies have been exploited to influence voter perceptions and undermine democratic systems, creating a pressing need for protective measures. In the Philippines, social media platforms have been used to spread revisionist narratives, while Taiwan employs AI for real-time fact-checking. India’s proactive approach, including a public misinformation tipline, showcases effective countermeasures. These examples highlight the complex challenges and opportunities presented by AI in different electoral contexts. The commentary stresses the need for regulatory frameworks designed to address AI’s dual-use nature, advocating for transparency, real-time monitoring, and collaboration between governments, civil society, and the private sector. It also explores the criteria for effective AI solutions, including scalability, adaptability, and ethical considerations, to guide future interventions. Ultimately, it underscores the importance of digital literacy and resilient information ecosystems in supporting informed democratic participation.
This paper develops a theoretical framework to examine the technology adoption decisions of insurers and their impact on market share, considering heterogeneous customers and two representative insurers. Intuitively, when technology accessibility is observable, an insurer’s access to a new technology increases its market share, no matter whether it adopts the technology or not. However, when technology accessibility is unobservable, the insurer’s access to the new technology has additional side effects on its market share. First, the insurer may apply the available technology even if it increases costs and premiums, thereby decreasing market share. Second, the unobservable technology accessibility leads customers to expect that all insurers might have access to the new technology and underestimate the premium of those without access. This also decreases the market share of an insurer with access to the new technology. Our findings help explain the unclear relationship between technology adoption and the market share of insurance companies in practice.
We consider a new approach in the definition of two-dimensional heavy-tailed distributions. Specifically, we introduce the classes of two-dimensional long-tailed, of two-dimensional dominatedly varying, and of two-dimensional consistently varying distributions. Next, we define the closure property with respect to two-dimensional convolution and to joint max-sum equivalence in order to study whether they are satisfied by these classes. Further, we examine the joint-tail behavior of two random sums, under generalized tail asymptotic independence. Afterward, we study the closure property under scalar product and two-dimensional product convolution, and by these results, we extended our main result in the case of jointly randomly weighted sums. Our results contained some applications where we establish the asymptotic expression of the ruin probability in a two-dimensional discrete-time risk model.
This paper utilizes neural networks (NNs) for cycle detection in the insurance industry. The efficacy of NNs is compared on simulated data to the standard methods used in the underwriting cycles literature. The results show that NN models perform well in detecting cycles even in the presence of outliers and structural breaks. The methodology is applied to a granular data set of prices per risk profile from the Brazilian insurance industry.
In Chapter 6 we present a general approach relying on the diffusion approximation to prove renewal theorems for Markov chains, so we consider Markov chains which may be approximated by a diffusion process. For a transient Markov chain with asymptotically zero drift, the average time spent by the chain in a unit interval is, roughly speaking, the reciprocal of the drift.
We apply a martingale-type technique and show that the asymptotic behaviour of the renewal measure depends heavily on the rate at which the drift vanishes. As in the last two chapters, two main cases are distinguished, either the drift of the chain decreases as 1/x or much more slowly than that. In contrast with the case of an asymptotically positive drift considered in Chapter 10, the case of vanishing drift is quite tricky to analyse since the Markov chain tends to infinity rather slowly.
In Chapter 3 we consider (right) transient Markov chains taking values in R. We are interested in down-crossing probabilities for them. These clearly depend on the asymptotic properties of the chain drift at infinity.
In Chapter 9 we consider a recurrent Markov chain possessing an invariant measure which is either probabilistic in the case of positive recurrence or σ-finite in the case of null recurrence. Our main aim here is to describe the asymptotic behaviour of the invariant distribution tail for a class of Markov chains with asymptotically zero drift going to zero more slowly than 1/x. We start with a result which states that a typical stationary Markov chain with asymptotically zero drift always generates a heavy-tailed invariant distribution which is very different from the case of Markov chains with asymptotically negative drift bounded away from zero. Then we develop techniques needed for deriving precise tail asymptotics of Weibullian type.
The main goal of Chapter 11 is to demonstrate how the theory developed in the previous chapters can be used in the study of various Markov models that give rise to Markov chains with asymptotically zero drift. Some of those models are popular in stochastic modelling: random walks conditioned to stay positive, state-dependent branching processes or branching processes with migration, stochastic difference equations. In contrast with the general approach discussed here, the methods available in the literature for investigation of these models are mostly model tailored. We also introduce some new models to which our approach is applicable. For example, we introduce a risk process with surplus-dependent premium rate, which converges to the critical threshold in the nett-profit condition. Furthermore, we introduce a new class of branching processes with migration and with state-dependent offspring distributions.
In Chapter 8 we consider a recurrent Markov chain possessing an invariant measure which is either probabilistic in the case of positive recurrence or σ-finite in the case of null recurrence. Our main aim here is to describe the asymptotic behaviour of the invariant distribution tail for a class of Markov chains with asymptotically zero drift proportional to 1/x. We start with a result which states that a typical stationary Markov chain with asymptotically zero drift always generates a heavy-tailed invariant distribution, which is very different from the case of Markov chains with asymptotically negative drift bounded away from zero. Then we develop techniques needed for deriving precise tail asymptotics of power type.
In Introduction we mostly discuss nearest neighbour Markov chains which represent one of the two classes of Markov chains whose either invariant measure in the case of positive recurrence or Green function in the case of transience is available in closed form. Closed form makes possible direct analysis of such Markov chains: classification, tail asymptotics of the invariant probabilities or Green function. This discussion sheds some light on what we may expect for general Markov chains. Another class is provided by diffusion processes which are also discussed in Introduction.
Chapters 4 and 5 of the present monograph deal comprehensively with limit theorems for transient Markov chains. In Chapter 4 we consider drifts of order 1/x, and prove limit theorems including convergence to a Γ-distribution and functional convergence to a Bessel process. We also study the asymptotic behaviour of the renewal measure, which is not straightforward as there is no law of large numbers owing to the comparable contributions of the drift and fluctuations.
In Chapter 10 we consider Markov chains with asymptotically constant (non-zero) drift. As shown in the previous chapter, the more slowly they to zero, the higher are the moments that should behave regularly at infinity. This is needed to make it possible to describe the asymptotic tail behaviour of the invariant measure. Therefore, it is not surprising that in the case of an asymptotically negative drift bounded away from zero we need to assume that the distribution of jumps converges weakly at infinity. This corresponds, roughly speaking, to the assumption that all moments behave regularly at infinity. In this chapter we slightly extend the notion of an asymptotically homogeneous Markov chain by allowing extended limiting random variables.
In Chapter 2 we introduce a classification of Markov chains with asymptotically zero drift, which relies on relations between the drift and the second moment of jumps, with many improvements on the results known in the literature. Additional assumptions are expressed in terms of truncated moments of higher orders and tail probabilities of jumps. Another, more important, contrast with previous results on recurrence/transience is the fact that we do not use concrete Lyapunov test functions (quadratic or similar). Instead, we construct an abstract Lyapunov function which is motivated by the harmonic function of a diffusion process with the same drift and diffusion coefficient.