Calculating node centralities in large networks and graphs
US9262380B2 · kind B2 · utility
3Cited by
0References
6Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | May 22, 2013 |
| Grant date | Feb 16, 2016 |
| Priority date | — |
| Expiry date | Jan 31, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F17/10
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Embodiments related to calculating node centralities in large and complex networks and graphs. An aspect includes approximating a product of a matrix exponential and a random probe vector of an adjacency matrix, wherein the adjacency matrix represents a graph. A diagonal of the adjacency matrix is computed based on the product of the matrix exponential and the random probe vector. The node centralities are then calculated based on the computed diagonal until a designated number of central nodes has been detected according to embodiments.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.