[DM4-7] Network models

Network models are crucial in some application domains, such as Navigation (roads etc.), but also in utility applications (facilities like pipes etc.) In this topic should be treated: - The network model in the database domain - Graph based NoSQL databases - Topology of network models - Data structures for storing network data - The Dijkstra algorithm - Overview on important applications

External resources

• Banks, D. (2009). Dynamic network models: Introduction to new and interdisciplinary approaches. Computational and Mathematical Organization Theory, 15(4), 259-260. DOI: 10.1007/s10588-009-9062-6
• Haslbeck, Jonas M. B, & Waldorp, Lourens J. (2017). How well do network models predict observations? On the importance of predictability in network models. Behavior Research Methods, 50(2), 853-861. DOI: 10.3758/s13428-017-0910-x
• Miao, Guowang, Zander, Jens, Sung, Ki Won, & Slimane, Slimane Ben. (2016). Fundamentals of mobile data networks. Cambridge: Cambridge University Press.
• Newman, M. (2010). Networks. Oxford: Oxford University Press. DOI: 10.1093/acprof:oso/9780199206650.001.0001

Learning outcomes

• 695 - Discuss some of the difficulties of applying the standard process-pattern concept to lines and networks
  Discuss some of the difficulties of applying the standard process-pattern concept to lines and networks
• 696 - Define the following terms pertaining to a network: Loops, multiple edges, the degree of a vertex, walk, trail, path, cycle, fundamental cycle
  Define the following terms pertaining to a network: Loops, multiple edges, the degree of a vertex, walk, trail, path, cycle, fundamental cycle
• 697 - Demonstrate how a network is a connected set of edges and vertices
  Demonstrate how a network is a connected set of edges and vertices
• 698 - List definitions of networks that apply to specific applications or industries
  List definitions of networks that apply to specific applications or industries
• 699 - Create an adjacency table from a sample network
  Create an adjacency table from a sample network
• 700 - Explain how a graph can be written as an adjacency matrix and how this can be used to calculate topological shortest paths in the graph
  Explain how a graph can be written as an adjacency matrix and how this can be used to calculate topological shortest paths in the graph
• 701 - Create an incidence matrix from a sample network
  Create an incidence matrix from a sample network
• 702 - Explain how a graph (network) may be directed or undirected
  Explain how a graph (network) may be directed or undirected
• 703 - Demonstrate how attributes of networks can be used to represent cost, time, distance, or many other measures
  Demonstrate how attributes of networks can be used to represent cost, time, distance, or many other measures
• 704 - Demonstrate how the star (or forward star) data structure, which is often employed when digitally storing network information, violates relational normal form, but allows for much faster search and retrieval in network databases
  Demonstrate how the star (or forward star) data structure, which is often employed when digitally storing network information, violates relational normal form, but allows for much faster search and retrieval in network databases

Self assessment

Outgoing relations

• [DM4-7] Network models subclassof [DM4] Vector data model, Feature based modelling, Applications