Instructions for the semester are archived below.
- Instructions for final presentations to be held on Thursday, May 10, from 1:30 pm to 4:15 pm.
Dear CocoNuTs people,
Final presentations will be held on Thursday, May 10
starting at 1:30 pm in our normal class room.
Here's what you need to know and do. Grading will take into account all of these aspects and more.
0. Talks should absolutely be G rated and respectful of others. See the CocoNuTs syllabus, UVM's student conduct standards, and UVM's Our Common Ground.
1. Time: Please aim for 4 to 5 minutes per person (hard cap at 5).
2. Your mission is to
(a) quickly review the problem/area you've been investigating;
(b) what you've been able to achieve so far (or what went horribly wrong).
Please re-introduce yourself in a sentence (name + your field),
and to acknowledge who you're working with.
3. We will move between talks as fast as possible.
4. Slides: Suggest 3 to 10. More may work but 100 is right out. Quality of slides forms part of the grade.
5. Please email me your slides ahead of our final session,
no later than 11 am on the morning of the talks.
Naming convention:
nnCSYS303project-finaltalk-$firstname-$lastname-YYYY-MM-DD.pdf
where the leading
nn = your talk number (delivered on a separate channel), including a padded 0 if needed
Examples:
07CSYS303project-finaltalk-michael-palin-2018-05-10.pdf
07CSYS303project-finaltalk-michael-palin-2018-05-10.pptx
6. As per usual: My machine will handle Powerpoint (it uses a pair of tongs
and rubber gloves to do so) but highly fancy Powerpoint presentations made
on a Windows machine may not transfer perfectly.
If you are feeling up for Beamer/LaTeX, I highly encourage it. Keynote is fine as well. Anything that ends up as a pdf will work.
7. Practice! These are short talks so you can run through
them a number of times to straighten everything out.
8. Important!: Please submit your final report by Friday, 11:59 pm, May 11.
Naming convention:
CSYS303project-$firstname-$lastname-final-report.pdf
e.g.,
CSYS303project-michael-palin-final-report.pdf
- Replacement Episodes:
The Deliverator will be away for the week of April 23. Please absorb these four insert episodes and their accompanying slide sets. These slides in part make up for an earlier absence as well.
These episodes cover organizations, better ways to think about contagion, and some strange kinds of chaotic contagion. All episodes were recorded in front of a (legally obligated) live studio audience for the seventh season of CocoNuTs.
- Madness update:
All slide sets will now have "last updated" timestamps on them.
These will be viewable on the guide and for each slide set, both on the webpage and on the pdfs.
Note that only updated pdfs will show a "last updated" timestamp. Reprocessing is underway.
- Assignment "I can't keep track of anything anymore"
Available here:
http://www.uvm.edu/pdodds/teaching/courses/2018-01UVM-303/assignments/07/
Due on Friday, March 30 by 11:59 pm.
- Office hours adjustment for Wednesday, September 6
Office hours will run from 10:45 am to 11:30 am.
- Focus for the second half of the semester:
1. Projects
2. Online material for thought expansion
3. Classes will entail detailed looks into special topics
4. Assignments will be listed through 11 but are optional
- Instructions for first talks:
CocoNuTters,
Short pitch presentations will be held on Thursday, March 28, and the following Tuesday if necessary. The format will be a mini-conference session with each person presenting for five (5) minutes.
Here's what you need to know and do:
First: If you have not already done so, please email me your topic choices, and if you are working in a group or not. Feel free to talk in Slack about possible projects. Pitch your idea and recruit people to your team.
Teams of 2 to 3 are strongly encouraged (4 is too many, 1 is okay).
Send your information as the start of the draft of your project report with the usual naming convention with one twist:
CSYS303project-firstname-lastname-YYYY-MM-DD.pdf
where the date is the current date, e.g.,'
CSYS303project-michael-palin-2019-03-28pdf
At this point, you just need a title but you are welcome to add more.
If a topic is already taken and I catch this, I'll let you know.
Below are instructions for the talks and how to name your slides. A randomized order will be delivered by email as well. Please use the lowest number of all group members in the naming convention.
These talks always prove to be interesting, diverse, and fun; the feedback I've received in the past has been that students greatly enjoy hearing about each others' topics.
We will not be recording these talks.
Okay, here's the plan for these first talks—please read!:
1.0 Talks will be 5 minutes long per person.
1.1 Your mission is to:
(a) Clearly state the problem/area you're going to investigate;
(b) Why it's interesting;
and
(c) What you plan to do for the remainder of the semester.
Please also introduce yourself in a sentence or two (name + your field).
1.1b Talks should absolutely be PG and respectful of others.
1.2 If you are part of a group, you will need to speak for 3 minutes each. Please coordinate your talk with your fellow group members.
2. We will have to move quickly between talks (< 30 seconds) so please know when you're up and be prepared to swap over.
3. Slides: Mandatory. The number should be 1 to 3 per speaker. More can work but certainly not, say, 20, unless you have a sequence of stunningly beautiful pictures that will somehow help your story. Your assessment will in part be based on your slides.
4. Please email me your slides before 9 am on the day of the talks.
Naming convention:
nnCSYS303project-firsttalk-firstname-lastname-2018-04-12.pdf
or
nnCSYS303project-firsttalk-firstname-lastname-2018-04-17.pdf
where the leading
nn = your talk number, including a padded 0 if needed (talk number = lowest number of group members per email).
Examples:
07CSYS303project-firsttalk-michael-palin-2019-03-28.pdf
My machine will handle Powerpoint (it uses a pair of tongs and rubber gloves to do so) but highly fancy Powerpoint presentations made on a Windows machine may not transfer perfectly. If you are feeling up for Beamer/LaTeX, I highly encourage it. Anything that ends up as a pdf should be fine.
5. Practice! These are short talks so you can run through them a number of times to straighten everything out.
- Assignment "I can't keep track of anything anymore"
Available here:
http://www.uvm.edu/pdodds/teaching/courses/pocs/assignments/07/
Due on Friday, March 30 by 11:59 pm.
- Assignment "I feel happy!"
Available here:
http://www.uvm.edu/pdodds/teaching/courses/coconuts/assignments/06/
Due on Friday, March 1, by 11:59 pm.
- Assignment "Flesh wound"
Available here:
http://www.uvm.edu/pdodds/teaching/courses/coconuts/assignments/05/
Due on Friday, March 1, by 11:59 pm.
- Absorbables: Structure Detection (Consume for Week 8, Session 2)
Slides:
Structure Detection:
http://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/structure-detection/
Videos:
16l: Structure detection introduction (5:15)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/16l/
16m: Aggregation vs division (8:26)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/16m/
17i: Divide and understand (6:59)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/17j/
17j: Modularity (7:20)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/17j/
17k: Optimal partitioning (11:47)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/17k/
18g: Electronic betweenness (18:26)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/17g/
18h: Community comparison for different betweenness measures (3:34)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/17h/
18i: Some example partitions using the betweenness approach (3:56)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/17i/
18j: Shuffling methods for structure detection (8:16)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/18j/
18k: Shuffling method: The surprise of rank 3 (6:08)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/18k/
18l: Some example partitions from a shuffling method (2:09)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/18l/
18m: Spectral methods (4:26)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/18m/
18n: Hierarchical random graphs (5:24)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/18n/
18o: Overlapping communities (10:01)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/18o/
19a: Overlapping partitions and the types of edges (4:52)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/19a/
19b: Beyond hierarchies (12:09)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/19b/
- Absorbables: Centrality (Consume for Week 8, Session 1)
Slides:
Centrality
http://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/centrality/
Videos:
16f: Centrality introduction (9:42)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/16f/
16g: Degree Centrality (4:24)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/16g/
16h: Closeness centrality (2:37)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/16h/
16i: Betweennesses (13:21)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/16i/
16j: Eigenvalue centrality (7:06)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/16j/
16k: Hubs and Authoritah (9:01)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/16k/
- Absorbables: Contagion (Consume for Week 7, Session 2, Thursday, February 28)
Slides:
Diffusion on networks
http://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/diffusion/
Contagion
http://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/contagion/
Videos:
15j: Diffusion on networks (14:21)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/15j/
26a: The door marked "Contagion Mechanisms on Networks". (1:18:16)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/26a/
27a: Critical masses and triggering components. (1:16:54)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/27a/
28a: Contagion. Finally, the fever breaks. (1:10:30)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/28a/
- Absorbables: Bipartite Networks and Generating Functions (Consume for Week 7, Session 1, Tuesday, February 26)
Slides:
Random Bipartite Networks, also Generating Functions
http://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/randombipartitenetworks/
Videos:
14h: Bipartite networks: introduction and examples (6:47)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/14h/
14i: Bipartite networks: Basic definitions (11:20)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/14i/
14j: Bipartite networks: Example of an interesting induced degree distribution (4:19)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/14j/
15b: Random bipartite affiliation network recap (with confusion) (4:21)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/15b/
15c: How to build random bipartite networks (1:19)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/15c/
15d: Seeing the structure of random bipartite affiliation networks (5:31)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/15d/
15e: Key distributions for random bipartite graphs (7:25)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/15e/
15f: Generating function time (6:50)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/15f/
15g: Finding the giant component condition through generating functions (7:30)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/15g/
15h: Quick analysis of a simple random bipartite network (5:56)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/15h/
15i: Real data: Pretty good (14:34)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/15i/
Optional:
15a: We've long talked about Facebook's bad behavior (8:46)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/15a/
- Absorbables: Generating Functions (Consume for Week 6, Session 2, Thursday, February 21)
Slides:
Generating Functions and their Delightful Applications to Random Networks
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/generatingfunctions/
Videos:
13c: Generating function refresh (6:22)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/13c/
13d: Simple V = U + 1 generating function rule (3:01)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/13d/
13e: Recursive equations for finite component size p.g.f.'s (11:32)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/13e/
13f: Giant component size calculation (3:41)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/13f/
13g: Component size distributions for standard random graphs (14:55)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/13g/
13h: A very pleasing simple network calculation (25:47)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/13h/
14d: Finding finite component size distributions with generating functions (6:47)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/14d/
14e: Distribution of finite component sizes: Standard random networks (7:50)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/14e/
14f: Distribution of finite component sizes: Simple mixed network (5:58)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/14f/
14g: Nutshell for Generating Functions (2:02)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/14g/
Optional:
14a: Ross Taylor, Survival of the Storytellers, Fred Rogers (5:38)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/14a/
14c: When the Joy of Cooking fights back (5:07)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/14c/
14b: The scale-free brouhaha, continued (5:56)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/14b/
- Absorbables: Generating Functions (Consume for Week 6, Session 1, Tuesday, February 19)
Slides:
Generating Functions and their Delightful Applications to Random Networks
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/generatingfunctions/
Videos:
11g: The Dark Art of Generatingfunctionomancy (12:42)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/11g/
11h: Generating functions: Example calculations (3:43)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/11h/
11i: Generating functions: Computing the average degree (4:27)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/11i/
11j: Generating functions: Higher moments and more (4:09)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/11j/
12b: Generting function recap (3:04)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/12b/
12c: Inversion formula for probability generating functions (9:07)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/12c/
12d: Generating function deliciousness for sums of variables (1:55)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/12d/
12e: Giant component condition, generatingfunctionally (16:48)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/12e/
12f: Component size distributions (4:27)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/12f/
12g: Recursion story with pictures (13:01)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/12g/
12h: Sneaky generating function story for random sums of randomness (16:59)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/12h/
Optional:
12a: Conspiracy theories, bad influences, Icarus, cheating (10:00)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/12a/
13i: Dashboard cat again (0:35)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/13i/
- Assignment "Haggle properly"
Available here:
http://www.uvm.edu/pdodds/teaching/courses/coconuts/assignments/04/
Due on Friday, February 22, by 11:59 pm.
- Assignment "Antioch"
Available here:
http://www.uvm.edu/pdodds/teaching/courses/coconuts/assignments/03/
Due on Friday, February 15, by 11:59 pm.
- Absorbables: Random Networks (Consume for Week 5, Session 2)
Slides:
Random Networks, Nutshellfully
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/random-networks-nutshell/
Videos:
10b: Random Networks intro (6:43)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/10b/
10c: Construction methods 1/2 (6:32)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/10c/
10d: Visual examples of random networks (7:37)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/10d/
10e: Phase transition: The appearance of the Giant Component (2:42)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/10e/
10f: Clustering = 0 for random networks (3:04)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/10f/
10g: Pure random networks have Poission degree distributions (6:16)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/10g/
10h: Generalized random networks, or The Configuration Model (6:10)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/10h/
10i: Construction methods 2/2 (6:23)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/10i/
10j: Motifs (2:43)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/10j/
10k: Edge-degree distribution (11:44)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/10k/
10l: Upsettingly strange friends (4:39)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/10l/
11a: The giant component condition for random networks (7:23)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/11a/
11b: A better spreading condition (9:40)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/11b/
11c: Erdős–Rényi networks: Giant component condition (1:14)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/11c/
11d: Scale-free networks: Giant component condition (5:02)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/11d/
11e: A sneaky calculation that works but is totally wrong (12:27)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/11e/
Optional:
12i: Pratchett and Totoroness (1:12)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/12i/
13a: Wikipedia's paths, linear adoption curves, arctic trouble (9:06)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/13a/
- Absorbables: Optimal Supply Networks III (Consume for Week 5, Session 1)
Slides:
Optimal Supply Networks III: Networks connecting many sources to many sinks
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/supplynetworks-3/
Videos:
09g: Many sources, many sinks: The size-density law (at speed) (13:27)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/09g/
09h: Cartograms (6:05)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/09h/
09i: Derivation of the size-density law (6:23)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/09i/
09j: Global redistribution networks (5:09)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/09j/
09k: Facility allocation: Private versus Public (10:47)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/09k/
Optional:
13b: Dashboard cat (1:17)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/13b/
- Absorbables: Optimal Supply Networks, Part II, continued (Consume for Week 4, Session 2)
Slides:
Optimal Supply Networks II: Blood, Water, and the Church of Quarterology, continued
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/supplynetworks-2/
Videos:
08c: Supply networks recap (3:20)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/08c/
08d: Real blood networks (2:55)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/08d/
08e: Four dimensions (lol) (4:43)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/08e/
08f: Ensuing papers and a book of great confusion (12:36)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/08f/
08g: Banavar et al.'s theory of impossible elephants (5:20)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/08g/
08h: Simple geometric story and the specialness of isometric organisms (32:14)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/08h/
09b: Geometric argument recap (4:12)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/09b/
09c: River network data (8:04)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/09c/
09d: The Cabal responds, buzzkilling, more confusion (1:47)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/09d/
09e: Opinion figure! (4:04)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/09e/
09f: Concluding Quarterology: The Prosecution can never rest (4:27)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/09f/
- Absorbables: Optimal Supply Networks, Part II, continued (Consume for Week 4, Session 1)
Slides:
Optimal Supply Networks II: Blood, Water, and the Church of Quarterology, continued
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/supplynetworks-2/
Videos:
07f: It's a disaster (4:03)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/07f/
07g: Rivers and Hack's law (3:17)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/07g/
07h: Early (crazy) theories (14:21)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/07h/
07i: Supply network theory of West et al. (it's wrong) (36:35)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/07i/
08b: Believe people when they tell you who they are (2:57)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/08b/
- Assignment "Fear and Surprise"
Available here:
http://www.uvm.edu/pdodds/teaching/courses/coconuts/assignments/02/
Due on Friday, February 1, by 11:59 pm.
- Assignment "The Unladen Swallow"
Available here:
http://www.uvm.edu/pdodds/teaching/courses/coconuts/assignments/01/
Due on Friday, February 1, by 11:59 pm.
- Absorbables: Optimal Supply Networks, Part II (Consume for Week 3, Session 2)
Slides:
Optimal Supply Networks II: Blood, Water, and the Church of Quarterology
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/supplynetworks-2/
Videos:
05f: Welcome to the Church of Quarterology (16:36)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/05f/
06d: Quarterology's origins (17:23)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/06d/
06e: Voting for scientific laws (5:06)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/06e/
06f: We look at actual data (9:17)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/06f/
06g: Different and better kinds of linear regression (6:47)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/06g/
06h: Let's measure some power-law exponents ... What could go wrong? (13:19)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/06h/
07e: More on regression: linear and RMA (7:28)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/07e/
- Absorbables: Optimal Supply Networks, Part I (Consume for Week 3, Session 1)
Slides:
Optimal Supply Networks I: Murray's Law
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/slides/supplynetworks-1/
Videos:
05d: Optimal supply networks: Braid or branch (15:36)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/05d/
05e: Optimal supply networks: Murray's law (22:22)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/05e/
Optional Videos:
06b: Great New York Times fake Twitter follower investigation
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/06b/
06c: "I am not a robot"
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/06c/
- Absorbables: Branching Networks, Part II (Consume for Week 2, Session 2)
Slides:
Branching Networks, Part II:
https://www.uvm.edu/pdodds/teaching/courses/coconuts/slides/branchingnetworks-2/
Videos:
04d: Branching networks: Power-law distributions for areas and lengths (34:04)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/04d/
04f: Branching networks: Scheidegger's model (7:44)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/04f/
04g: Branching networks: Equipartioning of landscapes (2:23)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/04g/
04h: Branching networks: Fluctuationsarama (5:37)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/04h/
05b: Mechanisms for river network generation (10:53)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/05b/
Optional Videos:
04c: Cute round things (2:34)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/04c/
05c: Again with the academics ragetweeting (7:29)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/05c/
- Absorbables: Branching Networks, Parts I and II (Consume for Week 2, Session 1)
Slides:
Branching Networks, Part I:
https://www.uvm.edu/pdodds/teaching/courses/coconuts/slides/branchingnetworks-1/
Branching Networks, Part II:
https://www.uvm.edu/pdodds/teaching/courses/coconuts/slides/branchingnetworks-2/
Videos:
03a: How to find river networks on satellite derived landscapes (36:12)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/03a/
03c: Network evolution and piratic perils (5:38)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/03c/
03d: Connecting Horton's laws with Tokunaga's law (31:42)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/03d/
04b: Branching networks: Reducing Horton's laws (10:19)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/04b/
Optional Videos:
03b: Finding the edges of Minecraftian landscapes (2:25)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/03b/
04a: Pratchett the Cat, the great unix command tar, Nicky Case (9:20)
https://www.uvm.edu/pdodds/teaching/courses/complex-networks/episodes/04a/
- Absorbables: Branching Networks, Part I (Consume for Week 1, Session 2)
Slides:
Branching Networks, Part I:
https://www.uvm.edu/pdodds/teaching/courses/coconuts/slides/branchingnetworks-1/
Videos:
01b: Introduction to natural branching networks (27:54)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/01b/
02b: Stream ordering and the mixed hierarchy architecture of branching networks (1:01:01)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/02b/
- Absorbables: Overview (Consume for Week 1, Session 1)
Slides:
Overview (2018):
https://www.uvm.edu/pdodds/teaching/courses/coconuts/slides/overviewi/
Videos:
01a: Overview of Complex Networks (47:18)
https://www.uvm.edu/pdodds/teaching/courses/coconuts/episodes/01a/
- Office hours:
To be sorted out with the Assistant Deliverator
- One CocoNuT each, first door on the left.
[Movie Voice]
In a world … where it's back to school time for year 2019 CocoNuTs gets underway for its ninth season on Tuesday, January 15.
[Normal Voice]
This is … not a good movie.
Anyway.
Instructions will appear here throughout the semester so please check back regularly. Please also follow CocoNuTs on Twitter at @networksvox. The large button on the course's homepage should help you find your way.
We are flipping the course this semester so meeting times will be office hours. We will go over the plan in our first session.