TY - GEN
T1 - Information Spreading in Non-homogeneous Evolving Networks with Node and Edge Deletion
AU - Markovich, Natalia M.
AU - Ryzhov, Maksim S.
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
PY - 2024/1/1
Y1 - 2024/1/1
N2 - A preferential attachment (PA) has been suggested to model network evolution and to explain conjectured power-law node degree distributions in real-world networks. In Markovich, Ryzhov (2022a,b), the schemes of the linear PA proposed in Wan et al. (2020) for the network evolution were suggested for information spreading. The PA and the well-known algorithm SPREAD proposed in Mosk-Aoyama, Shah (2006) were compared regarding the minimum number of evolution steps K∗ required to spread a single message among a fixed number of nodes in non-homogeneous directed networks. This comparison was done in Markovich, Ryzhov (2022a,b) without node and edge deletion during the evolution. The objective of the current study is to investigate the impact of the PA parameters on spreading of a single message to a fixed number of nodes in the graph when an existing node or edge is uniformly deleted at each step of the PA evolution. The results are provided for simulated and real graphs.
AB - A preferential attachment (PA) has been suggested to model network evolution and to explain conjectured power-law node degree distributions in real-world networks. In Markovich, Ryzhov (2022a,b), the schemes of the linear PA proposed in Wan et al. (2020) for the network evolution were suggested for information spreading. The PA and the well-known algorithm SPREAD proposed in Mosk-Aoyama, Shah (2006) were compared regarding the minimum number of evolution steps K∗ required to spread a single message among a fixed number of nodes in non-homogeneous directed networks. This comparison was done in Markovich, Ryzhov (2022a,b) without node and edge deletion during the evolution. The objective of the current study is to investigate the impact of the PA parameters on spreading of a single message to a fixed number of nodes in the graph when an existing node or edge is uniformly deleted at each step of the PA evolution. The results are provided for simulated and real graphs.
KW - SPREAD algorithm
KW - information spreading
KW - linear preferential attachment
KW - node and edge deletion
KW - non-homogeneous evolving network
UR - https://www.scopus.com/pages/publications/85189542621
U2 - 10.1007/978-3-031-50482-2_10
DO - 10.1007/978-3-031-50482-2_10
M3 - Conference contribution
AN - SCOPUS:85189542621
SN - 9783031504815
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 119
EP - 128
BT - Distributed Computer and Communication Networks
A2 - Vishnevskiy, Vladimir M.
A2 - Kozyrev, Dmitry V.
A2 - Samouylov, Konstantin E.
A2 - Kozyrev, Dmitry V.
PB - Springer Science and Business Media Deutschland GmbH
T2 - 26th International Conference on Distributed Computer and Communication Networks: Control, Computation, Communications, DCCN 2023
Y2 - 25 September 2023 through 29 September 2023
ER -