<?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: tnet: Software for Analysing Weighted Networks</title>
	<atom:link href="http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/feed/" rel="self" type="application/rss+xml" />
	<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/</link>
	<description>bouncing ideas</description>
	<lastBuildDate>Tue, 24 Aug 2010 19:03:46 +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/06/12/tnet-software-for-analysing-weighted-networks/#comment-979</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Sat, 27 Mar 2010 17:06:46 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-979</guid>
		<description>If your network is undirected and the weights of ties are symmetric (i.e., if A is connected to B with strength x, B is also connected to A with strength x), out-degree and in-degree produce identical outcomes. Send me an email with the network if you are having issues. T</description>
		<content:encoded><![CDATA[<p>If your network is undirected and the weights of ties are symmetric (i.e., if A is connected to B with strength x, B is also connected to A with strength x), out-degree and in-degree produce identical outcomes. Send me an email with the network if you are having issues. T</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mathew Vereb</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-977</link>
		<dc:creator>Mathew Vereb</dc:creator>
		<pubDate>Thu, 25 Mar 2010 21:14:48 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-977</guid>
		<description>Dear Mr. Opsahl.
I am writing diploma work and the theme relates with social network analysis. I have a matrix 36x36 which contains european states. Whole matrix contatins just 0 and 1, what depends on fact if states had borders. I think i solve the problem how to define weight to edges and now i am looking for index which will count inputs to vertices which include weights in its calculation. I thought about something like degree, but it always makes the same result even if i am using in or out degree and ignore.eval TRUE or FALSE. Could you help me? Yours sincerely</description>
		<content:encoded><![CDATA[<p>Dear Mr. Opsahl.<br />
I am writing diploma work and the theme relates with social network analysis. I have a matrix 36&#215;36 which contains european states. Whole matrix contatins just 0 and 1, what depends on fact if states had borders. I think i solve the problem how to define weight to edges and now i am looking for index which will count inputs to vertices which include weights in its calculation. I thought about something like degree, but it always makes the same result even if i am using in or out degree and ignore.eval TRUE or FALSE. Could you help me? Yours sincerely</p>
]]></content:encoded>
	</item>
</channel>
</rss>
