This chapter provides all necessary definitions to understand network analytic methods. This chapter can be used as a glossary whenever a term is unclear in the main text; as the readership is intended to be very diverse, here all necessary definitions are discussed in detail. It may thus be skipped upon first reading and referred to if basic notions are unfamiliar for the reader.
KeywordsMarkov Chain Bipartite Graph Directed Graph Adjacency Matrix Degree Distribution
- 2.Berger A, Müller-Hannemann M (2010) Uniform sampling of undirected and directed graphs with a fixed degree sequence. In: Proceedings of the 36th international workshop on graph-theoretic concepts in computer scienceGoogle Scholar
- 4.Brandes U, Erlebach T (eds) (2005) Network analysis—methodological foundations. LNCS, vol 3418. SpringerGoogle Scholar
- 6.KDD cup 2011. http://www.kdd.org/kdd2011/kddcup.shtml