In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAIвЂ™16), pp. Zhiyuli, A., Liang, X., Zhou, X.: Learning structural features of nodes in large-scale networks for link prediction. Yuan, L., Yu, Z., Luo, W., et al.: Multidimensional-unified topological relations computation: a hierarchical geometric algebra-based approach. Yuan, L., Yu, Z., Luo, W., et al.: Clifford algebra method for network expression, computation, and algorithm construction. Yuan, L., Zhao, Y., Luo, W., et al.: Geometric algebra for multidimension-unified geographical information system. Yu, Z., Li, D., Zhu, S., et al.: Multisource multisink optimal evacuation routing with dynamic network changes: a geometric algebra approach. Yu, Z., Wang, J., Luo, W., et al.: A dynamic evacuation simulation framework based on geometric algebra. Yu, Z., Luo, W., Yuan, L., et al.: Geometric algebra model for geometry-oriented topological relation computation. PhD thesis, UniversitГ¤t Karlsruhe (TH), FakultГ¤t fГјr Informatik (2005) Willhalm, T.: Engineering Shortest Path and Layout Algorithms for Large Graphs.

Thorup, M.: Integer priority queues with decrease key in constant time and the single source shortest paths problem. Song, Q., Wang, X.: Efficient Routing on Large Road Networks Using Hierarchical Communities. In: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (Proceeding ASONAM вЂ™13), pp. Sims, B.H., Sinitsyn, N., Eidenbenz, S.J.: Visualization and modeling of structural features of a large organizational email network. In: Revised Papers From the, International Workshop on Algorithm Engineering and Experiments. Schulz, F., Wagner, D., Zaroliagis, C.: Using Multi-level Graphs for Timetable Information in Railway Systems. Lecture Notes in Computer Science, vol 4525, pp. Schultes, D., Sanders, P.: Dynamic highway-node routing. Schott, R., Staples, S.: Cycles and components in geometric graphs: adjacency operator approach. Lecture Notes in Computer Science, vol 3669, pp. Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. Quaglia, A., Sarup, B., Sin, G., et al.: Design of a generic and flexible data structure for efficient formulation of large scale network problems. Papachristodoulou, A., Li, L., Doyle, J.C.: Methodological frameworks for large-scale network analysis and design. Luo, W., Hu, Y., Yu, Z., et al.: A hierarchical representation and computation scheme of arbitrary-dimensional geometrical primitives based on CGA. Jagadeesh, G.R., Srikanthan, T., Quek, K.H.: Heuristic techniques for accelerating hierarchical routing on road networks. Huang, P., Pi, Y.: An improved location service scheme in urban environments with the combination of GPS and mobile stations. Holzer, M., Schulz, F., Wagner, D.: Engineering multilevel overlay graphs for shortest-path queries. Geisberger, R., Sanders, P., Schultes, D., et al.: Exact routing in large road networks using contraction hierarchies. Lecture Notes in Computer Science, vol 5038, pp. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks.

In: Global Communications Conference (GLOBECOM), pp. Clifford Algebras 1вЂ“19 (2017)Д¬ruz-SГЎnchez, H., Staples, G.S., Schott, R., et al.: Operator calculus approach to minimal paths: Precomputed routing in a store and forward satellite constellation. A case study is used to show how GA is used to realize the hierarchical network representation and the result indicates that GA can provide an appropriate mathematical foundation for hierarchical network representation.Д«reuils, S., Nozick, V., Fuchs, L.: a geometric algebra implementation using binary tree. Within a subspace or between different subspaces, the topological relation between different basis vectors is defined to connect different subspaces and the complete multi-level network can be formed according to these topological relations in subspaces of different level. Then these network nodes are coded with basis vectors and the subspace in GA is utilized to represent these nodes of component.

In this paper, we give a new definition of hierarchical network representation, in which the network nodes are divided into several independent components and multi-level network is constructed based on it. To solve this problem, a hierarchical network representation model based on geometric algebra (GA) subspace is proposed. Most hierarchical representation methods are designed from engineering perspectives, lacking an appropriate mathematical foundation to integrate different problem definitions.

Subspace definition algebra