Inviting an author to review:
Find an author and click ‘Invite to review selected article’ near their name.
Search for authorsSearch for similar articles
1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Pricing of cyber insurance premiums using a Markov-based dynamic model with clustering structure

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Cyber insurance is a risk management option to cover financial losses caused by cyberattacks. Researchers have focused their attention on cyber insurance during the last decade. One of the primary issues related to cyber insurance is estimating the premium. The effect of network topology has been heavily explored in the previous three years in cyber risk modeling. However, none of the approaches has assessed the influence of clustering structures. Numerous earlier investigations have indicated that internal links within a cluster reduce transmission speed or efficacy. As a result, the clustering coefficient metric becomes crucial in understanding the effectiveness of viral transmission. We provide a modified Markov-based dynamic model in this paper that incorporates the influence of the clustering structure on calculating cyber insurance premiums. The objective is to create less expensive and less homogenous premiums by combining criteria other than degrees. This research proposes a novel method for calculating premiums that gives a competitive market price. We integrated the epidemic inhibition function into the Markov-based model by considering three functions: quadratic, linear, and exponential. Theoretical and numerical evaluations of regular networks suggested that premiums were more realistic than premiums without clustering. Validation on a real network showed a significant improvement in premiums compared to premiums without the clustering structure component despite some variations. Furthermore, the three functions demonstrated very high correlations between the premium, the total inhibition function of neighbors, and the speed of the inhibition function. Thus, the proposed method can provide application flexibility by adapting to specific company requirements and network configurations.

          Related collections

          Most cited references40

          • Record: found
          • Abstract: not found
          • Article: not found

          Epidemic processes in complex networks

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Virus Spread in Networks

              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Clustering Coefficients for Correlation Networks

              Graph theory is a useful tool for deciphering structural and functional networks of the brain on various spatial and temporal scales. The clustering coefficient quantifies the abundance of connected triangles in a network and is a major descriptive statistics of networks. For example, it finds an application in the assessment of small-worldness of brain networks, which is affected by attentional and cognitive conditions, age, psychiatric disorders and so forth. However, it remains unclear how the clustering coefficient should be measured in a correlation-based network, which is among major representations of brain networks. In the present article, we propose clustering coefficients tailored to correlation matrices. The key idea is to use three-way partial correlation or partial mutual information to measure the strength of the association between the two neighboring nodes of a focal node relative to the amount of pseudo-correlation expected from indirect paths between the nodes. Our method avoids the difficulties of previous applications of clustering coefficient (and other) measures in defining correlational networks, i.e., thresholding on the correlation value, discarding of negative correlation values, the pseudo-correlation problem and full partial correlation matrices whose estimation is computationally difficult. For proof of concept, we apply the proposed clustering coefficient measures to functional magnetic resonance imaging data obtained from healthy participants of various ages and compare them with conventional clustering coefficients. We show that the clustering coefficients decline with the age. The proposed clustering coefficients are more strongly correlated with age than the conventional ones are. We also show that the local variants of the proposed clustering coefficients (i.e., abundance of triangles around a focal node) are useful in characterizing individual nodes. In contrast, the conventional local clustering coefficients were strongly correlated with and therefore may be confounded by the node's connectivity. The proposed methods are expected to help us to understand clustering and lack thereof in correlational brain networks, such as those derived from functional time series and across-participant correlation in neuroanatomical properties.
                Bookmark

                Author and article information

                Contributors
                Role: ConceptualizationRole: Data curationRole: Formal analysisRole: InvestigationRole: MethodologyRole: SoftwareRole: ValidationRole: VisualizationRole: Writing – original draft
                Role: ConceptualizationRole: Formal analysisRole: Funding acquisitionRole: InvestigationRole: MethodologyRole: Project administrationRole: SupervisionRole: ValidationRole: Writing – review & editing
                Role: ConceptualizationRole: Formal analysisRole: SupervisionRole: ValidationRole: Writing – review & editing
                Role: Editor
                Journal
                PLoS One
                PLoS One
                plos
                PLoS ONE
                Public Library of Science (San Francisco, CA USA )
                1932-6203
                2021
                26 October 2021
                : 16
                : 10
                : e0258867
                Affiliations
                [1 ] Statistics Research Division, Institut Teknologi Bandung, Bandung, West Java, Indonesia
                [2 ] University Center of Excellence on Artificial Intelligence for Vision, Natural Language Processing & Big Data Analytics (U-CoE AI-VLB), Institut Teknologi Bandung, Bandung, West Java, Indonesia
                [3 ] Combinatorial Mathematics Research Division, Institut Teknologi Bandung, Bandung, West Java, Indonesia
                Universita degli Studi di Catania, ITALY
                Author notes

                Competing Interests: The authors have declared that no competing interests exist.

                Author information
                https://orcid.org/0000-0002-1290-0714
                https://orcid.org/0000-0003-0739-5757
                Article
                PONE-D-21-23878
                10.1371/journal.pone.0258867
                8547698
                3ca42794-6c28-485a-97d4-443c9aaa26bd
                © 2021 Antonio et al

                This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

                History
                : 22 July 2021
                : 6 October 2021
                Page count
                Figures: 15, Tables: 5, Pages: 28
                Funding
                Funded by: funder-id http://dx.doi.org/10.13039/501100005981, direktorat jenderal pendidikan tinggi;
                Award ID: 2/E1/KP.PTNBH/2021
                Award Recipient :
                SWI and YA were fully funded by the Ministry of Education, Culture, Research and Technology of the Republic of Indonesia through the PMDSU research scheme with contract number 2/E1/KP.PTNBH/2021. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
                Categories
                Research Article
                Computer and Information Sciences
                Information Theory
                Graph Theory
                Clustering Coefficients
                Physical Sciences
                Mathematics
                Graph Theory
                Clustering Coefficients
                Engineering and Technology
                Management Engineering
                Risk Management
                Insurance
                Physical Sciences
                Mathematics
                Probability Theory
                Markov Models
                Research and Analysis Methods
                Mathematical and Statistical Techniques
                Mathematical Functions
                Exponential Functions
                Medicine and Health Sciences
                Epidemiology
                Medical Risk Factors
                Computer and Information Sciences
                Computer Networks
                Research and analysis methods
                Mathematical and statistical techniques
                Statistical methods
                Monte Carlo method
                Physical sciences
                Mathematics
                Statistics
                Statistical methods
                Monte Carlo method
                Computer and Information Sciences
                Network Analysis
                Custom metadata
                The data that support the findings of this study are publicly available and accessible at an Interactive Scientific Network Data Repository ( https://networkrepository.com/email-enron-only.php) and available at the Supporting information file.

                Uncategorized
                Uncategorized

                Comments

                Comment on this article