Directed Graph Analysis Algorithm

A Directed Graph Analysis Algorithm is a graph analysis algorithm that can be implemented by a directed graph analysis system to solve a directed graph analysis task.

• AKA: Link Analysis Method.
• Context:
  • It can be a Domain Dependent Algorithm, such as a Social Network Analysis Algorithm.
  • …
• Example(s):
  • HITS Algorithm.
  • PageRank Algorithm.
  • any Social Network Analysis Algorithm.
  • any Citation Network Analysis Algorithm.
  • any Protein Interaction Network Analysis Algorithm.
  • …
• Counter-Example(s):
  • an Undirected Graph Analysis Algorithm.
• See: Link Analysis System.

---

---

References

2009

• http://en.wikipedia.org/wiki/Network_theory
  • Network theory is an area of computer science and network science and part of graph theory. It has application in many disciplines including particle physics, computer science, biology, economics, operations research, and sociology. Network theory concerns itself with the study of graphs as a representation of either symmetric relations or, more generally, of asymmetric relations between discrete objects. Applications of network theory include logistical networks, the World Wide Web, gene regulatory networks, metabolic networks, social networks, epistemological networks, etc.
• http://en.wikipedia.org/wiki/List_of_network_theory_topics

2001

• (Ng et al., 2001) ⇒ Andrew Y. Ng, Alice X. Zheng, and Michael I. Jordan. (2001). “Stable Algorithms for Link Analysis.” In: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR 2001). doi:10.1145/383952.384003
  • QUOTE: The Kleinberg HITS and the Google PageRank algorithms are eigenvector methods for identifying “authoritative or “influential articles, given hyperlink or citation information.

---