Difference between revisions of "MCSN Tuesday, 13-Sep-11"
(→Graph theory (Wilson ch. 1)) |
(→Graph theory (Wilson ch. 1)) |
||
| (21 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
Brainstorm some MCSN examples with research questions. | Brainstorm some MCSN examples with research questions. | ||
| + | = Question of the day = | ||
| − | + | * How does a new musical trend (song, artist, style, genre) spread? (diffusion phenomenon) | |
| + | * What sorts of questions (naive) might we like to answer about such a phenomenon? | ||
| + | * How could musical diffusion be modelled with SNA? | ||
| + | * What sorts of research methods could be applied? | ||
| − | * | + | = Review = |
| + | |||
| + | * [[MCSN Thursday,08-Sep-11 | Last class...]] | ||
| + | * [[Music culture as a social network (Fall 2011)| course outline]] (any questions?) | ||
| + | |||
| + | = Technical details = | ||
* Any questions on using the [https://eclass.srv.ualberta.ca/my/ Moodle]? | * Any questions on using the [https://eclass.srv.ualberta.ca/my/ Moodle]? | ||
| + | * Any problems with Pajek? Issues with Wine? | ||
| + | * Were you able to obtain and open the Pajek datasets? | ||
| + | * Note that [http://www.fwalive.ualberta.ca/mediawiki/index.php?title=Pajek_help#Installing_Pajek_on_your_computer Pajek help] exists! | ||
| + | |||
| + | = ESNAP reading and Pajek = | ||
| + | |||
| + | * Reading: Sections 1.1 to 1.3.2. - [http://vlado.fmf.uni-lj.si/pub/networks/data/esna/dining.htm dining table partners data] | ||
| + | * Examine the data file in a text editor (note: be careful not to save as anything but "plain text"!) | ||
| + | * Manipulate the network using Pajek (change reciprocated choices into edges) | ||
| + | * Manipulate the data using a text editor (add another person to the data) | ||
| + | * Create a new network from scratch | ||
| + | * Visualize the network in various ways using the Layout command (rotate in 3D using x y z X Y Z keys.) | ||
| + | * ''Playing around with Pajek will help you understand both SNA and Pajek...and it's kind of fun!'' | ||
| + | |||
| + | = Applications of SNA to music culture = | ||
| + | |||
| + | * [[Brainstorming MCSN]] | ||
| + | * [[Research on music networks]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
= Graph theory (Wilson ch. 1) = | = Graph theory (Wilson ch. 1) = | ||
| + | |||
| + | [[Media:RWch1.pdf | ch. 1]] | ||
* vertex | * vertex | ||
| Line 23: | Line 48: | ||
* multiple edges, loops | * multiple edges, loops | ||
* simple graph | * simple graph | ||
| − | * walk (alternating sequence of vertices and lines) | + | * walk (alternating sequence of connected vertices and lines) |
| − | * path (alternating sequence of vertices and lines, such that the vertices don't repeat) | + | * path (alternating sequence of connected vertices and lines, such that the vertices don't repeat) |
| − | * '''E'''ulerian graph (contains a walk containing every '''e'''dge once) | + | * '''E'''ulerian graph (contains a walk containing every '''e'''dge once, and returning to starting point) |
| − | * Hamiltonian graph (contains a walk containing every vertex once) | + | * Hamiltonian graph (contains a walk containing every vertex once, and returning to starting point) |
* connected and disconnected graphs | * connected and disconnected graphs | ||
* tree (only one path between each pair of vertices) | * tree (only one path between each pair of vertices) | ||
| Line 32: | Line 57: | ||
* counting graphs | * counting graphs | ||
** isomorphic graphs, and difference | ** isomorphic graphs, and difference | ||
| − | ** how many different simple graphs can you create with a fixed number of vertices? (1,2,3,4) | + | *** two graphs are isomorphic if we can pair their vertices (from one graph to the other), such that when two vertices are connected in one graph, their pairs are connected in the other. |
| − | + | *** when vertices are not labelled, isomorphic graphs are identical - no difference! | |
| − | + | ** how many different simple graphs can you create with a fixed number of vertices? (1,2,3,4,5...). (click [http://mapleta.maths.uwa.edu.au/~gordon/remote/graphs/index.html#nums here] for some rather surprising answers to this question, considering graphs of up to 16 vertices....) | |
| − | + | * Wilson ch.1 questions (we'll discuss on Thursday) | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | * | ||
| − | |||
Latest revision as of 13:48, 13 September 2011
Contents
Today's assignment
Social structure. Read Preface, p. 1, and sections 1.1 to 1.3.2. Graph theory exercise due (distributed by email) - submit answers via the Moodle (see above for instructions regarding network diagrams). Brainstorm some MCSN examples with research questions.
Question of the day
- How does a new musical trend (song, artist, style, genre) spread? (diffusion phenomenon)
- What sorts of questions (naive) might we like to answer about such a phenomenon?
- How could musical diffusion be modelled with SNA?
- What sorts of research methods could be applied?
Review
- Last class...
- course outline (any questions?)
Technical details
- Any questions on using the Moodle?
- Any problems with Pajek? Issues with Wine?
- Were you able to obtain and open the Pajek datasets?
- Note that Pajek help exists!
ESNAP reading and Pajek
- Reading: Sections 1.1 to 1.3.2. - dining table partners data
- Examine the data file in a text editor (note: be careful not to save as anything but "plain text"!)
- Manipulate the network using Pajek (change reciprocated choices into edges)
- Manipulate the data using a text editor (add another person to the data)
- Create a new network from scratch
- Visualize the network in various ways using the Layout command (rotate in 3D using x y z X Y Z keys.)
- Playing around with Pajek will help you understand both SNA and Pajek...and it's kind of fun!
Applications of SNA to music culture
Graph theory (Wilson ch. 1)
- vertex
- edge,arc
- degree
- graph, digraph
- multiple edges, loops
- simple graph
- walk (alternating sequence of connected vertices and lines)
- path (alternating sequence of connected vertices and lines, such that the vertices don't repeat)
- Eulerian graph (contains a walk containing every edge once, and returning to starting point)
- Hamiltonian graph (contains a walk containing every vertex once, and returning to starting point)
- connected and disconnected graphs
- tree (only one path between each pair of vertices)
- planar graph
- counting graphs
- isomorphic graphs, and difference
- two graphs are isomorphic if we can pair their vertices (from one graph to the other), such that when two vertices are connected in one graph, their pairs are connected in the other.
- when vertices are not labelled, isomorphic graphs are identical - no difference!
- how many different simple graphs can you create with a fixed number of vertices? (1,2,3,4,5...). (click here for some rather surprising answers to this question, considering graphs of up to 16 vertices....)
- isomorphic graphs, and difference
- Wilson ch.1 questions (we'll discuss on Thursday)
