2 citations · 2 across the 4 of their papers we have counts for
Showing math.STShow all
3 papers · 1 filter
math.ST2024
Inferences for Random Graphs Evolved by Clustering Attachment
Natalia Markovich, Maksim Ryzhov, Marijus Vaičiulis
The evolution of random undirected graphs by the clustering attachment (CA) both without node and edge deletion and with uniform node or edge deletion is investigated. Theoretical…
math.ST2024
Investigation of triangle counts in graphs evolved by uniform clustering attachment
N. M. Markovich, M. Vaičiulis
The clustering attachment model introduced in the paper Bagrow and Brockmann (2013) may be used as an evolution tool of random networks. We propose a new clustering attachment mode…
math.ST2015★ 2 cited
Hitting times of threshold exceedances and their distributions
Natalia Markovich
We investigate exceedances of the process over a sufficiently high threshold. The exceedances determine the risk of hazardous events like climate catastrophes, huge insurance claim…