Affiliation:
1. Department of Mathematics and Statistics, Texas Tech University, 1108 Memorial Circle, Lubbock, TX 79409, USA
Abstract
Canonical ensembles of walks in a finite connected graph assign the properly normalized probability distributions to all nodes, subgraphs, and nodal subsets of the graph at all time and connectivity scales of the diffusion process. The probabilistic description of graphs allows for introducing the quantitative measures of navigability through the graph, walkability of individual paths, and mutual perspicacity of the different modes of the (diffusion) processes. The application of information theory methods to problems about graphs, in contrast to geometric, combinatoric, algorithmic, and algebraic approaches, can be called information graph theory. As it involves evaluating communication efficiency between individual systems’ units at different time and connectivity scales, information graph theory is in demand for a wide range of applications, such as designing network-on-chip architecture and engineering urban morphology within the concept of the smart city.
Reference52 articles.
1. Johnson, J. (2014). Hypernetworks in the Science of Complex Systems, Imperial College Press.
2. Design and analysis of application specific network on chip for reliable custom topology;Venkataraman;Comput. Netw.,2019
3. A Review Of Design Approaches For Enhancing The Performance of Nocs at Communication Centric Level;Manzoor;Scalable Comput. Pract. Exp.,2021
4. Alimi, I.A., Patel, R.K., Aboderin, O., Abdalla, A.M., Gbadamosi, R.A., Muga, N.J., Pinto, A.N., and Teixeira, A.L. (2022). Network-on-Chip-Architecture, Optimization, and Design Explorations, IntechOpen.
5. Saeed, F., Al-Hadhrami, T., Mohammed, F., and Mohammed, E. (2021). Advances on Smart and Soft Computing. Advances in Intelligent Systems and Computing, Springer.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献