The composition of higher-order graphs reflecting linear relationships between variables is treated analytically. A path formalism is presented to deal with difficulties in graph theory. It is demonstrated how individual contributions to variable relationships can be tallied and represented by ordinals in a composed graph. The method allows for partial information extraction and provides an alternative to the traditional graph approach. An investigation of higher-order graphs as a powerful tool for developing algorithms for SoS, IoT, quantum communications, neuronal network models, and multiple interferometric devices is also presented.
Author(S) Details
Eusebio Bernabeu
Universidad Complutense de Madrid, Ciudad Universitaria. 28040 Madrid, Spain.
Hala Kamal
Department of Physics, Faculty of Science, Ain Shams University. 1156 Cairo, Egypt.
Alicia Larena
Universidad Politécnica de Madrid, ETSII. 28006 Madrid, Spain.
View Book:- https://stm.bookpi.org/RAMRCS-V5/article/view/4969
No comments:
Post a Comment