1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.SI2019
Mixed Random Sampling of Frames method for counting number of motifs
M. N. Yudina, V. N. Zadorozhnyi, E. B. Yudin
The problem of calculating the frequencies of network motifs on three and four nodes in large networks is considered. Telecommunications networks, cell molecular networks are inves…
cs.SI2019★ 1 cited
The investigation of social networks based on multi-component random graphs
V. N. Zadorozhnyi, E. B. Yudin
The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the…
math.PR2019
Vertex degree distribution and arc endpoints degree distribution of graphs with a linear rule of preferential attachment and Pennock graphs
V. N. Zadorozhnyi, E. B. Yudin
The article deals with two classes of growing random graphs following the preferential attachment rule with a linear weight function, L-graphs, and hybrid Pennock graphs. We determ…