2 citations · 2 across the 4 of their papers we have counts for
4 papers
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…
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…
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…
Distribution and Dependence of Extremes in Network Sampling Processes
Konstantin Avrachenkov, Natalia M. Markovich, Jithin K. Sreedharan
We explore the dependence structure in the sampled sequence of large networks. We consider randomized algorithms to sample the nodes and study extremal properties in any associated…