Bridging centrality: a concept and formula to identify bridging nodes in scale-free networks
View Patent ↗A method for identifying a bridge node in a network using a processor and memory unit in a specially programmed special purpose-purpose computer including the steps of, for each node in a plurality of nodes in the network: determining a global metric proportional to total traffic flow in the network and through the node; determining a local metric proportional to traffic flow between the node and each second node in the network connected to the node and traffic flow between each second node and each third node in the network connected to a second node; determining a second local metric proportional to the respective traffic flows between each node and each second node; and calculating a respective combination of the global metric and the first and second local metrics; and selecting, a bridge node from among the plurality of nodes based on the respective combinations.
1. A method for identifying a bridge node in a network, comprising the steps of:
determining, for each first node in a plurality of nodes in said network, using a processor in a specially programmed special purpose-purpose computer, a global metric proportional to total signal flow in said network and signal flow through said each first node;
determining, for said each first node using said processor, a first local metric proportional to signal flow between said each first node and each second node in said network connected to said first node and signal flow between said each second node and each third node in said network connected to at least one of said each second node;
determining, for said each first node using said processor, a second local metric proportional to a largest and second largest signal flows from among the respective signal flows between said each first node and said each second node;
calculating, for said each first node using said processor and a memory element in said general-purpose computer, a combination of said global metric and said first and second local metrics; and,
selecting, using said processor and said memory element, a bridge node from among said plurality of nodes based on said combinations.
2. The method of claim 1 wherein said global metric comprises said signal flow through said each first node divided by said total signal flow, wherein a denominator for said first local metric comprises said signal flow between said each first node and each second node, wherein said second local metric comprises said second largest signal flow divided by said largest signal flow, wherein calculating a respective combination comprises calculating a respective product of said global metric and said first and second local metrics for said each first node, and wherein selecting a bridge node comprises selecting said each first node with a highest said respective product.
3. A method for identifying a bridge node in a network, comprising the steps of:
determining, for each first node in a plurality of nodes in said network, using a processor in a specially programmed special purpose-purpose computer, a global metric proportional to total signal flow in said network and signal flow through said each first node;
determining, for said each first node using said processor, a local metric proportional to signal flow between said each first node and each second node in said network connected to said each first node;
calculating, for said each first node using said processor and a memory element in said general-purpose computer, a combination of said global metric and said local metric; and,
selecting, using said processor and said memory element, a bridge node from among said plurality of nodes based on said combinations.
4. The method of claim 3 wherein determining a local metric comprises:
determining, for said each first node using said processor, a first local sub-metric proportional to said signal flow between said each first node and said each second node and signal flow between said each second node and each third node in said network connected to at least one of said each second node; and,
determining, for said each first node using said processor, a second local sub-metric proportional to the largest and second largest signal flows from among the respective signal flows between said each first node and said each second node.
5. The method of claim 4 wherein said global metric comprises said signal flow through said each first node divided by said total signal flow, wherein a denominator for said first local sub-metric comprises said signal flow between said each first node and each second node, wherein said second local metric is equal to said second largest signal flow divided by said largest signal flow, wherein calculating a respective combination comprises calculating a respective product of said global metric and said first and second local sub-metrics for said each first node, and wherein selecting a bridge node comprises selecting said each first node with a highest said respective product.
6. A method for identifying a bridge node in a network, comprising the steps of:
determining, for each first node in a plurality of nodes in said network, using a processor in a specially programmed special purpose-purpose computer, a global metric proportional to a total number of paths connecting node pairs in said network and a total number of said paths connected to said each first node;
determining, for said each first node using said processor, a local metric proportional to signal flow between said each first node and each second node in said network connected to said each first node;
calculating, for said each first node using said processor and a memory element in said general-purpose computer, a combination of said global metric and said local metric; and,
selecting, using said processor and said memory element, a bridge node from among said plurality of nodes based on said combinations.
7. The method of claim 6 wherein determining a local metric comprises:
determining, for said each first node using said processor, a first local sub-metric proportional to said signal flow between said each first node and said each second node and signal flow between said each second node and each third node in said network connected to at least one of said each second node; and,
determining, for said each first node using said processor, a second local sub-metric proportional to the largest and second largest signal flows from among the respective signal flows between said each first node and said each second node.
8. The method of claim 7 wherein said global metric comprises said total number of said paths connected to said each first node divided by said total number of paths connecting node pairs in said network, wherein a denominator for said first local sub-metric comprises said signal flow between said each first node and each second node, wherein said second local metric is equal to said second largest signal flow divided by said largest signal flow, wherein calculating a respective combination comprises calculating a respective product of said global metric and said first and second local sub-metrics for said each first node, and wherein selecting a bridge node comprises selecting said each first node with a highest said respective product.
9. An apparatus for identifying a bridge node in a network, comprising:
a first determining element in a processor in a specially programmed special purpose-purpose computer arranged, for each first node in a plurality of nodes in said network, to determine a global metric proportional to total signal flow in said network and signal flow through said each first node;
a second determining element in said processor arranged to determine, for said each first node, a first local metric proportional to signal flow between said each first node and each second node in said network connected to said first node and signal flow between said each second node and each third node in said network connected to at least one of said each second node;
a third determining element in said processor arranged to determine, for said each first node, a second local metric proportional to a largest and second largest signal flows from among the respective signal flows between said each first node and said each second node;
a calculating element in said processor arranged to calculate, for said each first node, using a memory element in said general-purpose computer, a combination of said global metric and said first and second local metrics; and,
a selecting element in said processor arranged to select, using said memory element, a bridge node from among said plurality of nodes based on said combinations.
10. The apparatus of claim 9 wherein said global metric comprises said signal flow through said each first node divided by said total signal flow, wherein a denominator for said first local metric comprises said signal flow between said each first node and each second node, wherein said second local metric comprises said second largest signal flow divided by said largest signal flow, wherein said calculating element is arranged to calculate a respective product of said global metric and said first and second local metrics for said each first node, and wherein said selecting element is arranged to select said each first node with a highest said respective product.
11. An apparatus for identifying a bridge node in a network, comprising:
a first determining element in a processor in a specially programmed general-computer arranged, for each first node in a plurality of nodes in said network, to determine a global metric proportional to total signal flow in said network and signal flow through said each first node;
a second determining element in said processor arranged to determine, for said each first node, a local metric proportional to signal flow between said each first node and each second node in said network connected to said each first node;
a calculating element in said processor arranged to calculate, for said each first node, using a memory element in said general-purpose computer, a combination of said global metric and said local metric for said each first node; and,
a selecting element in said processor arranged to select, using said memory element, a bridge node from among said plurality of nodes based on said combinations.
12. The apparatus of claim 11 wherein said second determining element is arranged to:
determine, for said each first node using said processor, a first local sub-metric proportional to said signal flow between said each first node and said each second node and signal flow between said each second node and each third node in said network connected to at least one of said each second node; and,
determine, for said each first node using said processor, a second local sub-metric proportional to the largest and second largest signal flows from among the respective signal flows between said each first node and said each second node.
13. The apparatus of claim 12 wherein said global metric comprises said signal flow through said each first node divided by said total signal flow, wherein a denominator for said first local sub-metric comprises said signal flow between said each first node and each second node, wherein said second local metric comprises said second largest signal flow divided by said largest signal flow, wherein said calculating element is arranged to calculate a respective product of said global metric and said first and second local sub-metrics for said each first node, and wherein said selecting element is arranged to select said each first node with a highest said respective product.
14. An apparatus for identifying a bridge node in a network, comprising:
a first determining element in a processor for a specially programmed special purpose-purpose computer arranged, for each first node in a plurality of nodes in said network, to determine a global metric proportional to a total number of paths connecting node pairs in said network and a total number of said paths connected to said each first node;
a second determining element in said processor arranged to determine, for said each first node, a local metric proportional to signal flow between said each first node and each second node in said network connected to said each first node;
a calculating element in said processor arranged to calculate, for said each first node using a memory element in said general-purpose computer, a combination of said global metric and said local metric for said each first node; and,
a selecting element in said processor arranged to select, using said memory element, a bridge node from among said plurality of nodes based on said combinations.
15. The apparatus of claim 14 wherein said second determining element is arranged to:
determine, for said each first node using said processor, a first local sub-metric proportional to said signal flow between said each first node and said each second node and signal flow between said each second node and each third node in said network connected to at least one of said each second node; and,
determine, for said each first node using said processor, a second local sub-metric proportional to the largest and second largest signal flows from among the respective signal flows between said each first node and said each second node.
16. The apparatus of claim 15 wherein said global metric comprises said signal flow through said each first node divided by said total signal flow, wherein a denominator for said first local sub-metric comprises said signal flow between said each first node and each second node, wherein said second local metric comprises said second largest signal flow divided by said largest signal flow, wherein said calculating element is arranged to calculate a respective product of said global metric and said first and second local sub-metrics for said each first node, and wherein said selecting element is arranged to select said each first node with a highest said respective product.