Back to results
US 2012/0072475 A1Published application
Measuring "closeness" in a network
OwnerGregory C. Morrison, Lakshminarayanan Mahadevaninventors
Life of this patent
Estimating the term…
Abstract
Closeness between nodes in a weighted network may be measured using an asymmetric generalization of classical Erdös numbers.
Claims21
A method for computing closeness between pairs of nodes of a network, the method comprising:
- storing weights associated with edges of the network in computer memory;
- initializing values of the closeness of the nodes to a designated node and storing the resulting values in the computer memory;
- and
- using a computer processor, updating the resulting closeness value for each node based on the closeness values of the nodes connected thereto and the weights associated with the connecting edges.
1 more element
A system for computing closeness between pairs of nodes of a network, the system comprising:
- (a) computer memory for storing (i) weights associated with edges of the network, and (ii) values of the closeness of the nodes to a designated node;
- and
- (b) a computer processor for (i) initializing the closeness values, and (ii) updating the closeness value for each node based on the closeness values of the nodes connected thereto and the weights associated with the connecting edges.
A computer-readable medium storing computer-executable instructions for computing closeness between nodes in a weighted network, the instructions comprising:
- instructions for initializing values of the closeness of the nodes to a designated node;
- and
- instructions for updating the closeness value for each node based on the closeness values of the nodes connected therewith along edges and weights associated with the connecting edges.
Dependencies are inferred from the claim text.