<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Weighted local clustering coefficient</title>
	<atom:link href="http://toreopsahl.com/2009/01/23/weighted-local-clustering-coefficient/feed/" rel="self" type="application/rss+xml" />
	<link>http://toreopsahl.com/2009/01/23/weighted-local-clustering-coefficient/</link>
	<description>bouncing ideas</description>
	<lastBuildDate>Tue, 12 Jan 2010 16:20:38 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: David Hope</title>
		<link>http://toreopsahl.com/2009/01/23/weighted-local-clustering-coefficient/#comment-82</link>
		<dc:creator>David Hope</dc:creator>
		<pubDate>Sun, 10 May 2009 12:01:02 +0000</pubDate>
		<guid isPermaLink="false">http://thetore.wordpress.com/?p=312#comment-82</guid>
		<description>Great to see someone trying to tackle weights in networks - this is very similar to what I&#039;m trying to do for my Ph.D. (over language)  I&#039;m just reading your paper &#039;Clustering In Weighted Networks&#039; - very interesting. I actually came up with a (local) weighted clustering coefficient which I use to find cohesion in language: this is simply the sum of the products of the paths and can deal with weighted, &#039;unweighted&#039; (i.e. uniform weights) and both directed and undirected graphs.</description>
		<content:encoded><![CDATA[<p>Great to see someone trying to tackle weights in networks &#8211; this is very similar to what I&#8217;m trying to do for my Ph.D. (over language)  I&#8217;m just reading your paper &#8216;Clustering In Weighted Networks&#8217; &#8211; very interesting. I actually came up with a (local) weighted clustering coefficient which I use to find cohesion in language: this is simply the sum of the products of the paths and can deal with weighted, &#8216;unweighted&#8217; (i.e. uniform weights) and both directed and undirected graphs.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
