Further Results on Large-Scale Complex Logical Networks

In the past few decades, how to reduce the computational complexity of dealing with <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-valued logical networks (LNs) has become a heated research topic. This paper firstly presents a brief survey on the recent efforts of dealing with large-scale LNs, including approximation of LNs, network aggregation approach, and logical matrix factorization technique. Then, by using the network aggregation approach, the stability of large-scale network pairing problem is studied. The network aggregation approach is also used to study probabilistic logical networks (PLNs). Finally, an illustrative example is given to demonstrate the effectiveness of the obtained results.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.