In [1]:
my_fav_things = []
my_fav_things.append({'name': 'raindrops on roses', 'line': 1})
my_fav_things.app end({'name': 'whiskers on kittens', 'line': 1})
my_fav_things.append({'name': 'bri ght copper kettles', 'line': 2})
[s for s in my_fav_things if s['name'] == 'raindrops on roses']
All your relational problems are belong to networks.
Networks, a.k.a. graphs, are an immensely useful modelling tool to model complex relational problems.
Networks are comprised of two main entities:
Edges denote relationships between the nodes.
The heart of a graph lies in its edges, not in its nodes. (John Quackenbush, Harvard School of Public Health)
In a network, if two nodes are joined together by an edge, then they are neighbors of one another.
There are generally two types of networks - directed and undirected. In undirected networks, edges do not have a directionality associated with them. In directed networks, they do.
Can you think of any others?
The key questions here are as follows. How do we...:
It is my hope that when you leave this tutorial, practically, you will be equipped to:
Much of this work is inspired by Prof. Allen Downey (Olin College of Engineering) and Prof. Jukka-Pekka Onnela (Harvard School of Public Health).
Statistics methods are inspired by Dr. Jake Vanderplas, UW.
Hive and Circos Plots' original inventor is Martin Krzywinsky of the BC Genome Sciences Center.
Circos plots were implemented with help from Justin Zabilansky (MIT).
Many thanks to the PyCon Rehearsal class for providing feedback on the material prior to PyCon 2015.
Thank you all who attended actual iterations of this tutorial, at
In [ ]: