[PDF][PDF] Topics in Discrete Stochastic Processes on Graphs with Application to Computer Science
N Kang - 2022 - kclpure.kcl.ac.uk
This thesis is devoted to the study of stochastic processes on graphs, which is a system of
random variables that evolve over time while undergoing probability fluctuations according …
random variables that evolve over time while undergoing probability fluctuations according …
A new approach to weakening and destruction of malicious internet networks
M Korenblit - Advances in Soft Computing: 15th Mexican …, 2017 - Springer
Abstract Models and algorithms for weakening and destruction of malicious complex internet
networks are widely studied in AI in recent years. These algorithms must detect critical links …
networks are widely studied in AI in recent years. These algorithms must detect critical links …
One-Max Constant-Probability Networks: Results and Future Work
M Korenblit - International Colloquium on Structural Information and …, 2018 - Springer
In a number of our works we present and use the tree-like network models, so called one-
max constant-probability models characterized by the following newly studied principles:(i) …
max constant-probability models characterized by the following newly studied principles:(i) …