DOCSLIB.ORG

RUIN THEORY for ENERGY-EFFICIENT RESOURCE ALLOCATION in UAV-ASSISTED CELLULAR NETWORKS 3945 Cellular Networks and Meet 5G NR Performance Requirements

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
RUIN THEORY for ENERGY-EFFICIENT RESOURCE ALLOCATION in UAV-ASSISTED CELLULAR NETWORKS 3945 Cellular Networks and Meet 5G NR Performance Requirements IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 69, NO. 6, JUNE 2021 3943 Ruin Theory for Energy-Efficient Resource Allocation in UAV-Assisted Cellular Networks Aunas Manzoor , Kitae Kim , Shashi Raj Pandey , S. M. Ahsan Kazmi , Nguyen H. Tran , Senior Member, IEEE, Walid Saad , Fellow, IEEE, and Choong Seon Hong , Senior Member, IEEE Abstract— Unmanned aerial vehicles (UAVs) can provide an I. INTRODUCTION effective solution for improving the coverage, capacity, and HE use of unmanned aerial vehicles (UAVs) can enable a the overall performance of terrestrial wireless cellular net- wide range of smart city applications, ranging from drone works. In particular, UAV-assisted cellular networks can meet T the stringent performance requirements of the fifth generation delivery to surveillance and monitoring [1]–[3]. Recently, new radio (5G NR) applications. In this article, the problem the use of UAVs has greatly increased in wireless-networking of energy-efficient resource allocation in UAV-assisted cellular applications to provide coverage and capacity enhancement to networks is studied under the reliability and latency constraints the ground wireless networks [4]. The flexibility, autonomy, of 5G NR applications. The framework of ruin theory is and ease of deployment of UAVs render them suitable to be employed to allow solar-powered UAVs to capture the dynamics of harvested and consumed energies. First, the surplus power a part of the future wireless networks. In wireless networking of every UAV is modeled, and then it is used to compute the applications, UAVs can have various roles that range from fly- probability of ruin of the UAVs. The probability of ruin denotes ing base stations (BSs) ([3]) to backhaul nodes ([5]) and users the vulnerability of draining out the power of a UAV. Next, of the cellular network ([3], [6], [7]). Therefore, by leveraging the probability of ruin is used for efficient user association line-of-sight (LoS) communication at high altitudes as well with each UAV. Then, power allocation for 5G NR applica- tions is performed to maximize the achievable network rate as the dynamic placement of UAVs at desired locations and using the water-filling approach. Simulation results demonstrate within a required time [8], the use of UAVs as flying BSs that the proposed ruin-based scheme can enhance the flight can play a significant role in boosting the capacity of cellular duration up to 61% and the number of served users in a networks [9]. For example, in [10], the authors proposed UAV flight by up to 58%, compared to a baseline SINR-based an UAV-assisted heterogeneous cellular network (HetNet) to scheme. meet the communication demands in emergencies for public Index Terms— 5G new radio (5G NR), user association, safety. The authors in [11] used optimal transport theory to energy efficiency, power allocation, ruin theory, surplus process, enable UAVs to provide communication services to ground unmanned aerial vehicles, URLLC. users while optimizing their flight time. Moreover, the authors of [12] proposed an efficient UAV BSs in coexistence with a Manuscript received September 15, 2020; revised January 18, 2021 and terrestrial network. In particular, when wireless connectivity is February 23, 2021; accepted February 27, 2021. Date of publication March 9, 2021; date of current version June 16, 2021. This work was supported by needed in difficult and costly deployment locations, UAVs can the National Research Foundation of Korea(NRF) grant funded by the Korea provide low-cost and low-power alternatives and complement government(MSIT) (No. 2020R1A4A1018607) and by the Institute of Infor- conventional small cell BSs (SBSs). For instance, a joint posi- mation & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No. 2019-0-01287, Evolvable Deep tioning and user association problem was introduced in [13], Learning Model Generation Platform for Edge Computing). The associate where UAVs were used as a replacement for terrestrial SBSs. editor coordinating the review of this article and approving it for publication The authors in [14] used circle packing theory to efficiently was H. Suraweera. (Corresponding author: Choong Seon Hong.) Aunas Manzoor, Kitae Kim, Shashi Raj Pandey, and Choong Seon Hong deploy multiple UAVs that provide maximum coverage for are with the Department of Computer Science and Engineering, Kyung Hee users. The authors in [15] proposed the deployment of UAVs University, Yongin 446-701, South Korea (e-mail: [email protected]; to power the sensors in an IoT network. The authors in [16] [email protected]; [email protected]; [email protected]). S. M. Ahsan Kazmi is with the Department of Computer Science and proposed a 3D point process-based UAV deployment where Creative Technologies, University of the West of England (UWE), Bristol the UAVs with multiple antennas provide downlink coverage BS16 1QY, U.K., and also with the Department of Computer Science and to the ground users. The authors in [17] proposed a 3D Engineering, Kyung Hee University, Yongin 446-701, South Korea (e-mail: [email protected]). deployment scheme for the UAVs while guaranteeing the Nguyen H. Tran is with the School of Computer Science, The University of safety distance between UAVs in mmWave network. More- Sydney, Sydney, NSW 2006, Australia (e-mail: [email protected]). over, UAVs are a very promising solution to the problem of Walid Saad is with Wireless@VT, Bradley Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA 24061 USA, and also connectivity in occasionally crowded areas, such as stadiums with the Department of Computer Science and Engineering, Kyung Hee or open-air shows. Owing to these benefits of UAVs in University, Yongin 446-701, South Korea (e-mail: [email protected]). wireless communications, it is envisioned that future wireless Color versions of one or more figures in this article are available at https://doi.org/10.1109/TCOMM.2021.3064968. cellular networks [4] will be UAV-assisted because they can Digital Object Identifier 10.1109/TCOMM.2021.3064968 complement their terrestrial infrastructure with flying UAV 0090-6778 © 2021 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information. Authorized licensed use limited to: Kyunghee Univ. Downloaded on June 17,2021 at 05:23:30 UTC from IEEE Xplore. Restrictions apply. 3944 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 69, NO. 6, JUNE 2021 BSs. Meanwhile, to design efficient UAV-assisted cellular energy-efficient solutions for UAV communication networks networks, it is necessary to address various challenges that have been proposed to address this problem [31]–[36]. For range from network modeling to optimization and resource instance, the authors in [31] developed a non-cooperative management [3]. game to optimize the beaconing periods among competing The use of UAVs is particularly meaningful for deliver- drones. In this way, the energy consumption in individual ing 5G new radio (NR) applications [18]. Enhanced mobile drones is optimized in a distributed manner. The authors broadband (eMBB) users require high data rates for 3D in [32] proposed a spectrum and energy-efficient scheme movies, gaming and AR/VR services. UAVs can promise such for UAV-enabled relay network, in which the UAV path is high data rates by exploiting the LoS communication [19]. optimized by allocating the communication time slots between Since UAVs have already been used for data collection from source and destination nodes. In [33], the authors proposed Internet of Things (IoT) networks [20], they can perform an energy-aware power allocation scheme in the UAV-assisted well for massive machine type communication (mMTC). edge networks while utilizing the internet of vehicles for Moreover, to meet the reliability and latency demands of the computation offloading. The authors in [34] developed a ultra-reliable and low-latency communication (URLLC) appli- UAV placement scheme to maximize the served users while cations, the LoS communication, and optimal positioning consuming the minimum transmit power. The authors in [35] features of UAVs can be promising. Recently, the use of UAVs designed a UAV communication scheme to optimize the UAV has been proposed in delay-sensitive and mission critical appli- trajectory while minimizing the energy consumption during cations [21]–[23]. The authors in [21] proposed a dynamic tra- the UAV flight. The authors in [36] proposed an energy effi- jectory control algorithm to optimize the delay and throughput ciency scheme in downlink (DL) and uplink (UL) decoupled in the UAV-aided networks. In [22], the authors developed a access network. The authors in [37] proposed a downlink URLLC channel model to ensure the delay-sensitive delivery energy transfer from the UAVs to the ground IoT devices, of critical control information from the ground station to the and the uplink information transfer from IoT devices to the UAV. The authors in [23] used a URLLC-enabled UAV to UAVs. develop a relay system for the delay-sensitive and ultra-reliable In order to improve energy efficiency in UAV-assisted communication. The authors in [24] used UAV as a relaying wireless networks, it is possible to harness the possibility node between the controller and robot when there is no LoS of energy harvesting (particularly using renewable sources link available between them. The location and power of the such as solar energy), a technical challenge that has not UAV is optimized to meet the URLLC reliability requirements. been considered in the aforementioned works [30]–[35]. By The authors in [25] studied the use of ultra-reliable low latency employing energy harvesting, the same UAVs can be used communications for controlling UAVs and allowing them to to serve the cellular users for a comparatively longer dura- avoid collisions. The authors in [26] discussed the URLLC tion to increase the air time of UAV. In this regard, there communication for IoT networks while analyzing the security exist very few studies [38]–[41] that discussed UAVs with challenges in IoT.
Load more

Recommended publications
  • Official Journal of the Bernoulli Society for Mathematical Statistics And
    Official Journal of the Bernoulli Society for Mathematical Statistics and Probability Volume Twenty One Number Four November 2015 ISSN: 1350-7265 CONTENTS Papers BEN ALAYA, M., HAJJI, K. and KEBAIER, A. 1947 Importance sampling and statistical Romberg method REBELLES, G. 1984 Pointwise adaptive estimation of a multivariate density under independence hypothesis OGIHARA, T. 2024 Local asymptotic mixed normality property for nonsynchronously observed diffusion processes ADAMCZAK, R. and BEDNORZ, W. 2073 Some remarks on MCMC estimation of spectra of integral operators AKASHI, F., LIU, Y. and TANIGUCHI, M. 2093 An empirical likelihood approach for symmetric α-stable processes VOS, P. and WU, Q. 2120 Maximum likelihood estimators uniformly minimize distribution variance among distribution unbiased estimators in exponential families BOURGUIN, S. 2139 Poisson convergence on the free Poisson algebra FANG, X. and RÖLLIN, A. 2157 Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics CHONG, C. and KLÜPPELBERG, C. 2190 Integrability conditions for space–time stochastic integrals: Theory and applications CHEN, F. and NKURUNZIZA, S. 2217 Optimal method in multiple regression with structural changes GIACOMIN, G. and MERLE, M. 2242 Weak noise and non-hyperbolic unstable fixed points: Sharp estimates on transit and exit times BULL, A.D. 2289 Adaptive-treed bandits (continued) The papers published in Bernoulli are indexed or abstracted in Current Index to Statistics, Mathematical Reviews, Statistical Theory and Method Abstracts-Zentralblatt (STMA-Z), and Zentralblatt für Mathematik (also avalaible on the MATH via STN database and Compact MATH CD-ROM). A list of forthcoming papers can be found online at http://www.
    [Show full text]
  • Convoluted Fractional Poisson Process
    ALEA, Lat. Am. J. Probab. Math. Stat. 18, 1241–1265 (2021) DOI: 10.30757/ALEA.v18-46 Convoluted Fractional Poisson Process Kuldeep Kumar Kataria and Mostafizar Khandakar Department of Mathematics Indian Institute of Technology Bhilai Raipur-492015, India. E-mail address: [email protected], [email protected] Abstract. In this paper, we introduce and study a convoluted version of the time fractional Poisson process by taking the discrete convolution with respect to space variable in the system of fractional differential equations that governs its state probabilities. We call the introduced process as the convoluted fractional Poisson process (CFPP). It has integer valued jumps of size j ≥ 1. The explicit expression for the Laplace transform of its state probabilities are obtained whose inversion yields its one-dimensional distribution. A special case of the CFPP, namely, the convoluted Poisson process (CPP) is studied and its time-changed subordination relationships with CFPP are discussed. It is shown that the CPP is a Lévy process using which the long-range dependence property of CFPP is established. Moreover, we show that the increments of CFPP exhibits short-range dependence property. 1. Introduction The Poisson process is a renewal process with exponentially distributed waiting times. This Lévy process is often used to model the counting phenomenon. Empirically, it is observed that the process with heavy-tailed distributed waiting times offers a better model than the ones with light-tailed distributed waiting times. For this purpose several fractional generalizations of the homogeneous Poisson process are introduced and studied by researchers in the past two decades.
    [Show full text]
  • Text Mining and Ruin Theory: a Case Study of Research on Risk Models with Dependence ∗
    Text mining and ruin theory: A case study of research on risk models with dependence ∗ Authors: Renata G. Alcoforado { ISEG & CEMAPRE, Universidade de Lisboa; Department of Accounting and Actuarial Sciences, Universidade Federal dePernambuco, Portugal & Brazil ([email protected]) Alfredo D. Eg´ıdio dos Reis { ISEG & CEMAPRE, Universidade de Lisboa Portugal ([email protected]) Abstract: • This paper aims to analyze unstructured data using a text mining approach. The work was motivated in order to organize and structure research in Risk Theory. In our study, the subject to be analyzed is composed by 27 published papers of the risk and ruin theory topic, area of actuarial science. They were coded into 32 categories. For the purpose, all data was analyzed and figures were produced using the software NVivo 11 plus. Software NVivo is a specialized tool in analyzing unstructured data, although it is commonly used just for qualitative research. We used it for Quali-Quant analysis. Key-Words: • Big data; Unstructured data; Text mining; Risk theory; Ruin theory; Dependence modeling. AMS Subject Classification: • 49A05, 78B26. ∗The opinions expressed in this text are those of the authors and do not necessarily reflect the views of any organization. 2 Renata G. Alcoforado and Alfredo D. Eg´ıdiodos Reis Using the \revstat.sty" Package 3 1. INTRODUCTION As widely known, Big Data is an area of great development in statistics. We can define Big Data as \a phenomenon defined by the rapid acceleration in the expanding volume of high velocity, complex, and diverse types of data. Big Data is often defined along three dimensions { volume, velocity, and variety" (TechAmerica Foundation's Federal Big Data Commission, 2012).
    [Show full text]
  • On the Profitability of Selfish Blockchain Mining Under Consideration of Ruin Hansjörg Albrecher, Pierre-Olivier Goffard
    On the profitability of selfish blockchain mining under consideration of ruin Hansjörg Albrecher, Pierre-Olivier Goffard To cite this version: Hansjörg Albrecher, Pierre-Olivier Goffard. On the profitability of selfish blockchain mining under consideration of ruin. 2021. hal-02649025v3 HAL Id: hal-02649025 https://hal.archives-ouvertes.fr/hal-02649025v3 Preprint submitted on 26 Apr 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. On the profitability of selfish blockchain mining under consideration of ruin Hansjörg Albrecher∗ and Pierre-O. Goffard† Abstract Mining blocks on a blockchain equipped with a proof of work consensus protocol is well-known to be resource-consuming. A miner bears the operational cost, mainly electricity consumption and IT gear, of mining, and is compensated by a capital gain when a block is discovered. This paper aims at quantifying the profitability of min- ing when the possible event of ruin is also considered. This is done by formulating a tractable stochastic model and using tools from applied probability and analysis, including the explicit solution of a certain type of advanced functional differential equation. The expected profit at a future time point is determined for the situation when the miner follows the protocol as well as when he/she withholds blocks.
    [Show full text]
  • Duality in Ruin Problems for Ordered Risk Models Pierre-Olivier Goffard, Claude Lefèvre
    Duality in ruin problems for ordered risk models Pierre-Olivier Goffard, Claude Lefèvre To cite this version: Pierre-Olivier Goffard, Claude Lefèvre. Duality in ruin problems for ordered risk models. 2016. hal-01398910v2 HAL Id: hal-01398910 https://hal.archives-ouvertes.fr/hal-01398910v2 Preprint submitted on 9 Oct 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Duality in ruin problems for ordered risk models Pierre-Olivier Goffard∗, Claude Lef`evrey September 18, 2017 Abstract On one hand, an ordered dual risk model is considered where the profit arrivals are governed by an order statistic point process (OSPP). First, the ruin time distribution is obtained in terms of Abel-Gontcharov polynomials. Then, by duality, the ruin time distribution is deduced for an insurance model where the claim amounts correspond to the inter-arrival times in an OSPP. On the other hand, an ordered insurance model is considered with an OSPP as claim arrival process. Lef`evreand Picard [28] determined the finite-time ruin probability in terms of Appell polynomials. Duality is used to derive the ruin probability in a dual model where the profit sizes correspond to the inter-arrival times of an OSPP.
    [Show full text]
  • Text Mining and Ruin Theory: a Case Study of Research on Risk Models with Dependence
    REVSTAT – Statistical Journal Volume 18, Number 4, October 2020, 483–499 TEXT MINING AND RUIN THEORY: A CASE STUDY OF RESEARCH ON RISK MODELS WITH DEPENDENCE Authors: Renata G. Alcoforado – ISEG & CEMAPRE, Universidade de Lisboa, Portugal and Department of Accounting and Actuarial Sciences, Universidade Federal de Pernambuco, Brazil [email protected] Alfredo D. Eg´ıdio dos Reis – ISEG & CEMAPRE, Universidade de Lisboa Portugal [email protected] Received: December 2017 Revised: June 2018 Accepted: June 2018 Abstract: • This paper aims to analyze unstructured data using a text mining approach. The work was motivated in order to organize and structure research in Risk Theory. In our study, the subject to be analyzed is composed by 27 published papers of the risk and ruin theory topic, area of actuarial science. They were coded into 32 categories. For the purpose, all data was analyzed and figures were produced using the software NVivo 11 plus. Software NVivo is a specialized tool in analyzing unstructured data, although it is commonly used just for qualitative research. We used it for Quali-Quant analysis. Keywords: • big data; unstructured data; text mining; risk theory; ruin theory; dependence modeling. AMS Subject Classification: • 49A05, 78B26. 484 Renata G. Alcoforado and Alfredo D. Eg´ıdio dos Reis 1. INTRODUCTION As widely known, Big Data is an area of great development in statistics. We can define Big Data as “a phenomenon defined by the rapid acceleration in the expanding volume of high velocity, complex, and diverse types of data. Big Data is often defined along three dimensions — volume, velocity, and variety” (TechAmerica Foundation’s Federal Big Data Commission [44], 2012).
    [Show full text]
  • Mathematical Tripos Part III Lecture Courses in 2013-2014
    Mathematical Tripos Part III Lecture Courses in 2013-2014 Department of Pure Mathematics & Mathematical Statistics Department of Applied Mathematics & Theoretical Physics Notes and Disclaimers. • Students may take any combination of lectures that is allowed by the timetable. The examination timetable corresponds to the lecture timetable and it is therefore not possible to take two courses for examination that are lectured in the same timetable slot. There is no requirement that students study only courses offered by one Department. • The code in parentheses after each course name indicates the term of the course (M: Michaelmas; L: Lent; E: Easter), and the number of lectures in the course. Unless indicated otherwise, a 16 lecture course is equivalent to 2 credit units, while a 24 lecture course is equivalent to 3 credit units. Please note that certain courses are non-examinable, and are indicated as such after the title. Some of these courses may be the basis for Part III essays. • At the start of some sections there is a paragraph indicating the desirable previous knowledge for courses in that section. On one hand, such paragraphs are not exhaustive, whilst on the other, not all courses require all the pre-requisite material indicated. However you are strongly recommended to read up on the material with which you are unfamiliar if you intend to take a significant number of courses from a particular section. • The courses described in this document apply only for the academic year 2013-14. Details for subsequent years are often broadly similar, but not necessarily identical. The courses evolve from year to year.
    [Show full text]
  • Ruin Models with Investment Income 417 the 20Th Century the Theory of Stochastic Processes Was Far Less Developed, and Also Far Less Known, Than It Is Today
    Probability Surveys Vol. 5 (2008) 416–434 ISSN: 1549-5787 DOI: 10.1214/08-PS134 Ruin models with investment income Jostein Paulsen∗ Department of Mathematics University of Bergen Johs. Brunsgt. 12 5008 Bergen, Norway Abstract: This survey treats the problem of ruin in a risk model when assets earn investment income. In addition to a general presentation of the problem, topics covered are a presentation of the relevant integro- differential equations, exact and numerical solutions, asymptotic results, bounds on the ruin probability and also the possibility of minimizing the ruin probability by investment and possibly reinsurance control. The main emphasis is on continuous time models, but discrete time models are also covered. A fairly extensive list of references is provided, particularly of pa- pers published after 1998. For more references to papers published before that, the reader can consult [47]. AMS 2000 subject classifications: Primary 60G99; secondary 60G40, 60G44, 60J25, 60J75. Keywords and phrases: Ruin probability, Risk theory, Compounding assets. Received June 2008. Contents 1 Introduction................................. 416 2 SomegeneralresultsintheMarkovmodel . 419 3 Adiscretetimemodel ........................... 420 4 Analytical and numerical solutions . 421 5 Asymptoticresults ............................. 422 6 Inequalities ................................. 425 7 Stochasticinterestrates . 425 8 Minimization of ruin probabilities . 426 References.................................... 429 arXiv:0806.4125v2 [q-fin.RM] 18 Dec 2008 1. Introduction The problem of ruin has a long history in risk theory, going back to Lundberg [40]. In Lundberg’s model, the company did not earn any investment on its capital. An obvious reason for this assumption, although there may be other reasons as well, is that the mathematics is easier, and back in the first half of ∗This survey was written while the author was a visiting professor at the departments of mathematics and statistics at The University of Chicago 416 J.
    [Show full text]
  • A Risk Surplus Model Using Hawkes Point Processes
    U.U.D.M. Project Report 2015:11 A Risk Surplus Model using Hawkes Point Processes Hanna Magnusson Examensarbete i matematik, 15 hp Handledare och examinator: Ingemar Kaj Maj 2015 Department of Mathematics Uppsala University A Risk Surplus Model using Hawkes Point Processes Hanna Magnusson Abstract In this thesis we define a Hawkes process with exponential decay that later on is used in an application to insurance. We have also applied a simulation algorithm for the Hawkes process that are able to model cluster arrival of claims. In the classical risk model one uses a homogeneous Poisson process to model the arrival of claims which is not realistic. What is most crucial for an insurance company is to price their premiums such that the probability of bankruptcy is small. Hence, we discuss the effect of modelling claim arrivals with a Hawkes process and different choices of premium principles with respect to the probability of ruin. Contents 1 Introduction 1 2 Hawkes Process 1 3 Simulation Algorithm 4 3.1 An Illustration of a Hawkes Process . 5 4 Application of a Hawkes Process in Insurance 5 4.1 The Cram´er-Lundberg Model . 5 4.2 Net Profit Condition . 8 4.3 The Expected Value Principle . 8 4.4 Hawkes Point Processes in a Risk Model . 9 4.5 The Variance Principle . 16 5 Summary and Conclusion 18 1 Introduction Insurance companies offer their customers insurance against a risk in exchange for a premium. The main challenge for actuaries is to find an optimal premium, meaning that the probability of bankruptcy for the company should be small and the price of the pre- mium not too high.
    [Show full text]
  • Generalized Ornstein-Uhlenbeck Processes in Ruin Theory Jerôme Spielmann
    Generalized Ornstein-Uhlenbeck Processes in Ruin Theory Jerôme Spielmann To cite this version: Jerôme Spielmann. Generalized Ornstein-Uhlenbeck Processes in Ruin Theory. Probability [math.PR]. Université d’Angers, 2019. English. NNT : 2019ANGE0066. tel-03148887 HAL Id: tel-03148887 https://tel.archives-ouvertes.fr/tel-03148887 Submitted on 22 Feb 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. THESE DE DOCTORAT DE L'UNIVERSITE D'ANGERS COMUE UNIVERSITE BRETAGNE LOIRE ECOLE DOCTORALE N° 601 Mathématiques et Sciences et Technologies de l'Information et de la Communication Spécialité : Mathématiques et leurs interactions Jérôme SPIELMANN Generalized Ornstein-Uhlenbeck Processes in Ruin Theory Thèse présentée et soutenue à Angers, le 13 décembre 2019 Unité de recherche : LAREMA UMR CNRS 6093 Thèse N° : 181271 Rapporteurs avant soutenance : Youri Kabanov Professeur, Université de Franche-Comté Jostein Paulsen Professor, Københavns Universitet Composition du Jury : Loïc Chaumont Professeur, Université d’Angers Alexander Lindner Professor, Universität
    [Show full text]
  • Fractional Poisson Process
    FRACTIONAL RISK PROCESS IN INSURANCE Arun KUMAR1 Nikolai LEONENKO2 Alois PICHLER3 Abstract The Poisson process suitably models the time of successive events and thus has numerous applications in statistics, in economics, it is also fun- damental in queueing theory. Economic applications include trading and nowadays particularly high frequency trading. Of outstanding importance are applications in insurance, where arrival times of successive claims are of vital importance. It turns out, however, that real data do not always support the genuine Poisson process. This has lead to variants and augmentations such as time dependent and varying intensities, for example. This paper investigates the fractional Poisson process. We introduce the process and elaborate its main characteristics. The exemplary ap- plication considered here is the Carm´er–Lundberg theory and the Sparre Andersen model. The fractional regime leads to initial economic stress. On the other hand we demonstrate that the average capital required to recover a company after ruin does not change when switching to the frac- tional Poisson regime. We finally address particular risk measures, which allow simple evaluations in an environment governed by the fractional Poisson process. 1Department of Mathematics, Indian Institute of Technology Ropar, Rup- nagar, Punjab 140001, India [email protected] 2Cardiff School of Mathematics, Cardiff University, Senghennydd Road, Cardiff CF24 4AG, UK LeonenkoN@Cardiff.ac.uk 3Chemnitz University of Technology, Faculty of Mathematics, Chemnitz, Germany [email protected] Key words: Fractional Poisson process, convex risk measures Mathematics Subject Classification (1991): arXiv:1808.07950v2 [math.ST] 13 Apr 2019 1 Introduction Companies, which are exposed to random orders or bookings, face the threat of ruin.
    [Show full text]
  • Working Paper Series
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Research Papers in Economics INTERNATIONAL CENTRE FOR ECONOMIC RESEARCH WORKING PAPER SERIES Ramsés H. Mena and Luis E. Nieto-Barajas EXCHANGEABLE CLAIM SIZES IN A COMPOUND POISSON TYPE PROCESS Working Paper no. 19/2007 October 2007 APPLIED MATHEMATICS AND QUANTITATIVE METHODS WORKING PAPER SERIES Exchangeable claim sizes in a compound Poisson type process Ramses´ H. Mena1∗and Luis E. Nieto-Barajas2 y 1Department of Probability and Statistics, IIMAS{UNAM, 01000 Mexico, D.F. 2Department of Statistics, ITAM, Rio Hondo 1, Progreso Tizapan, 01080 Mexico, D.F. ABSTRACT. When dealing with risk models the typical assumption of indepen- dence among claim size distributions is not always satisfied. Here we consider the case when the claim sizes are exchangeable and study the implications when constructing aggregated claims through compound Poisson type processes. In par- ticular, exchangeability is achieved through conditional independence and using parametric and nonparametric measures for the conditioning distribution. A full Bayesian analysis of the proposed model is carried out to illustrate. Key words: Bayes nonparametrics, compound Poisson process, exchangeable claim process, exchangeable sequence, risk model. 1. Introduction In insurance and risk modelling, the compound Poisson process has played a fundamental role. The compound Poisson process (CPP), denoted as fXt; t ≥ 0g, can be defined by N Xt Xt = Yi; (1) i=1 where fNt; t ≥ 0g is a homogeneous Poisson process with intensity λ > 0 and Y1;Y2;::: a se- quence of independent and identically distributed (nonnegative) random variables with a com- mon density f, independent of Nt.
    [Show full text]