1 citations · 1 across the 2 of their papers we have counts for
4 papers
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…
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…
Growing graphs with addition of communities
E. B. Yudin
Paper proposes a model of large networks based on a random preferential attachment graph with addition of complete subgraphs (cliques). The proposed model refers to models of rando…
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…