Summary
Samenvatting Netwerkanalyse Midterm
- Course
- Institution
- Book
In deze samenvatting is alle theorie over netwerken samengevat in een bondige en overzichtelijke tekst.
[Show more]
Connected book
Book Title:
Author(s):
- Edition:
- ISBN:
- Edition:
More summaries for
-
Samenvatting netwerk analyse midterm
-
Samenvatting Netwerkanalyse Midterm 2
Seller
Follow
matthiaslouws
Reviews received
Content preview
H1A network G has 2 parts:
1. A set of N elements: Nodes
2. A set of L pairs of nodes: Links or Edges. The link (i, j) joins the nodes i and j.
A network can be directed (gericht) or undirected (ongericht):
- In directed networks, links are called direct links and the order in a link reflects the direction
- in undirected networks, links are bi-directional and the order does not matter.
A network can be weighted (gewogen) or unweighted (ongewogen): in weighted networks, links have an associated
weight. (e-mail communications, more emails between persons, heavier link)
Other network types:
- Bipartite network: two groups of nodes where links only connect to nodes from different groups.
- Multiplex network: a network with multiple types of links
Number of links in networks:
- The maximum number of links in an undirected network with N nodes is the number of distinct pairs of
n∗(n−1)
nodes: L =
2
- In a directed network, each pair of nodes should be counted twice, once for each direction, so
- L = n * (n-1)
- A bipartite network is complete if each node in one group is connected to all nodes in the other group. In this
case Lmax = N1 × N2
Density:
- The density of a network with N nodes and L links is: d = L/ Lmax
2L
- In an undirected network the density is: d = L/ Lmax =
N ( N−1)
L
- In an directed network the density isL d = L/ Lmax =
N ( N−1)
In a complete network, d = 1, since L = Lmax
in a sparse network, L < Lmax and therefore d < 1
If the number of links grows proportionally to the number of nodes (L ~ N), the network is sparse.
If the number of links grows faster to the number of nodes (L ~ N 2 ) , the network is dense.
Subnetworks
A subset of a network is called a subnetwork. A subnetwork is obtained by selecting a subset of the nodes and all the
links between those nodes.
A clique is a complete subnetwork: a subset of nodes all connected to each other. Any subset of a complete
network is a clique because all pairs of nodes are connected and therefore all pairs of nodes in any subnetwork are
connected.
Degree
The degree of a node is the number of links or neighbours. A node with no neighbours has a degree of 0 (k = 0) and is
called a singleton. The average degree of a network is denoted by K. The average degree of a network is defined as
❑
∑ Ki . K=
2 L dN (N −1)
= =d (N−1)
i
k= N N
N
Directed networks
In a graphical representation of a network, the direction of a link is indicated by an arrow. The presence of a link in a
directed network does not necessarily imply the presence of a link in the opposite direction. For the degree of a node
in a directed network, we have to think of incoming and outgoing links separately:
- The number of incoming links of node i is called the in-degree and denoted by k iin
- The number of outgoing links of node i is called the out-degree and denoted by k iout
Weighted networks
In a graphical representation of a network, the weight of a link is represented by the thickness of a line. A weight of
zero is equivalent to the absence of a link. A weighted network can be directed or undirected:
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller matthiaslouws. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $6.95. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
71498 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now