We were part of this year’s Girls Talk Math program. This was a great opportunity that we came across in different ways. It has helped us learn about different math topics that we may not have had the opportunity to discover on our own. This topic may seem boring at first, but they all have their individual charms. The topic we chose was Network Science, and together we got to learn about things such as coding on Python.
What is Network Science
The Graph Theory
Centrality and Clustering Coefficient
Centrality in a graph is the importance of a specific node or point. This can be determined by the amount of edges connecting to that node, such that if you removed that node, many other nodes would be affected. Whereas clustering coefficient is a measure of the degree to which nodes in a graph tend to come together. There are many different ways that centrality and clustering coefficients can be represented.
Click here on our work to see code that represents some examples of both