|
This article is cited in 5 scientific papers (total in 5 papers)
Large Systems
On stability of the independence number of a certain distance graph
P. A. Ogaroka, A. M. Raigorodskiibcdeaf a Moscow Institute of Physics and Technology (State University), Moscow, Russia
b Phystech School of Applied Mathematics and Informatics,
Moscow Institute of Physics and Technology (State University), Moscow, Russia
c Institute of Mathematics and Computer Science, Buryat State University, Ulan-Ude, Russia
d Caucasus Mathematical Center, Adyghe State University, Maykop, Republic of Adygea, Russia
e Department of Mathematical Statistics and Random Processes,
Faculty of Mechanics and Mathematics,
Lomonosov Moscow State University, Moscow, Russia
f Laboratory of Advanced Combinatorics and Network Applications,
Moscow Institute of Physics and Technology (State University), Moscow, Russia
Abstract:
We study the asymptotic behavior of the independence number of a random subgraph of a certain $(r,s)$-distance graph. We provide upper and lower bounds for the critical edge survival probability under which a phase transition occurs, i.e., large new independent sets appear in the subgraph, which did not exist in the original graph.
Keywords:
random graph, distance graph, independence number.
Received: 09.03.2020 Revised: 29.10.2020 Accepted: 29.10.2020
Citation:
P. A. Ogarok, A. M. Raigorodskii, “On stability of the independence number of a certain distance graph”, Probl. Peredachi Inf., 56:4 (2020), 50–63; Problems Inform. Transmission, 56:4 (2020), 345–357
Linking options:
https://www.mathnet.ru/eng/ppi2328 https://www.mathnet.ru/eng/ppi/v56/i4/p50
|
Statistics & downloads: |
Abstract page: | 158 | Full-text PDF : | 17 | References: | 29 | First page: | 15 |
|