<?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: Betweenness in weighted networks</title>
	<atom:link href="http://toreopsahl.com/2009/02/20/betweenness-in-weighted-networks/feed/" rel="self" type="application/rss+xml" />
	<link>http://toreopsahl.com/2009/02/20/betweenness-in-weighted-networks/</link>
	<description>bouncing ideas</description>
	<lastBuildDate>Tue, 24 Jan 2012 16:14:54 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/02/20/betweenness-in-weighted-networks/#comment-1480</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Wed, 20 Apr 2011 07:25:05 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=464#comment-1480</guid>
		<description><![CDATA[John,

I treat these networks as directed and simply create two directed ties -- one in each direction -- for each undirected tie. This is also how undirected networks are represented generally in tnet. 

Tore]]></description>
		<content:encoded><![CDATA[<p>John,</p>
<p>I treat these networks as directed and simply create two directed ties &#8212; one in each direction &#8212; for each undirected tie. This is also how undirected networks are represented generally in tnet. </p>
<p>Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Ihrie</title>
		<link>http://toreopsahl.com/2009/02/20/betweenness-in-weighted-networks/#comment-1479</link>
		<dc:creator><![CDATA[John Ihrie]]></dc:creator>
		<pubDate>Wed, 20 Apr 2011 00:31:20 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=464#comment-1479</guid>
		<description><![CDATA[By mixed I mean some of the edges are directed, while some of the edges are undirected.

Thanks]]></description>
		<content:encoded><![CDATA[<p>By mixed I mean some of the edges are directed, while some of the edges are undirected.</p>
<p>Thanks</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/02/20/betweenness-in-weighted-networks/#comment-1478</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Tue, 19 Apr 2011 20:27:02 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=464#comment-1478</guid>
		<description><![CDATA[John,

How do you define mixed graphs? tnet currently can only analyse weighted, two-mode, and continuously observed networks. 

Tore]]></description>
		<content:encoded><![CDATA[<p>John,</p>
<p>How do you define mixed graphs? tnet currently can only analyse weighted, two-mode, and continuously observed networks. </p>
<p>Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Ihrie</title>
		<link>http://toreopsahl.com/2009/02/20/betweenness-in-weighted-networks/#comment-1460</link>
		<dc:creator><![CDATA[John Ihrie]]></dc:creator>
		<pubDate>Thu, 14 Apr 2011 22:10:46 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=464#comment-1460</guid>
		<description><![CDATA[Tore,

Thank you very much for your response.  I have another question:  Is it possible to analyze mixed graphs with your package?]]></description>
		<content:encoded><![CDATA[<p>Tore,</p>
<p>Thank you very much for your response.  I have another question:  Is it possible to analyze mixed graphs with your package?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/02/20/betweenness-in-weighted-networks/#comment-1392</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Thu, 14 Apr 2011 06:09:36 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=464#comment-1392</guid>
		<description><![CDATA[John,

Normalisation of centrality measures are troublesome for two reasons for me. First, it is unclear whether the binary betweenness measure scales with n(n-1). While this is a theoretical maximum that would be observed for the central node in a star-configuration, it becomes harder for nodes to be stars as the network grows in terms of nodes since the average degree grows slower than the number of nodes. Second, dividing by a constant does not increase the variance among nodes in a network. As such, unless you compare between networks, there is no purpose to normalising the measures. Nevertheless, if you are comparing across networks, I would claim that, due to the uncertain relationship between number of nodes and centrality measures, the networks must be comparable in size. However, if they are the same size, then there is no point to normalisation. 

Having said that about the binary measures, the weighted measures do not have theoretical maxima as tie weight generally are not bound by an upper limit. Thus, it is not possible to normalise them, which to be honest, might not be such a bad idea!

Best,
Tore]]></description>
		<content:encoded><![CDATA[<p>John,</p>
<p>Normalisation of centrality measures are troublesome for two reasons for me. First, it is unclear whether the binary betweenness measure scales with n(n-1). While this is a theoretical maximum that would be observed for the central node in a star-configuration, it becomes harder for nodes to be stars as the network grows in terms of nodes since the average degree grows slower than the number of nodes. Second, dividing by a constant does not increase the variance among nodes in a network. As such, unless you compare between networks, there is no purpose to normalising the measures. Nevertheless, if you are comparing across networks, I would claim that, due to the uncertain relationship between number of nodes and centrality measures, the networks must be comparable in size. However, if they are the same size, then there is no point to normalisation. </p>
<p>Having said that about the binary measures, the weighted measures do not have theoretical maxima as tie weight generally are not bound by an upper limit. Thus, it is not possible to normalise them, which to be honest, might not be such a bad idea!</p>
<p>Best,<br />
Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Ihrie</title>
		<link>http://toreopsahl.com/2009/02/20/betweenness-in-weighted-networks/#comment-1391</link>
		<dc:creator><![CDATA[John Ihrie]]></dc:creator>
		<pubDate>Thu, 14 Apr 2011 05:26:28 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=464#comment-1391</guid>
		<description><![CDATA[I noticed your R documentation for the tnet package identifies &quot;betweenness_w Betweenness centrality in a weighted network&quot;.  Doesn&#039;t the betweenness centrality actually normalize the values such that a node will have a BC somewhere between 0 and 1?  Is there anyway to arrive at this normalized value with your package?

Thanks]]></description>
		<content:encoded><![CDATA[<p>I noticed your R documentation for the tnet package identifies &#8220;betweenness_w Betweenness centrality in a weighted network&#8221;.  Doesn&#8217;t the betweenness centrality actually normalize the values such that a node will have a BC somewhere between 0 and 1?  Is there anyway to arrive at this normalized value with your package?</p>
<p>Thanks</p>
]]></content:encoded>
	</item>
</channel>
</rss>

