No edit summary |
mNo edit summary |
||
Line 3: | Line 3: | ||
'''Network analysis''' is the analysis of networks through [[network theory]] (or more generally [[graph theory]]). |
'''Network analysis''' is the analysis of networks through [[network theory]] (or more generally [[graph theory]]). |
||
− | The networks may be real as in a |
+ | The networks may be real as in a social network, or virtual, such as the [[Internet]]. |
Analysis include descriptions of ''structure'', such as [[small-world networks]], [[social-circles network model|social circles]] or [[scale-free networks]], ''optimisation'', such as [[Critical Path Analysis]] and [[PERT]] (Program Evaluation & Review Technique), and properties such as flow assignment. |
Analysis include descriptions of ''structure'', such as [[small-world networks]], [[social-circles network model|social circles]] or [[scale-free networks]], ''optimisation'', such as [[Critical Path Analysis]] and [[PERT]] (Program Evaluation & Review Technique), and properties such as flow assignment. |
Revision as of 23:19, 26 March 2008
Assessment |
Biopsychology |
Comparative |
Cognitive |
Developmental |
Language |
Individual differences |
Personality |
Philosophy |
Social |
Methods |
Statistics |
Clinical |
Educational |
Industrial |
Professional items |
World psychology |
Social psychology: Altruism · Attribution · Attitudes · Conformity · Discrimination · Groups · Interpersonal relations · Obedience · Prejudice · Norms · Perception · Index · Outline
Network analysis is the analysis of networks through network theory (or more generally graph theory).
The networks may be real as in a social network, or virtual, such as the Internet.
Analysis include descriptions of structure, such as small-world networks, social circles or scale-free networks, optimisation, such as Critical Path Analysis and PERT (Program Evaluation & Review Technique), and properties such as flow assignment.
Social network analysis maps relationships between individuals in social networks.
Centrality measures
Information about the relative importance of nodes and edges in a graph can be obtained through centrality measures, widely used in disciplines like sociology. For example, eigenvector centrality uses the eigenvectors of the adjacency matrix to determine nodes that tend to be frequently visited.
Web link analysis
Several Web search ranking algorithms use eigenvector-based centrality metrics, including Google's PageRank, Kleinberg's HITS algorithm, and the TrustRank algorithm.
See also
- pt:Análise de redes
This page uses Creative Commons Licensed content from Wikipedia (view authors). |