Affiliation:
1. Lomonosov Moscow State University , Kharkevich Institute for Information Transmission Problems of the Russian Academy of Sciences Russia
Abstract
Abstract
For a collection of infinite loaded graphs, random perturbations of special type are considered. It is shown that some known classes of these graphs are stable with respect to small random perturbations of this type, while the rest are not.
Subject
Applied Mathematics,Engineering (miscellaneous),Modeling and Simulation,General Computer Science
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献