Name
Abstract | ||
|---|---|---|
Typical analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long history of their successful use. However, modeling of covert, terrorist or criminal networks through social graph dose not really provide the hierarchical structure of such networks because these networks are composed of leaders and followers. It is possible mathematically, for some graphs to estimate the probability that the removal of a certain number of nodes would split the networks into may be non functional network. In this research we investigate and analyze a social network using Bayes probability theory model to calculate entropy of each node present in the network to high light the important actors in the network. This is accomplished by observing the amount of entropy change computed by successively removing each node in the network. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-89900-6_6 | EuroISI |
Keywords | Field | DocType |
bayes theorem,social network,bayes theory,posterior probability,entropy,social network analysis,probability theory,graph theory | Network science,Dynamic network analysis,Computer science,Evolving networks,Centrality,Hierarchical network model,Complex network,Artificial intelligence,Degree distribution,Clustering coefficient | Conference |
Volume | ISSN | Citations |
5376 | 0302-9743 | 4 |
PageRank | References | Authors |
0.51 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dil Muhammad Akbar Hussain | 1 | 48 | 9.16 |
| Daniel Ortiz-Arroyo | 2 | 39 | 6.36 |