Systemic risk assessment through high order clustering coefficient
نویسندگان
چکیده
منابع مشابه
Analyzing Dynamic Probabilistic Risk Assessment Data through Topology-Based Clustering
We investigate the use of a topology-based clustering technique on the data generated by dynamic event tree methodologies. The clustering technique we utilizes focuses on a domain-partitioning algorithm based on topological structures known as the Morse-Smale complex, which partitions the data points into clusters based on their uniform gradient flow behavior. We perform both end state analysis...
متن کاملSystemic Risk Evaluation of Banks and financial institutions applying Markov clustering method and centrality measures of risk
Systemic risk is the risk beared by an economic system because of a special organization. This means that a liquidity problem or a financial crisis in one company could trigger a chain of reactions that puts the whole market into trouble. This kind of risk was underestimated until 2008 financial crisis. Now federal regulations exist for controlling this risk of financial institutions. Among div...
متن کاملEvolutionary game on networks with high clustering coefficient
Abstract This study investigates the influence of lattice structure in evolutionary games. The snowdrift games is considered in networks with high clustering coefficients, that use four different strategyupdating. Analytical conjectures using pair approximation were compared with the numerical results. Results indicate that general statements asserting that the lattice structure enhances cooper...
متن کاملPublic transport risk assessment through fault tree analysis
This study focused on the public transport risk assessment in District one of Tehran through Fault Tree Analysis involving the three criteria of human, vehicle and road in Haddon matrix. In fact, it examined the factors contributing to the occurrence of road accidents at several urban black spots within District 1. Relying on road safety checklists and survey of experts, this study made an ef...
متن کاملClustering function: another view on clustering coefficient
Assuming that actors u and v have r common neighbors in a social network we are interested in how likely is that u and v are adjacent. This question is addressed by studying the collection of conditional probabilities, denoted cl(r), r = 0, 1, 2, . . . , that two randomly chosen actors of the social network are adjacent, given that they have r common neighbors. The function r → cl(r) describes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2020
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-020-03525-8