Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for changing node control category in complex network

A technology of node control and complex network, applied in the network field, it can solve the problems of large number of nodes that cannot be converted into a single node, and achieve the effect of enhancing controllability, reducing conversion cost and high efficiency.

Active Publication Date: 2018-05-08
NORTHEASTERN UNIV
View PDF3 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the above-mentioned methods of adding edges are all aimed at changing the type of the node set in the network, the number of edges to be changed is large, and the type conversion cannot be performed on a single node

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
  • Method for changing node control category in complex network
  • Method for changing node control category in complex network
  • Method for changing node control category in complex network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0088] like Figure 4 As shown, this embodiment provides a method for changing the node control category in a complex network, and the method of this embodiment includes the following steps:

[0089] Step 101 , for the redundant node n to be processed, obtain all unsaturated nodes in the network that can reach the redundant node n through an interleaving path.

[0090] For example, step 101 of this embodiment may include the following sub-steps not shown in the figure:

[0091] 1011. For the redundant node n, obtain all non-matching incoming edges of the redundant node n in the network, and add nodes corresponding to all non-matching incoming edges to the first queue C;

[0092] 1012. Traverse the nodes in the first queue C, and if the traversed nodes belong to unsaturated nodes that have not been visited, then update the unsaturated node set U, the edge set E', and the node set V';

[0093] 1013. If the traversed node has not been visited and is not an unsaturated node, obtai...

Embodiment 2

[0128] For the network (G, M, n), the specific process of the method in this embodiment is as follows:

[0129] Step1: For the redundant node n, let the queue Q=Q+{n}, find the matching incoming edge e(s,n) of n, V'={s}.

[0130] Step2: Take a node v from the queue Q, Q=Q-{v}, its matching incoming edge is e(m,v); find the non-matching incoming edge {e(c1,v,),...,e(ci, v)}, join the queue C=C+{c1,...,ci}.

[0131] Step3: Take a node c that is not s from the queue C, C=C-{c};

[0132] If c has been visited, then E'=E'+{e(m,c)}, turn to Step3;

[0133] If all outgoing edges of c are not in the maximum matching M, then U'=U'+{c}, E'=E'+{e(m,c)}, V'=V'+{c}, go to Step3 .

[0134] Otherwise, find the matching edge e(c,k) of c, let Q=Q+{k}, E'=E'+{e(m,c)}, V'=V'+{c}, c mark is visited. Repeat Step3 until C is empty.

[0135] Step4: Repeat Step2 and Step3 until Q is empty.

[0136] Step5: Add virtual node t, let V'=V'+{t};

[0137] For nodes {u1,u2,…,ui} in U’,

[0138] Add...

Embodiment 3

[0152] In the embodiment of the present invention, in order to illustrate the process of converting redundant nodes into driving node algorithms, this embodiment provides a simple network ( image 3 ) in the transformation process of nodes.

[0153] Step S1, first use the maximum matching HK algorithm to find a maximum matching, image 3 Medium-thick edges represent matching edges, thin edges represent non-matching edges, double-circle nodes represent target nodes, diamond-shaped nodes represent unsaturated nodes, and hexagonal-shaped nodes represent newly added virtual nodes t. Edge weight defaults to 1. For the target node 7, add 7 to the queue Q, and its matching incoming edge is e(3,7), V'={3}, M=3. In this embodiment, the target node is the redundant node 7, and its corresponding node corresponding to the matching incoming edge is denoted as s.

[0154] Step S2, take out node 7 from Q, its matching incoming edge is e(3,7), find all non-matching incoming edges e(1,7), e...

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 provides a method for changing a node control category in a complex network. The method comprises: for a to-be-processed redundant node n, acquiring all unsaturated nodes in thenetwork that can arrive at the redundant node n through a staggered path; constructing a staggered network by taking the redundant node n as the starting point; using the minimum cut algorithm to process the staggered network to obtain a set of minimum edges that requires to be deleted when the redundant node n is disconnected from all the unsaturated nodes on the staggered path; identifying the alternative ring including the redundant node n in the network, and based on the identified alternative ring, determining contiguous edges that are required to destroy the alternative ring; deleting all the contiguous edges in the set of the minimum edges, and deleting the determined contiguous edges that require to be deleted in order to destroy the alternative ring; and selecting one staggered path from the redundant node n, and deleting a matched edge in the selected staggered path, so that the redundant node n is converted into an input node. The method provided by the present invention greatly reduces the conversion cost and has higher efficiency.

Description

technical field [0001] The invention relates to network technology, in particular to a method for changing the control category of nodes in a complex network. Background technique [0002] Many things and their relationships in real life can be modeled as networks, such as interpersonal networks in social systems, scientist collaboration networks, epidemic transmission networks and transportation networks, neuron networks in ecosystems, and gene regulation networks. and protein interaction network and food chain network, telephone network, Internet and World Wide Web in technological systems, etc. The structure and behavior analysis of this increasingly complex network system is the premise of understanding its internal laws. To ensure the normal operation of these systems, it is necessary to study the control of complex networks. For example, in the traffic network, in order to avoid traffic congestion as much as possible, traffic congestion can be slowed down by adding r...

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): G06F11/22G06N3/06G06N3/08
CPCG06F11/2263G06N3/061G06N3/082
Inventor 张锡哲李倩
Owner NORTHEASTERN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com