<?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 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/06/12/tnet-software-for-analysing-weighted-networks/#comment-1685</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Fri, 27 May 2011 13:04:43 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1685</guid>
		<description><![CDATA[Adam,

Great that you are considering the tie weights in the network.

The small_world_test_w-function was removed from tnet since many people had issues understanding exactly what it did. There is hopefully a paper coming out soon that details the steps of it, so then it might be re-introduced. 

In the meantime, you can calculate the individual measures yourself as the underlying functions are still part of tnet. In particular, you can create a list-object with random networks, and then use the sapply-function with the distance_w to obtain benchmark values. 

If you have any issues with the code, let me know.

Best,
Tore]]></description>
		<content:encoded><![CDATA[<p>Adam,</p>
<p>Great that you are considering the tie weights in the network.</p>
<p>The small_world_test_w-function was removed from tnet since many people had issues understanding exactly what it did. There is hopefully a paper coming out soon that details the steps of it, so then it might be re-introduced. </p>
<p>In the meantime, you can calculate the individual measures yourself as the underlying functions are still part of tnet. In particular, you can create a list-object with random networks, and then use the sapply-function with the distance_w to obtain benchmark values. </p>
<p>If you have any issues with the code, let me know.</p>
<p>Best,<br />
Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Adam</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-1684</link>
		<dc:creator><![CDATA[Adam]]></dc:creator>
		<pubDate>Fri, 27 May 2011 12:05:51 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1684</guid>
		<description><![CDATA[Dear Dr. Opsahl,

I&#039;m a social network novice. I am working with a weighted and directional network and I want to test the &quot;small world effect&quot; with tnet package.  But the tnet showed an error message: Error: could not find function &quot;small_world_test_w&quot;. Could you help me?

Adam]]></description>
		<content:encoded><![CDATA[<p>Dear Dr. Opsahl,</p>
<p>I&#8217;m a social network novice. I am working with a weighted and directional network and I want to test the &#8220;small world effect&#8221; with tnet package.  But the tnet showed an error message: Error: could not find function &#8220;small_world_test_w&#8221;. Could you help me?</p>
<p>Adam</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-1611</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Fri, 13 May 2011 21:22:15 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1611</guid>
		<description><![CDATA[Liz,

An alpha closer to 1 would indeed do that. Nevertheless, the values of alpha still remain a bit of a question mark as simply the ranges are defined, but not exact values. I hope a study will come that assess optimal levels of alpha for various performance outcomes comes out soon (see the conclusion section of the paper for more details). 

Tore]]></description>
		<content:encoded><![CDATA[<p>Liz,</p>
<p>An alpha closer to 1 would indeed do that. Nevertheless, the values of alpha still remain a bit of a question mark as simply the ranges are defined, but not exact values. I hope a study will come that assess optimal levels of alpha for various performance outcomes comes out soon (see the conclusion section of the paper for more details). </p>
<p>Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Liz</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-1610</link>
		<dc:creator><![CDATA[Liz]]></dc:creator>
		<pubDate>Fri, 13 May 2011 14:26:30 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1610</guid>
		<description><![CDATA[Thank you very much! One follow-up question: If I want to put greater emphasis on the weight of the ties than the number of ties would I just choose an alpha value somewhere between 0.5 and 1? I know that an alpha value above 1 positively values the weight and negatively values the number of ties. However, I still want both to have a positive effect, just not equally. Again, sorry for the basic question.

Thank you,
Liz]]></description>
		<content:encoded><![CDATA[<p>Thank you very much! One follow-up question: If I want to put greater emphasis on the weight of the ties than the number of ties would I just choose an alpha value somewhere between 0.5 and 1? I know that an alpha value above 1 positively values the weight and negatively values the number of ties. However, I still want both to have a positive effect, just not equally. Again, sorry for the basic question.</p>
<p>Thank you,<br />
Liz</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-1608</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Fri, 13 May 2011 06:48:25 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1608</guid>
		<description><![CDATA[Liz,

Thank you for using tnet.

You are absolutely correct on both your assumptions. All one-mode functions in tnet are applicable to directed networks, except when explicitly mentioned (i.e., the local clustering coefficient). Also, you might want to have a look at this post on &lt;a href=&quot;http://toreopsahl.com/2010/03/20/closeness-centrality-in-networks-with-disconnected-components/&quot; rel=&quot;nofollow&quot;&gt;Closeness centrality in networks with disconnected components&lt;/a&gt; as directed networks often do not have just a single strong component (all nodes can reach all other). This feature you can use with (1) the binary measure, alpha=0, (2) the first generation generalisation, alpha=1, and (3) the second generalisation with variable alpha. 

Hope this helps,
Tore]]></description>
		<content:encoded><![CDATA[<p>Liz,</p>
<p>Thank you for using tnet.</p>
<p>You are absolutely correct on both your assumptions. All one-mode functions in tnet are applicable to directed networks, except when explicitly mentioned (i.e., the local clustering coefficient). Also, you might want to have a look at this post on <a href="http://toreopsahl.com/2010/03/20/closeness-centrality-in-networks-with-disconnected-components/" rel="nofollow">Closeness centrality in networks with disconnected components</a> as directed networks often do not have just a single strong component (all nodes can reach all other). This feature you can use with (1) the binary measure, alpha=0, (2) the first generation generalisation, alpha=1, and (3) the second generalisation with variable alpha. </p>
<p>Hope this helps,<br />
Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Liz</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-1606</link>
		<dc:creator><![CDATA[Liz]]></dc:creator>
		<pubDate>Thu, 12 May 2011 21:46:13 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1606</guid>
		<description><![CDATA[Dear Dr. Opsahl,

Thank you so much for posting all of this information and for creating tnet! Being a social network novice, your papers and blog have been invaluable in my slog through the literature.

I do have two questions. First, I am working with a weighted and directional network and I want to calculate the closeness of each node. Am I right in thinking that the closeness_w function takes directionality into account? This looks to be the case based on the R documentation, but I thought I should check before I go ahead using the values.

Second, I read your 2010 paper in Social Networks and I wanted to clarify my understanding of alpha. As I understand it, if I want to take both the weight of the ties and the number ties for each node equally into account when calculating degree, closeness and betweenness, I should be using an alpha value between 0 and 1 (e.g. a=0.5). Is this correct? Sorry for the simple questions, but as I said, I&#039;m very new to all of this and struggling to understand the basics.

Thank you very much in advance!
Liz]]></description>
		<content:encoded><![CDATA[<p>Dear Dr. Opsahl,</p>
<p>Thank you so much for posting all of this information and for creating tnet! Being a social network novice, your papers and blog have been invaluable in my slog through the literature.</p>
<p>I do have two questions. First, I am working with a weighted and directional network and I want to calculate the closeness of each node. Am I right in thinking that the closeness_w function takes directionality into account? This looks to be the case based on the R documentation, but I thought I should check before I go ahead using the values.</p>
<p>Second, I read your 2010 paper in Social Networks and I wanted to clarify my understanding of alpha. As I understand it, if I want to take both the weight of the ties and the number ties for each node equally into account when calculating degree, closeness and betweenness, I should be using an alpha value between 0 and 1 (e.g. a=0.5). Is this correct? Sorry for the simple questions, but as I said, I&#8217;m very new to all of this and struggling to understand the basics.</p>
<p>Thank you very much in advance!<br />
Liz</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-1242</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Tue, 14 Dec 2010 07:23:06 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1242</guid>
		<description><![CDATA[Mike,

Thank you for finding tnet helpful. Some of my thoughts on projecting (binary and weighted) two-mode networks are &lt;a href=&quot;http://toreopsahl.com/2009/05/01/projecting-two-mode-networks-onto-weighted-one-mode-networks/&quot; rel=&quot;nofollow&quot;&gt;available here&lt;/a&gt;.

Tore]]></description>
		<content:encoded><![CDATA[<p>Mike,</p>
<p>Thank you for finding tnet helpful. Some of my thoughts on projecting (binary and weighted) two-mode networks are <a href="http://toreopsahl.com/2009/05/01/projecting-two-mode-networks-onto-weighted-one-mode-networks/" rel="nofollow">available here</a>.</p>
<p>Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mike sanders</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-1241</link>
		<dc:creator><![CDATA[Mike sanders]]></dc:creator>
		<pubDate>Tue, 14 Dec 2010 06:28:06 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1241</guid>
		<description><![CDATA[I&#039;d like to thank you for the tnet package, I&#039;ve just recently installed it and found it quite helpful. I had a question for you, if I were dealing with a two-mode network consisting of &#039;items vs containers&#039; and the elements were the frequency counts of the items in each container, what would be the best method for projecting it to a one-mode network of bins? In the SNA literature they use transpose multiplication but that doesn&#039;t give a meaningful representation in the case of weighted networks (but works for binary relations). Any ideas or thoughts would be greatly appreciated.

Thank you,
Mike]]></description>
		<content:encoded><![CDATA[<p>I&#8217;d like to thank you for the tnet package, I&#8217;ve just recently installed it and found it quite helpful. I had a question for you, if I were dealing with a two-mode network consisting of &#8216;items vs containers&#8217; and the elements were the frequency counts of the items in each container, what would be the best method for projecting it to a one-mode network of bins? In the SNA literature they use transpose multiplication but that doesn&#8217;t give a meaningful representation in the case of weighted networks (but works for binary relations). Any ideas or thoughts would be greatly appreciated.</p>
<p>Thank you,<br />
Mike</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-1166</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Thu, 07 Oct 2010 08:47:05 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1166</guid>
		<description><![CDATA[If you send me your data and code by email, I can have a look at it.]]></description>
		<content:encoded><![CDATA[<p>If you send me your data and code by email, I can have a look at it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Manal Rayes</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-1164</link>
		<dc:creator><![CDATA[Manal Rayes]]></dc:creator>
		<pubDate>Mon, 04 Oct 2010 16:11:03 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1164</guid>
		<description><![CDATA[Thank you Tore. I managed to write a code to account for the timing info. I got the results of betweenness and closeness, but the clustering showed an error message: Error in rep(1:nrow(net), ks) : invalid &#039;times&#039; argument.
Any hints please?]]></description>
		<content:encoded><![CDATA[<p>Thank you Tore. I managed to write a code to account for the timing info. I got the results of betweenness and closeness, but the clustering showed an error message: Error in rep(1:nrow(net), ks) : invalid &#8216;times&#8217; argument.<br />
Any hints please?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-1163</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Mon, 04 Oct 2010 09:57:40 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1163</guid>
		<description><![CDATA[Manal,

tnet will only be able to handle longitudinal networks from version 3. These functions are still being tested.

Best,
Tore]]></description>
		<content:encoded><![CDATA[<p>Manal,</p>
<p>tnet will only be able to handle longitudinal networks from version 3. These functions are still being tested.</p>
<p>Best,<br />
Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Manal Rayes</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-1162</link>
		<dc:creator><![CDATA[Manal Rayes]]></dc:creator>
		<pubDate>Mon, 04 Oct 2010 08:34:41 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1105#comment-1162</guid>
		<description><![CDATA[Dr. Tore,
Thanks for the great tool! I have an issue, though.
I have a longitudinal network that I read from a csv file. When using the as.tnet function it shows an error message: Issues converting matrix format to edgelist.
It is in data-frame format.

Would appreciate your kind help.

Regards]]></description>
		<content:encoded><![CDATA[<p>Dr. Tore,<br />
Thanks for the great tool! I have an issue, though.<br />
I have a longitudinal network that I read from a csv file. When using the as.tnet function it shows an error message: Issues converting matrix format to edgelist.<br />
It is in data-frame format.</p>
<p>Would appreciate your kind help.</p>
<p>Regards</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/06/12/tnet-software-for-analysing-weighted-networks/#comment-979</link>
		<dc:creator><![CDATA[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><![CDATA[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><![CDATA[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><![CDATA[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>

