Large sparse complex network topology analysis and simplification method based on polygon coefficients
A complex network and topology analysis technology, applied in the field of network topology analysis and simplification, can solve problems such as unrecognizable differences in network topology
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0045] Computer communication wide area network usually has complex node sparse structure, but the scale and density of the local ring structure of the network determine the main topological characteristics of the network. Since the existing network analysis indicators cannot describe this characteristic, a polygonal coefficient is designed. By calculating The ratio of the number of nodes contained in all non-nested polygons in the network to the total number of nodes in the network describes the scale and density of the ring structure in the network.
[0046] A large sparse complex network topology analysis and simplification method based on polygonal coefficients, comprising the following steps:
[0047] 1) Definition of network polygon coefficient: given a network, the network topology is abstracted into an undirected graph G(V,E), where V represents the node set of the network, |V| represents the total number of nodes contained in the network, E represents the link set of ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



