<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Network Analysis by Sarah Hewitt</title>
      <link>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7</link>
      <description>Made with panache</description>
      <language>en-us</language>
      <pubDate>2016-06-19 11:04:28 UTC</pubDate>
      <lastBuildDate>2016-06-19 11:36:15 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>Degree Centrality</title>
         <author>sarah_tiggy21</author>
         <link>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114975320</link>
         <description><![CDATA[<div>"...the number of links incident upon a node..."</div>]]></description>
         <enclosure url="" />
         <pubDate>2016-06-19 11:06:34 UTC</pubDate>
         <guid>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114975320</guid>
      </item>
      <item>
         <title>Closeness Centrality</title>
         <author>sarah_tiggy21</author>
         <link>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114975374</link>
         <description><![CDATA[<div>"...the more central a node is the lower its total distance from all other nodes...</div>]]></description>
         <enclosure url="" />
         <pubDate>2016-06-19 11:07:56 UTC</pubDate>
         <guid>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114975374</guid>
      </item>
      <item>
         <title>Betweenness Centrality</title>
         <author>sarah_tiggy21</author>
         <link>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114975442</link>
         <description><![CDATA[<div>"...quantifies the number of times a node acts as a bridge along the shortest path between two other nodes..."</div>]]></description>
         <enclosure url="" />
         <pubDate>2016-06-19 11:09:10 UTC</pubDate>
         <guid>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114975442</guid>
      </item>
      <item>
         <title>Eigenvector Centrality</title>
         <author>sarah_tiggy21</author>
         <link>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114975817</link>
         <description><![CDATA[<div>"...quantifies the number of times a node acts as a bridge along the shortest path between two other nodes..."</div>]]></description>
         <enclosure url="" />
         <pubDate>2016-06-19 11:11:49 UTC</pubDate>
         <guid>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114975817</guid>
      </item>
      <item>
         <title>Clustering Coefficient</title>
         <author>sarah_tiggy21</author>
         <link>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114976812</link>
         <description><![CDATA[<div>The clustering coefficient measures how connected a vertex’s neighbors are to one another.</div>]]></description>
         <enclosure url="" />
         <pubDate>2016-06-19 11:33:31 UTC</pubDate>
         <guid>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114976812</guid>
      </item>
      <item>
         <title>Graph Density</title>
         <author>sarah_tiggy21</author>
         <link>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114976851</link>
         <description><![CDATA[<div>The number between 0 and 1 indicating  how interconnected the vertices are in the network.</div>]]></description>
         <enclosure url="" />
         <pubDate>2016-06-19 11:35:45 UTC</pubDate>
         <guid>https://padlet.com/sarah_tiggy21/qz56cs5a4nm7/wish/114976851</guid>
      </item>
   </channel>
</rss>
