Group degree based sorting method and model evolution method for important nodes on complex network

A technology of complex networks and important nodes, applied in the field of complex networks, to achieve the effect of average path length and clustering coefficient performance advantages

Active Publication Date: 2015-11-11
UNIV OF ELECTRONIC SCI & TECH OF CHINA
View PDF4 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Node sorting algorithms based on betweenness, proximity, PageRank, etc. have certain degree preference

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Group degree based sorting method and model evolution method for important nodes on complex network
  • Group degree based sorting method and model evolution method for important nodes on complex network
  • Group degree based sorting method and model evolution method for important nodes on complex network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0023] The specific embodiments of the present invention are described below with reference to the accompanying drawings, so that those skilled in the art can better understand the present invention. It should be noted that, in the following description, when the detailed description of known functions and designs may dilute the main content of the present invention, these descriptions will be omitted here.

[0024] figure 2 It is a flow chart of the method for sorting important nodes of complex networks based on the clique degree of the present invention. like figure 2 As shown, the method for sorting important nodes of a complex network based on the group degree of the present invention includes the following steps:

[0025] S201: Obtain the clique degree of each order of each node of the complex network:

[0026] Get the j-th order clique degree of each node i in the complex network The value range of the node number i is 1≤i≤N, where N represents the number of nodes...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present invention discloses a group degree based sorting method and model evolution method for important nodes on complex network. The method comprises: first, obtaining each order of group degree of each node on a complex network; then calculating each order of overall group degree of the complex network; normalizing each order of overall group degree; calculating a weight of each order of group degree according to a normalization result; finally, each node performing weighting on each order of group degree of the node according to the weight, wherein a result is an importance value of the node; and sorting each node according to the importance value. During model evolution, each time a new node is added, a connecting node of the new node is selected according to the importance values of existing nodes. According to the sorting method and model evolution method provided by the present invention, the importance value of the node is calculated based on the group degree, the obtained node importance sequence is better in line with the actual situation of the network, and the average path length and cluster coefficient property obtained through model evolution both have obvious advantages.

Description

technical field [0001] The invention belongs to the technical field of complex networks, and more particularly, relates to a method for sorting important nodes of complex networks based on clique degree and a method for model evolution. Background technique [0002] In recent years, the research of complex network (Complex Network) has become a hotspot of network research, and more and more disciplines involve the research of complex network, such as biology, economics, sociology and so on. In the research of complex network evolution model, the importance ranking of nodes is also in an increasingly important position. Most of the research on node importance ranking is based on degree, betweenness, and PageRank. Node sorting algorithms based on betweenness, proximity, PageRank, etc. have certain degree preference characteristics or path preference characteristics, which have certain drawbacks in real networks. [0003] In the document "Wei-KeXiao, ZhouT.Empiricalstudyoncliq...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/50
Inventor 徐杰徐俊卞颖孙健
Owner UNIV OF ELECTRONIC SCI & TECH OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap