Larysa Chala

Mrs. Larysa Chala

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 December 2016 in Eastern-European Journal of Enterprise Technologies
Verified
Journal Article
Open access
PDF file
PLPetro Lizunov
Petro Lizunov
ABAndrii Biloshchytskyi
Andrii Biloshchytskyi
AKAlexander Kuchansky
Alexander Kuchansky
SBSvitlana Biloshchytska
Svitlana Biloshchytska
Larysa ChalaLarysa Chala
Larysa Chala
Detection of near dublicates in tables based on the locality-sensitive hashing method and the nearest neighbor method

21 June 2020
Verified
Book Chapter
Closed access
PDF file
Vadim SherginVadim Shergin
Vadim Shergin
SUSerhii Udovenko
Serhii Udovenko
Larysa ChalaLarysa Chala
Larysa Chala

1 February 2018
Verified
Conference Paper
Closed access
VSV. L. Shergin
V. L. Shergin
Larysa ChalaLarysa Chala
Larysa Chala
СУСергій Удовенко
Сергій Удовенко
The definition of fractal dimension of infinite growing sets is presented. It is based on a box-counting approach and coincides with the elasticity coefficient for number of boxes as function to the window length size. The finite difference forms of this dimension are proposed. They are applicable to infinite growing discrete sets, such as scale-free networks. The scale-free network model having strict constant fractal dimension is constructed. Those networks are discrete exactly self-similar sets. Applying the concept of non-unit fractal dimension of scale-free networks, i.e. the concept of different relative growth rates for edges and vertices, makes it possible to generate scale-free models for dense networks.

27 December 2024 in Eastern-European Journal of Enterprise Technologies
Verified
Journal Article
Open access
VSVadim Shergin
Vadim Shergin
SGSergiy Grinyov
Sergiy Grinyov
Larysa ChalaLarysa Chala
Larysa Chala
СУСергій Удовенко
Сергій Удовенко
The object of this study is complex networks whose model is undirected weighted ordinary (without loops and multiple edges) graphs. The task to detect communities, that is, partition the set of network nodes into communities, has been considered. It is assumed that such communities should be non-overlapped. At present, there are many approaches to solving this task and, accordingly, many methods that implement it. Methods based on the maximization of the network modularity function have been considered. A modified modularity criterion (function) has been proposed. The value of this criterion explicitly depends on the number of nodes in the communities. The partition of network nodes into communities with maximization by such a criterion is significantly more prone to the detection of small communities, or even singleton-node communities. This property is a key characteristic of the proposed method and is useful if the network being analyzed really has small communities. In addition, the proposed modularity criterion is normalized with respect to the current number of communities. This makes it possible to compare the modularity of network partitions into different numbers of communities. This, in turn, makes it possible to estimate the number of communities that are formed, in cases when this number is not known a priori. A method for partitioning network nodes into communities based on the criterion of maximum modularity has been devised. The corresponding algorithm is suboptimal, belongs to the class of greedy algorithms, and has a low computational complexity – linear with respect to the number of network nodes. As a result, it is fast, so it can be used for network partitioning. The method devised for detecting network communities was tested on classic datasets, which confirmed the effectiveness of the proposed approach

1 October 2017
Verified
Conference Paper
Closed access
VSVadim Shergin
Vadim Shergin
Larysa ChalaLarysa Chala
Larysa Chala
The concept of elasticity of graphs is presented. Elasticity factor is a scale-free measure of graph density. Scale-free networks model with elasticity factor is proposed. Applying the concept of elasticity, i.e. the concept of different relative growth rates for links and nodes, makes it possible to generate scale-free models for dense networks. Also, the low bound of scaling factor domain of scale-free models is much lower when non-unit elasticity used. This feature expands the scope of scale-free models for networks having Zip's distribution of nodes degree.

1 August 2020
Verified
Conference Paper
Closed access
VSVadim Shergin
Vadim Shergin
Larysa ChalaLarysa Chala
Larysa Chala
SUSerhii Udovenko
Serhii Udovenko
MPMariya Pogurskaya
Mariya Pogurskaya
The problem of modeling scale-free networks is considered. Mediation-driven attachment rule with nonconstant number of added links is proposed. Applying the copy-factor as the control parameter instead of traditionally used number of incoming links makes it possible to generate networks model, which combines the key benefits of mediation- driven attachment, such as indirect using the nodes degree, and elasticity, such as different relative growth rates for links and nodes. The properties of proposed networks model were studied analytically and confirmed by simulation results.