CN107800797A - A kind of distributed game centrad method for solving - Google Patents

A kind of distributed game centrad method for solving Download PDF

Info

Publication number
CN107800797A
CN107800797A CN201711069407.XA CN201711069407A CN107800797A CN 107800797 A CN107800797 A CN 107800797A CN 201711069407 A CN201711069407 A CN 201711069407A CN 107800797 A CN107800797 A CN 107800797A
Authority
CN
China
Prior art keywords
node
contribution
centrad
group
game
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201711069407.XA
Other languages
Chinese (zh)
Other versions
CN107800797B (en
Inventor
华强胜
金海�
艾明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huazhong University of Science and Technology
Original Assignee
Huazhong University of Science and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huazhong University of Science and Technology filed Critical Huazhong University of Science and Technology
Priority to CN201711069407.XA priority Critical patent/CN107800797B/en
Publication of CN107800797A publication Critical patent/CN107800797A/en
Application granted granted Critical
Publication of CN107800797B publication Critical patent/CN107800797B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a kind of distributed game centrad method for solving, belong to Parallel and distributed computation field, including：According to the definition of conventional center degree, figure is divided into element θ set；Each node in figure, distribution obtains contribution information of each node to each element, contribution information according to each node to each element, contribution information of all nodes of distributed collection to each element in set, distribution is calculated to each element θ, the set C for the node that one size is k broadcasts contribution informations of the C to element θ to element θ contribution information in figure；The contribution information of group is calculated to the contribution information of each element and to each Node distribution formula according to each node, obtains contribution change of each node to group, and then obtain the game centrad of each node.The present invention substantially reduces the time complexity that centralization solves game centrad, can quickly handle large-scale graph data.

Description

A kind of distributed game centrad method for solving
Technical field
The invention belongs to Parallel and distributed computation field, is solved more particularly, to a kind of distributed game centrad Method.
Background technology
A point or a line in network are provided, determines whether it is more important than other nodes or side in network Have become an emphasis research topic (more positioned at center), it is in fields such as social network analysis, biology, computer science All receive significant attention.Therefore, researchers propose a series of conventional center degree to weigh the important of a point or a line Degree.What is attracted attention now mainly has number of degrees centrad, betweenness center degree, close centers degree and characteristic value centrad.So far, Centralization solves conventional center degree and has been widely studied, and most of conventional center degree can solve in polynomial time.
Recently, by the thought of cooperative game theory, such as Shapley values, more generally Banzhaf indexes, Semivalue It is incorporated into the calculating of conventional center degree, the computational methods for expanding conventional center degree obtain extensive concern.Network based on game The main thought of centrad is the participant being considered as the node in network in cooperative game, and wherein cooperative game is some participations The game that person is carried out in a manner of alliance, cooperation.Under this combination, the contribution segmentation thought in theory of games solution method is just It is introduced in network analysis.Present this method has been subjected to extensive use, such as applies in society and tissue network analysis, Analyzed in bio-networks, and hidden web analysis.Because group's size is arbitrary, therefore the number of all entities reaches finger Several levels, the time complexity for causing to solve game centrad reach exponential, and this is unacceptable in centralization solves.
Researchers have proposed effective method for being solved based on the centrad of theory of games in centralization, Wherein, number of degrees centrad, betweenness center degree and close centers degree based on Shapley values and Semivalue can be more Solved in the item formula time.However, also other many centrad methods are not expanded into the centrad based on theory of games. For this problem, nearest researchers propose a framework so as to a kind of centrad based on cooperative game, no matter it is Based on which kind of theory of games, also or which kind of centrad it is, as long as meeting some requirements, it is possible in polynomial time Solve.
Although the calculating in a kind of polynomial time is proposed to the Research of Solving Method person based on game centrad Framework, but for Large Scale Graphs, this method it is time-consuming too high so that operation seems unacceptable on unit.
The content of the invention
For the disadvantages described above or Improvement requirement of prior art, the invention provides a kind of distributed game centrad to solve Method, its object is to a kind of any game centrad to providing, according to Distributed Calculation rule and characteristic, in distribution The game centrad of each node is solved under environment.It is time-consuming too high that the inventive method solves the problems, such as that centralized algorithm solves, Game centrad can be solved more quickly.
To achieve the above object, the invention provides a kind of distributed game centrad method for solving, including：
S1, according to the definition of conventional center degree, figure is divided into element θ set；
S2, each node in figure, distribution obtain contribution information of each node to each element, contribution information Including positive contribution, negative contribution and without contribution；
S3, the contribution information according to each node to each element, all nodes of distributed collection are to each member in set The contribution information of element, obtain being known as the node set P just contributed to member-1(θ), the node set R of negative contribution is known as to member-1 (θ), to node set N of the element without contribution-1(θ)；
S4, according to node set P-1(θ)、R-1(θ) and N-1(θ), it is k that distribution, which is calculated to each element θ, a size, Node set C to element θ contribution information, contribution informations of the C to element θ is broadcasted in figure so that each section in figure Contribution information of other nodes to all elements known to point；
S5, the contribution of group is calculated to the contribution information of each element and to each Node distribution formula according to each node Information, group obtain contribution change of each node to group, and then obtain to choose the set of k node from other nodes To the game centrad of each node.
Further, conventional center degree is number of degrees centrad, betweenness center degree or close centers degree.
Further, conventional center degree is number of degrees centrad or close centers degree, the specific implementation side of the step S1 Formula is：According to the definition of number of degrees centrad or close centers degree, figure is divided into the set of node, and each node is regarded For an element θ.
Further, conventional center degree is betweenness center degree, and the specific implementation of the step S1 is：According in betweenness The definition of heart degree, figure is divided into element θ set, and each element is a node pair.
Further, step S3 includes：
S3.1, the contribution information according to each node to each element, one breadth First of distributed structure is searched in figure Suo Shu；
S3.2, select root node of the node as BFS tree at random from figure, root node is distributed to be received Collect contribution information of each node to each element；Obtain being known as the node set P just contributed to member-1(θ), negative tribute is known as to member The node set R offered-1(θ), to node set N of the element without contribution-1(θ)。
Further, contribution of each node to group, which becomes, turns to：
When node i to element θ just to contribute, and group is without contribution to element θ, then contribution of the node to group, which becomes, turns to Positive contribution；
When node i to element θ to bear contribution, and group is positive contribution to element θ, then contribution change of the node to group turns to Negative contribution；
When node i to element θ for positive contribution or without contribution, and group is positive contribution to element θ, then tribute of the node to group Offer change and turn to no contribution.
Further, game centrad is：
Wherein, ν is the definition of conventional center degree,For the game centrad of node i, k represents number of nodes, β (k) Represent a function relevant with k sizes, CkGroup of the size as k is represented,Represent CkExpectation, MC (Ck, i) and table Show node i to group CkContribution change, V represent figure interior joint set.
In general, by the contemplated above technical scheme of the present invention compared with prior art, it can obtain down and show Beneficial effect：
(1) present invention firstly provides game centrad is solved under distributed environment；To in a kind of any game for providing Heart degree, according to Distributed Calculation rule and characteristic, the game centrad of each node is solved under distributed environment.This hair Bright to solve the problems, such as that centralized algorithm solution is time-consuming too high, the present invention can solve game centrad more quickly.
(2) distributed solution game centrad method provided by the invention, substantially reduces centralization and solves game centrad Time complexity, can quickly handle large-scale graph data.The designed Distributed Calculation of the present invention can effectively be kept away Exempt from node and send the excessive and caused congestion of message.
Brief description of the drawings
Fig. 1 is a kind of flow chart of distributed game centrad method for solving provided in an embodiment of the present invention；
Fig. 2 is the graph data structure that the embodiment of the present invention 1 provides；
Fig. 3 is the flow chart for the collection contribution information that the embodiment of the present invention 1 provides；
Fig. 4 is the flow chart for one BFS tree of structure that the embodiment of the present invention 1 provides；
Fig. 5 is contribution information of each node of root node distributed collection to each element of the offer of the embodiment of the present invention 1 Flow chart；
Fig. 6 is flow charts of the acquisition C to element θ contribution information of the offer of the embodiment of the present invention 1.
Embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, it is right below in conjunction with drawings and Examples The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and It is not used in the restriction present invention.As long as in addition, technical characteristic involved in each embodiment of invention described below Conflict can is not formed each other to be mutually combined.
As shown in figure 1, the invention provides a kind of distributed game centrad method for solving, including：
S1, according to the definition of conventional center degree, figure is divided into element θ set；Conventional center degree be number of degrees centrad, Betweenness center degree or close centers degree.Conventional center degree is number of degrees centrad or close centers degree, according to number of degrees centrad Or the definition of close centers degree, figure is divided into the set of node, and each node is considered as an element θ.In tradition Heart degree is betweenness center degree, according to the definition of betweenness center degree, figure is divided into element θ set, each element is a section Point pair.
S2, each node in figure, distribution obtain contribution information of each node to each element, contribution information Including positive contribution, negative contribution and without contribution；
S3, the contribution information according to each node to each element, one BFS of distributed structure in figure Tree；Select root node of the node as BFS tree, each node of root node distributed collection at random from figure To the contribution information of each element；Obtain being known as the node set P just contributed to member-1(θ), the set of node of negative contribution is known as to member Close R-1(θ), to node set N of the element without contribution-1(θ)。
S4, according to node set P-1(θ)、R-1(θ) and N-1(θ), it is k that distribution, which is calculated to each element θ, a size, Node set C to element θ contribution information, contribution informations of the C to element θ is broadcasted in figure so that each section in figure Contribution information of other nodes to all elements known to point；
S5, the contribution of group is calculated to the contribution information of each element and to each Node distribution formula according to each node Information, group obtain contribution change of each node to group, Mei Gejie to choose the set of k node from other nodes Contribution of the point to group, which becomes, to be turned to：When node i to element θ just to contribute, and group is without contribution to element θ, then node is to group The contribution of body, which becomes, turns to positive contribution；When node i to element θ to bear contribution, and group is positive contribution to element θ, then node is to rolling into a ball The contribution of body, which becomes, turns to negative contribution；When node i to element θ for positive contribution or without contribution, and group is positive contribution to element θ, then Contribution of the node to group, which becomes, turns to no contribution.And then obtain the game centrad of each node.
Wherein, ν is the definition of conventional center degree,For the game centrad of node i, k represents number of nodes, β (k) Represent a function relevant with k sizes, CkGroup of the size as k is represented,Represent CkExpectation, MC (Ck, i) and table Show node i to group CkContribution change, V represent figure interior joint set.
Embodiment 1
The distributed game centrad method that solves of the invention comprises the following steps：
S1, according to the definition ν of given conventional center degree, definition node i game centrad Wherein, k represents number of nodes, and β (k) represents a function relevant with k sizes, CkGroup of the size as k is represented, Represent CkExpectation, MC (Ck, i) and represent node i to group CkEdge contribution be MC (Ck, i) and=ν (Ck∪i)-ν(Ck).According to The definition of conventional center degree, by scheme G be divided into the individual element θ of h (G) set (for example all paths or all shortest paths, its Middle element is per paths or every shortest path).In this embodiment, we choose number of degrees centrad as conventional center Spend ν.One set C number of degrees centrad refers to that all nodes with this set are connected and the not node in set C Number sum.By taking Fig. 2 as an example, it is assumed that C={ a }, because the number for the node being connected with a points is 2, therefore v (C)=2, it is assumed that C ={ a, b, c }, due to being { a, b, c, d } with all points being connected in set, and { a, b, c } and in set, therefore v (C)= 1.And according to the definition of conventional center degree, figure is divided into the set of node, and each node is considered as an element.
S2, to each node v, distribution obtains its contribution to each element, if node v is positive contribution to element θ, It is designated as P (v, θ) by us, if node v is negative contribution to element θ, R (v, θ) is designated as, if node v is nothing to element θ Contribution, then be designated as N (v, θ).In embodiment, by taking a points as an example, if the element that we choose is a, because the two points are phases It is same, therefore a is negative contribution to a, we obtain R (a, a).If we choose a neighbours b or d as element-specific, because B and d is a neighbours, and we obtain P (a, b) and P (a, d).If we choose c as element-specific, because c is not direct with a Adjacent, c has no effect to a, and we obtain N (a, c).
S3, to each element θ, information that all nodes of distributed collection are contributed it.There to be positive contribution node to it Set is designated as P-1(θ), the set for having negative contribution are designated as R-1(θ), the set of no contribution are designated as N-1(θ)；
As shown in figure 3, step S3 includes following sub-step：
S3.1, according to contribution of each node to h (G) individual element in step S2, provide a specific element, Ke Yishou Collect the contribution of the all-pair element in figure.
S3.2, one BFS tree of distributed structure in figure.As shown in figure 4, this step includes following sub-step Suddenly：
S3.2.1, a node is selected at random as root node.In fig. 2, without loss of generality, a is chosen as root node.
S3.2.2, root node send message to its neighbor node.In fig. 2, a sends a piece of news to its neighbours b, d.
S3.2.3, if not receiving message before the node for receiving message, randomly select one and be sent to it and disappear The node of breath is as its father's node, then the node is the child nodes of its father's node, and the node is sent out to its neighbour Send message.Because b, d did not received message, and only a sends message to b, d, and then b, d are using a as its father Node, meanwhile, b points send message to its neighbours a, c, and d points also send message to its neighbours b, c.
S3.2.4, repeat step S3.2.3 until in figure each node received message.When c is received from b, d Message when, due to not receiving message before c, any in selection b, d point random c is used as its father's node, does not lose Generality, c choose b points as its father's node.C sends message to its neighbours b, d simultaneously.Due to all being received before b, d Message, so far all nodes all received message in figure, and step S3.2.4 terminates.
S3.3, the root node of tree collect contribution of each point to element.The sub-step of the step as shown in Figure 5 is as follows：
S3.3.1, each node v are initialized to a queue on element θ (for P (v, θ), in N (v, θ) or R (v, θ) One kind), when initial queue only preserve its contribution to element θ.Such as point a initialization queue is { R (a, a) }, point b just Beginningization queue is { P (b, a) }, and point c initialization queue is { N (c, a) }, and point d initialization queue is { P (d, a) }.
S3.3.2, each point select a message transmission not being transmitted across to its father's node in queue.In Fig. 1, Without loss of generality, it is assumed that to collect the element to point a, then (P (d, a) is transmitted to it to c by c, father's node b, d for a) being transmitted to it by N Father's node a, b P (b, a) is transmitted to its father's node a.Because a points are root node, a is received after message will not be followed by Resume and broadcast.
S3.3.3, after each node receives message, put it among the queue of its preservation.Then when b receive N (c, When a), N (c, a) is put into the queue that it is preserved to a elements by it.
S3.3.4, repeat S3.3.2 and send message until being needed in figure without node.Due to there is the message N not sent in b (N also (c, can a) be sent to father's node a by c, a), b.
S3.4, all message that it is received of root node broadcast, so that all nodes both know about other each nodes Contribution to the element.A points broadcast all element messages that it is received, due to R known to a points (a, a), P (b, a), P (d, a), with And (c, a), it transmits these information to its child node b, d to N.After d, b receive message, because d is without child node, it is not Message is retransmited, and b points have a child node c, therefore b transmits the message to c again.Because c points are no longer sent out without child node, message Send.So far b, c, d know element of other points to a points.
S3.5, it is known that after contribution of all nodes to an element θ, tributes of the set C to the element can be obtained Offer.When have in set a node to the element for negative contribution when, then the set is to the negative contribution of the element, i.e. R (C, θ) when and only WhenWhen in set all nodes all to the element without contribution when, then the set to the element without contribution, i.e. N (C, θ) and if only ifWhen in set at least one point positive contribution is known as to this yuan and other points all to the element without During contribution, the set is just being contributed the element, i.e. and if only if by P (C, θ)Do not lose general Property, we select a as element-specific, due to known R (a, a), P (b, a), P (d, a), N (c, a), can proper C={ b }, { d }, { b, c }, { d, c }, when { b, d, c }, have P (C, a), as C={ a }, { a, b }, { a, c }, { a, d }, { a, b, c }, a, b, D }, { a, c, d }, when { a, b, c, d }, have R (C, a), as C={ c }, have N (C, a).
S3.6, repeat step S3.2-S3.5 are known that contribution of all nodes to all elements.When a nodes have been collected After a element, it can collect successively to value of all nodes to b, c, d element and broadcast.
S4, the set calculated according to step S3, distribution are calculated to each element θ, the son for the node that a size is k Collect the set of contributions of the C to it.If C possesses k node and has positive contribution to element θ, C set is designated as P#k -1(θ), If negative contribution, then R is designated as#k -1(θ), if without contribution, it is designated as N#k -1(θ).And broadcast all information；
As shown in fig. 6, step S4 includes following sub-step：
S4.1, pass through step S3, it is known that arbitrary node v can be then analyzed when v adds to element θ contribution situation After entering a set C, change that the set is contributed the element.Gather the change to element contribution and be divided into 3 kinds of situations：1st, when Point v is positive contribution to it, and set C to it without contribution, i.e. P (v, θ) ∧ N (C, θ).2nd, when point v is negative contribution to it, and gather C is contributed to be positive it, i.e. R (v, θ) ∧ P (C, θ).3rd, as point v to it for positive contribution or without contribution, and set C is positive tribute to it Offer, i.e. (P (v, θ) ∨ N (v, θ)) ∧ P (C, θ).Without loss of generality, we choose a as element-specific, it is known that as C={ c } When, have N (C, a), and have P (b, a) with P (d, a), then after b or d add C, set C to element a without contributing to element A has positive contribution.As C={ b }, { d }, when { b, d }, it is known to P (C, a) and R (a, a), then after a adds C, set C is to a Negative contribution is changed into from positive contribution.As C={ b }, { d }, when { b, d }, it is known to P (C, a), and have P (b, a), P (d, a), N (c, A), after these points add C, because C is positive contribution originally, positive contribution is remained after addition, but the size gathered occurs Change, therefore contribution margin can also change.
S4.2, k node is randomly selected from all nodes as a set, k is 1 when initial.
S4.3, according to above-mentioned 3 kinds of situations, the element different to each node, using step S3 collect come message, obtain Contribution of the set to the element, so as to obtain MC (Ck, i).
S4.4, make k value subtract 1 from 1 to node number, repeat S4.2-S4.3.
S5, the result calculated according to step S4, each Node distribution formula calculate its game centrad.Due to each point Know contribution of other points to all elements, therefore each node only needs Distributed Calculation to go out when the k node of selection from other points Set contribution margin, afterwards can calculate its game centrad.
As it will be easily appreciated by one skilled in the art that the foregoing is merely illustrative of the preferred embodiments of the present invention, not to The limitation present invention, all any modification, equivalent and improvement made within the spirit and principles of the invention etc., all should be included Within protection scope of the present invention.

Claims (7)

  1. A kind of 1. distributed game centrad method for solving, it is characterised in that including：
    S1, according to the definition of conventional center degree, figure is divided into element θ set；
    S2, each node in figure, distribution obtain contribution information of each node to each element, and contribution information includes Positive contribution, bear contribution and without contribution；
    S3, the contribution information according to each node to each element, all nodes of distributed collection are to each element in set Contribution information, obtain being known as the node set P just contributed to member-1(θ), the node set R of negative contribution is known as to member-1(θ), it is right Node set N of the element without contribution-1(θ)；
    S4, according to node set P-1(θ)、R-1(θ) and N-1(θ), distribution are calculated to each element θ, the section that a size is k The set C of point broadcasts contribution informations of the C to element θ so that each node in figure is to element θ contribution information in figure Know contribution information of other nodes to all elements；
    S5, the contribution for calculating group to the contribution information of each element and to each Node distribution formula according to each node are believed Breath, group obtain contribution change of each node to group, and then obtain to choose the set of k node from other nodes The game centrad of each node.
  2. A kind of 2. distributed game centrad method for solving as claimed in claim 1, it is characterised in that the conventional center degree For number of degrees centrad, betweenness center degree or close centers degree.
  3. A kind of 3. distributed game centrad method for solving as claimed in claim 2, it is characterised in that the conventional center degree For number of degrees centrad or close centers degree, the specific implementation of the step S1 is：According to number of degrees centrad or close The definition of centrad, figure is divided into the set of node, and each node is considered as an element θ.
  4. A kind of 4. distributed game centrad method for solving as claimed in claim 2, it is characterised in that the conventional center degree For betweenness center degree, the specific implementation of the step S1 is：According to the definition of betweenness center degree, figure is divided into element θ Set, each element is a node pair.
  5. A kind of 5. distributed game centrad method for solving as claimed in claim 1 or 2, it is characterised in that the step S3 Including：
    S3.1, the contribution information according to each node to each element, one BFS tree of distributed structure in figure；
    S3.2, selectes root node of the node as BFS tree at random from figure, and root node distributed collection is every Contribution information of the individual node to each element；Obtain being known as the node set P just contributed to member-1(θ), negative contribution is known as to member Node set R-1(θ), to node set N of the element without contribution-1(θ)。
  6. A kind of 6. distributed game centrad method for solving as claimed in claim 1, it is characterised in that each node pair The contribution of group, which becomes, to be turned to：
    When node i to element θ just to contribute, and group is without contribution to element θ, then contribution of the node to group, which becomes, turns to positive tribute Offer；
    When node i to element θ to bear contribution, and group is positive contribution to element θ, then contribution change of the node to group turns to negative tribute Offer；
    When node i to element θ for positive contribution or without contribution, and group is positive contribution to element θ, then contribution of the node to group becomes Turn to no contribution.
  7. 7. a kind of distributed game centrad method for solving as described in claim 1 or 6, it is characterised in that in the game Heart degree is：
    Wherein, ν is the definition of conventional center degree,For the game centrad of node i, k represents number of nodes, and β (k) is represented One function relevant with k sizes, CkGroup of the size as k is represented,Represent CkExpectation, MC (Ck, i) and represent section Point i is to group CkContribution change, V represent figure interior joint set.
CN201711069407.XA 2017-10-31 2017-10-31 A kind of distribution game centrad method for solving Active CN107800797B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711069407.XA CN107800797B (en) 2017-10-31 2017-10-31 A kind of distribution game centrad method for solving

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711069407.XA CN107800797B (en) 2017-10-31 2017-10-31 A kind of distribution game centrad method for solving

Publications (2)

Publication Number Publication Date
CN107800797A true CN107800797A (en) 2018-03-13
CN107800797B CN107800797B (en) 2019-08-30

Family

ID=61549078

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711069407.XA Active CN107800797B (en) 2017-10-31 2017-10-31 A kind of distribution game centrad method for solving

Country Status (1)

Country Link
CN (1) CN107800797B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150278366A1 (en) * 2011-06-03 2015-10-01 Google Inc. Identifying topical entities
CN105007583A (en) * 2015-07-28 2015-10-28 华中科技大学 Energy efficiency improving method based on game playing in heterogeneous cellular network
CN105120468A (en) * 2015-07-13 2015-12-02 华中科技大学 Dynamic wireless network selection method based on evolutionary game theory

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150278366A1 (en) * 2011-06-03 2015-10-01 Google Inc. Identifying topical entities
CN105120468A (en) * 2015-07-13 2015-12-02 华中科技大学 Dynamic wireless network selection method based on evolutionary game theory
CN105007583A (en) * 2015-07-28 2015-10-28 华中科技大学 Energy efficiency improving method based on game playing in heterogeneous cellular network

Also Published As

Publication number Publication date
CN107800797B (en) 2019-08-30

Similar Documents

Publication Publication Date Title
Brown et al. Measuring user influence on twitter using modified k-shell decomposition
CN109063010B (en) Opinion leader mining method based on PageRank
CN103064917B (en) The high-impact customer group of a kind of specific tendency towards microblogging finds method
Hou et al. Identifying all-around nodes for spreading dynamics in complex networks
Wang et al. Algebraic connectivity optimization via link addition
Nguyen et al. Least cost influence in multiplex social networks: Model representation and analysis
CN103530428B (en) A kind of put into practice the colleague of technical ability similarity based on developer and recommend method
Zinoviev et al. A game theoretical approach to modeling information dissemination in social networks
Shah et al. An overview of game theory and its applications in communication networks
Nguyen et al. A data-driven study of influences in Twitter communities
CN107800797B (en) A kind of distribution game centrad method for solving
Hegde et al. Self-organizing flows in social networks
Huang et al. A diversity-dependent measure for discovering influencers in social networks
Agarwal et al. Co-virality of competing content over osns?
CN112256756B (en) Influence discovery method based on ternary association diagram and knowledge representation
Jain et al. Discovering influential users in social network using weighted cumulative centrality
Li et al. Measuring the external influence in information diffusion
CN110278110A (en) A kind of community network immune algorithm based on network high-order structures
CN108596778A (en) A kind of community division method based on space of interest
Takeuchi et al. Public opinion formation with the spiral of silence on complex social networks
CN108256621A (en) Bee colony optimization method and device
Aswath et al. Analysing conflicts in online football communities of reddit
Grabowski et al. MIXING PATTERNS IN A LARGE SOCIAL NETWORK.
Li et al. Key node discovery algorithm based on multiple relationships and multiple features in social networks
Ji et al. Effective spreading from multiple leaders identified by percolation in social networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant