A Definition of Structure Hole and Algorithms

DOI

10.2991/aiie-16.2016.27How to use a DOI?

Keywords

component; Structure hole; fixed point; interated algorithm and descending algorithm

Abstract

In this paper we only use graph's structural information to generate other information in order to get the structural hole. Our work firstly delivers a formula well defines the structural hole, gives an iterative algorithm and a descending algorithm to find solution. The definition combines the advantages of constraint method and two neighbors' algorithm, and avoid their disadvantages. Roughly speaking, the definition that determines the tie's weight that includes global information and uses local parameters to avoid confusion between opinion leaders. For the reason that nodes' and edges' weight are loop definition, the fixed point of the loop is the optimal solution. We design two algorithms to find the solution, analysis their convergence, correctness. The chosen of the initial point in iteration algorithm cases its divergence. The random steepest algorithm has a good property that it converges at any case although with a slow convergence rate. The new point in this paper is that we deliver an new definition and the corresponding method

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Tianji Zhao
PY  - 2016/11
DA  - 2016/11
TI  - A Definition of Structure Hole and Algorithms
BT  - Proceedings of the 2016 2nd International Conference on Artificial Intelligence and Industrial Engineering (AIIE 2016)
PB  - Atlantis Press
SP  - 110
EP  - 113
SN  - 1951-6851
UR  - https://doi.org/10.2991/aiie-16.2016.27
DO  - 10.2991/aiie-16.2016.27
ID  - Zhao2016/11
ER  -