Clustering and hitting times of threshold exceedances and applications Online publication date: Tue, 05-Dec-2017
by Natalia Markovich
International Journal of Data Analysis Techniques and Strategies (IJDATS), Vol. 9, No. 4, 2017
Abstract: We investigate exceedances of the process over a sufficiently high threshold. The exceedances determine the risk of hazardous events like climate catastrophes, huge insurance claims, the loss and delay in telecommunication networks. Due to dependence such exceedances tend to occur in clusters. The cluster structure of social networks is caused by dependence (social relationships and interests) between nodes and possibly heavy-tailed distributions of the node degrees. A minimal time to reach a large node determines the first hitting time. We derive an asymptotically equivalent distribution and a limit expectation of the first hitting time to exceed the threshold un as the sample size n tends to infinity. The results can be extended to the second and, generally, to the kth (k > 2) hitting times. Applications in large-scale networks such as social, telecommunication and recommender systems are discussed.
Online publication date: Tue, 05-Dec-2017
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Analysis Techniques and Strategies (IJDATS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com