Detection Implicit Links and G-betweenness
classification
❄️ cond-mat.dis-nn
physics.soc-ph
keywords
allowsbeenimplicitlinksnodesbetweennesscharacteristicscohesion
read the original abstract
A concept of implicit links for Complex Networks has been defined and a new value - cohesion factor, which allows to evaluate numerically the presence of such connection between any two nodes, has been introduced. We introduce a generalization of such characteristics as the betweenness, which allows to rank network nodes in more details. The effectiveness of the proposed concepts is shown by the numerical examples.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.