Review for Quiz: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
Line 6: | Line 6: | ||
* Computing the number of links in a simple network—directed, or undirected—containing N nodes | * Computing the number of links in a simple network—directed, or undirected—containing N nodes | ||
* Computing density of a network | * Computing density of a network | ||
* Walks and semiwalks | |||
* Paths and semipaths | * Paths and semipaths | ||
* Strong and weak components | * Strong and weak components | ||
Line 12: | Line 13: | ||
* Signed graphs | * Signed graphs | ||
* Cycles and semicycles | * Cycles and semicycles | ||
* Balanced graphs | * Balanced cycles (even number of negative lines) and clusterable cycles (even number of negative lines, or odd number starting with 3,5,7, etc. - but not just one) | ||
* Clusterable graphs | * Balanced graphs (no unbalanced cycles) | ||
* Clusterable graphs (no unclusterable cycles) | |||
* Two mode networks, and affiliation networks | * Two mode networks, and affiliation networks | ||
* Deriving a one-mode valued network from a two-mode network | * Deriving a one-mode valued network from a two-mode network |
Revision as of 13:02, 8 October 2019
Quiz #2 review:
Be sure you understand the following concepts, computations, derivations, and operations. Note that definitions of all terms are according to our textbook, ESNAP. (And everything is in the book!)
- The "symmetrize" operation
- Computing the number of links in a simple network—directed, or undirected—containing N nodes
- Computing density of a network
- Walks and semiwalks
- Paths and semipaths
- Strong and weak components
- Degree and degree distribution
- K-cores and their components
- Signed graphs
- Cycles and semicycles
- Balanced cycles (even number of negative lines) and clusterable cycles (even number of negative lines, or odd number starting with 3,5,7, etc. - but not just one)
- Balanced graphs (no unbalanced cycles)
- Clusterable graphs (no unclusterable cycles)
- Two mode networks, and affiliation networks
- Deriving a one-mode valued network from a two-mode network
- Contour lines and islands
- (don't worry about all the other detail in the Affiliation network chapter 5; just know the basics)
Hint: review the questions at the ends of ESNAP chapters 3, 4, and 5 (Sections 3.8, 4.7, 5.8). Answers are provided at the end of each chapter. Make sure you understand them!