Unlock instant, AI-driven research and patent intelligence for your innovation.

Distributed game centrality solving method

A distributed, betweenness-centered technology, applied in the transmission system, electrical components, etc., can solve the problem of high time-consuming solution, achieve fast solution, fast processing, and solve the effect of high time-consuming solution

Active Publication Date: 2018-03-13
HUAZHONG UNIV OF SCI & TECH
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The method of the invention solves the problem that the centralized algorithm takes too much time to solve, and can solve the game centrality more quickly

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
  • Distributed game centrality solving method
  • Distributed game centrality solving method
  • Distributed game centrality solving method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0045] The method for solving game centrality distributedly of the present invention comprises the following steps:

[0046] S1, according to the given definition of traditional centrality ν, define the game centrality of node i Among them, k represents the number of nodes, β(k) represents a function related to the size of k, C k represents a group of size k, stands for C k expectations, MC(C k , i) represents the node i to the community C k The edge contribution is MC(C k , i)=ν(C k ∪i)-ν(C k ). According to the traditional definition of centrality, the graph G is divided into a set of h(G) elements θ (such as all paths or all shortest paths, where the elements are each path or each shortest path). In this example, we choose degree centrality as the traditional centrality ν. The degree centrality of a set C refers to the sum of the number of nodes connected to the nodes in this set and not in the set C. by figure 2 For example, assuming C={a}, since the number o...

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 invention discloses a distributed game centrality solving method, and belongs to the field of parallel and distributed calculation. The distributed game centrality solving method comprises the steps of dividing a graph into a set of elements [theta] based on the definition of the traditional centrality; solving contribution information of each node for each element in a distributed manner based on each node in the graph, collecting the contribution information of all the nodes for each element in the set in the distributed manner based on the contribution information of each node for eachelement, calculating out the contribution information of a set C with the nodes in the size of k for the elements [theta] in the distributed manner, and broadcasting the contribution information of the C for the elements [theta] in the graph; calculating the contribution information of each node for a team in the distributed manner based on the contribution information of each node for each element so as to obtain contribution change of each node for the team and further obtain the game centrality of each node. The distributed game centrality solving method greatly reduces the time complexityof intensive solution of the game centrality and can process large-scale graph data more quickly.

Description

technical field [0001] The invention belongs to the field of parallel and distributed computing, and more specifically relates to a method for solving distributed game centrality. Background technique [0002] Given a point or an edge in the network, determining whether it is more important (more central) than other nodes or edges in the network has become a key research topic, and it is in the fields of social network analysis, biology, computer science, etc. have received widespread attention. To this end, researchers have proposed a series of traditional centrality to measure the importance of a point or an edge. At present, there are mainly degree centrality, betweenness centrality, closeness centrality and eigenvalue centrality. So far, centralized solutions to traditional centralities have been extensively studied, and most of the traditional centralities can be solved in polynomial time. [0003] Recently, the idea of ​​cooperative game theory, such as Shapley valu...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04L29/08
CPCH04L67/1004H04L67/1097H04L67/60
Inventor 华强胜金海艾明
Owner HUAZHONG UNIV OF SCI & TECH