Zobrazeno 1 - 10
of 21
pro vyhledávání: '"E. B. Yudin"'
Publikováno v:
Омский научный вестник, Vol 4 (160), Pp 156-160 (2018)
Methods for calculating final distributions of vertex degrees in growing graphs with a nonlinear rule of preferred binding are developed. The problem of calculation errors control is solved. Formulas for determining the key properties of calculate
Externí odkaz:
https://doaj.org/article/3db79b8ffedd4d8b97bc4ceda3fc6512
Publikováno v:
Applied Mathematics and Fundamental Informatics. 5:031-044
Publikováno v:
Omsk Scientific Bulletin. :156-160
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 investigated. The sizes of the investigated networks are hundreds of thousa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::233c812f47f76156ec9b1b6ec83027e2
http://arxiv.org/abs/1904.02483
http://arxiv.org/abs/1904.02483
Autor:
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 random graphs following the nonlinear preferential attachment rule and take
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb41fdd256e27b29aec4845f606e7bfd
Autor:
V. N. Zadorozhnyi, E. B. Yudin
Publikováno v:
2018 Dynamics of Systems, Mechanisms and Machines (Dynamics).
Two classes of graphs are considered in the article: preferential attachment graphs with linear weight function and hybrid model of Jackson-Rogers graphs. The research is carried out to find such graphs whose vertex degree distributions have power-la
Analysis of Vertex Degree Distributions in Preferential Attachment Graphs with Power Weight Function
Autor:
E. B. Yudin, V. N. Zadorozhnyi
Publikováno v:
2018 Dynamics of Systems, Mechanisms and Machines (Dynamics).
Preferential attachment graphs with power weight function are considered in the paper. The dependence of vertex degree distributions in the graphs on the weight function parameter is analyzed. The purpose of the analysis is to identify such ranges of
Publikováno v:
2018 Moscow Workshop on Electronic and Networking Technologies (MWENT).
For growing graphs of preferential attachment that lose arcs continuously the problem of calculating the two-dimensional arcs (edges) degrees distribution is solved. The application of the developed methods for calculating graphs with arcs losses all
Autor:
V. N. Zadorozhnyi, E. B. Yudin
Publikováno v:
Physica A: Statistical Mechanics and its Applications. 428:111-132
We investigate the preferential attachment graphs proceeding from the following two assumptions. The first one: the probability that a new vertex connects to a vertex i is proportional to an arbitrary nonnegative function f of a vertex degree k . The
Publikováno v:
2017 Dynamics of Systems, Mechanisms and Machines (Dynamics).
A new class of graphs is introduced in preferential attachment random graphs theory, these graphs are grown by adding an infinite number of complex stochastic increments, consisting of several interconnected vertices. The problems of final degree dis