<?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 for Tore Opsahl</title>
	<atom:link href="http://toreopsahl.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://toreopsahl.com</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>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Tore Opsahl</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1152</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Tue, 24 Aug 2010 19:03:46 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1152</guid>
		<description>Hi MJ,

I am not aware of any general literature on this topic. You could have a look at the Fernandez and Gould-paper that does something similar with brokerage measures. They define - based on directionality, which your data should have - various roles based on ego networks. 

Best,
Tore</description>
		<content:encoded><![CDATA[<p>Hi MJ,</p>
<p>I am not aware of any general literature on this topic. You could have a look at the Fernandez and Gould-paper that does something similar with brokerage measures. They define &#8211; based on directionality, which your data should have &#8211; various roles based on ego networks. </p>
<p>Best,<br />
Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by minjung</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1151</link>
		<dc:creator>minjung</dc:creator>
		<pubDate>Tue, 24 Aug 2010 12:55:57 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1151</guid>
		<description>Hi tore!
Thanks for sharing ur great works. It&#039;s really helpful for me to understand
the concepts about centrality.
I just wondering u can give me some advice.
Im working on a project that analyzing the customers of mobile company and doing SNS.  That is, i have to find the community among the customers and define the leader, who is influential to other customers. 
So i detect the community(cluster) and i got the degree centrality, closeness centrality, between centrality of each nodes within a cluster. 
And NOW, i have to assign roles to each node; leader, sub-leader,follower and outliers. 

Do u think i can just assign roles based on three centrality? for example, 
make the one with big centralites as a leader. Centrality can be the measure of influence within the community? 


Thanks in advance,
MJ</description>
		<content:encoded><![CDATA[<p>Hi tore!<br />
Thanks for sharing ur great works. It&#8217;s really helpful for me to understand<br />
the concepts about centrality.<br />
I just wondering u can give me some advice.<br />
Im working on a project that analyzing the customers of mobile company and doing SNS.  That is, i have to find the community among the customers and define the leader, who is influential to other customers.<br />
So i detect the community(cluster) and i got the degree centrality, closeness centrality, between centrality of each nodes within a cluster.<br />
And NOW, i have to assign roles to each node; leader, sub-leader,follower and outliers. </p>
<p>Do u think i can just assign roles based on three centrality? for example,<br />
make the one with big centralites as a leader. Centrality can be the measure of influence within the community? </p>
<p>Thanks in advance,<br />
MJ</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Tore Opsahl</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1149</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Thu, 19 Aug 2010 13:42:27 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1149</guid>
		<description>Nitesh,

You can look at my paper called Clustering in Weighted Networks for determining the level of clustering / cliqueness in a network. But if you would like to find the specific cliques or communities, I would suggest you contact some of the community detection guys. Also, you might want to have a look at the book Generalized Blockmodeling by Dorian, Batagelj, and Ferligoj.

Tore</description>
		<content:encoded><![CDATA[<p>Nitesh,</p>
<p>You can look at my paper called Clustering in Weighted Networks for determining the level of clustering / cliqueness in a network. But if you would like to find the specific cliques or communities, I would suggest you contact some of the community detection guys. Also, you might want to have a look at the book Generalized Blockmodeling by Dorian, Batagelj, and Ferligoj.</p>
<p>Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Nitesh</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1148</link>
		<dc:creator>Nitesh</dc:creator>
		<pubDate>Thu, 19 Aug 2010 12:35:02 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1148</guid>
		<description>Hi Tore,

Thanks for your response. As you mentioned before, by copying the iconv.dll file in igraph-libs, it worked.

Can you suggest me something about cliques in weighted graphs. I have seen your related to node centrality and clustering coefficient. 
Just wondering, if you have any ideas on finding cliques in weighted graph. 

Regard
Nitesh</description>
		<content:encoded><![CDATA[<p>Hi Tore,</p>
<p>Thanks for your response. As you mentioned before, by copying the iconv.dll file in igraph-libs, it worked.</p>
<p>Can you suggest me something about cliques in weighted graphs. I have seen your related to node centrality and clustering coefficient.<br />
Just wondering, if you have any ideas on finding cliques in weighted graph. </p>
<p>Regard<br />
Nitesh</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Weighted Rich-club Effect: A more appropriate null model for scientific collaboration networks by Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/05/29/weighted-rich-club-effect-a-more-appropriate-null-model-for-scientific-collaboration-networks/#comment-1147</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Thu, 19 Aug 2010 12:30:29 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1158#comment-1147</guid>
		<description>Samir,

This was due to a problem with the igraph-package. The guys behind that package (Gabor Csardi) have just submitted a new version of their R-package that should solve this issue. As soon as it has been approved by CRAN and disseminated across the servers, you should be able to get it by writing update.packages() in R.

Tore</description>
		<content:encoded><![CDATA[<p>Samir,</p>
<p>This was due to a problem with the igraph-package. The guys behind that package (Gabor Csardi) have just submitted a new version of their R-package that should solve this issue. As soon as it has been approved by CRAN and disseminated across the servers, you should be able to get it by writing update.packages() in R.</p>
<p>Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Tore Opsahl</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1146</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Thu, 19 Aug 2010 12:28:58 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1146</guid>
		<description>Nitesh,

The igraph-guys (Gabor Csardi) have just submitted a new version of their R-package that should solve this issue. As soon as it has been approved by CRAN and disseminated across the servers, you should be able to get it by writing update.packages() in R.

Tore</description>
		<content:encoded><![CDATA[<p>Nitesh,</p>
<p>The igraph-guys (Gabor Csardi) have just submitted a new version of their R-package that should solve this issue. As soon as it has been approved by CRAN and disseminated across the servers, you should be able to get it by writing update.packages() in R.</p>
<p>Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Nitesh</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1145</link>
		<dc:creator>Nitesh</dc:creator>
		<pubDate>Wed, 18 Aug 2010 15:56:40 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1145</guid>
		<description>Many thanks Tore,

Nitesh</description>
		<content:encoded><![CDATA[<p>Many thanks Tore,</p>
<p>Nitesh</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Tore Opsahl</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1144</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Wed, 18 Aug 2010 14:52:45 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1144</guid>
		<description>Nitesh,

Thanks for taking an interest in tnet. This is an issue with the igraph-package that tnet depends on. You can fix it by copying the iconv.dll from a previous version of igraph (or email me). I have sent them a bug report - hopefully they will have it sorted soon.

Best,
Tore</description>
		<content:encoded><![CDATA[<p>Nitesh,</p>
<p>Thanks for taking an interest in tnet. This is an issue with the igraph-package that tnet depends on. You can fix it by copying the iconv.dll from a previous version of igraph (or email me). I have sent them a bug report &#8211; hopefully they will have it sorted soon.</p>
<p>Best,<br />
Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Nitesh</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1143</link>
		<dc:creator>Nitesh</dc:creator>
		<pubDate>Wed, 18 Aug 2010 14:37:16 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1143</guid>
		<description>Hi Tore,

Great work!!

Just having problem in installing tnet package in R 2.11.1. 

The error I am getting is 

Loading required package: igraph
Error : .onLoad failed in loadNamespace() for &#039;igraph&#039;, details:
  call: inDL(x, as.logical(local), as.logical(now), ...)
  error: unable to load shared library &#039;C:/PROGRA~1/R/R-211~1.1/library/igraph/libs/igraph.dll&#039;:
  LoadLibrary failure:  The specified module could not be found.


Error: package &#039;igraph&#039; could not be loaded

In the pop window, it is showing that iconv.dll file was not found.. 

Can you help me please??</description>
		<content:encoded><![CDATA[<p>Hi Tore,</p>
<p>Great work!!</p>
<p>Just having problem in installing tnet package in R 2.11.1. </p>
<p>The error I am getting is </p>
<p>Loading required package: igraph<br />
Error : .onLoad failed in loadNamespace() for &#8216;igraph&#8217;, details:<br />
  call: inDL(x, as.logical(local), as.logical(now), &#8230;)<br />
  error: unable to load shared library &#8216;C:/PROGRA~1/R/R-211~1.1/library/igraph/libs/igraph.dll&#8217;:<br />
  LoadLibrary failure:  The specified module could not be found.</p>
<p>Error: package &#8216;igraph&#8217; could not be loaded</p>
<p>In the pop window, it is showing that iconv.dll file was not found.. </p>
<p>Can you help me please??</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Weighted Rich-club Effect: A more appropriate null model for scientific collaboration networks by Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/05/29/weighted-rich-club-effect-a-more-appropriate-null-model-for-scientific-collaboration-networks/#comment-1142</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Tue, 17 Aug 2010 14:55:47 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1158#comment-1142</guid>
		<description>Samir,

Thank you for taking an interest in my work, and tnet. 

tnet requires that igraph is installed as this package does some of these computationally heavy stuff in C++ and tnet is solely written in R. 

Did you install tnet using the install.packages(&quot;tnet&quot;)-command? If so, igraph should have automatiically been installed. Also, try to run update.packages() to see whether an update could sort the packages out. If none of these things work, please contact me offline.

Best,

Tore</description>
		<content:encoded><![CDATA[<p>Samir,</p>
<p>Thank you for taking an interest in my work, and tnet. </p>
<p>tnet requires that igraph is installed as this package does some of these computationally heavy stuff in C++ and tnet is solely written in R. </p>
<p>Did you install tnet using the install.packages(&#8220;tnet&#8221;)-command? If so, igraph should have automatiically been installed. Also, try to run update.packages() to see whether an update could sort the packages out. If none of these things work, please contact me offline.</p>
<p>Best,</p>
<p>Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Weighted Rich-club Effect: A more appropriate null model for scientific collaboration networks by Samir</title>
		<link>http://toreopsahl.com/2009/05/29/weighted-rich-club-effect-a-more-appropriate-null-model-for-scientific-collaboration-networks/#comment-1141</link>
		<dc:creator>Samir</dc:creator>
		<pubDate>Mon, 16 Aug 2010 22:22:44 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=1158#comment-1141</guid>
		<description>Dear Tore,
thank you for the beautiful blog.

I installed R on my pc andI installed the package tnet.
If i compute your code, R give me an error: 
&quot;Loading required package: igraph
Error : .onLoad failed in loadNamespace() for &#039;igraph&#039;, details:
call: inDL(x, as.logical(local), as.logical(now), ...)
error: unable to load shared library &#039;C:/Users/ssuweis/Documents/R/win-library/2.11/igraph/libs/igraph.dll&#039;:
LoadLibrary failure:  The specified module could not be found.&quot;

So I installed also the package &quot;igraph&quot; and I tried to load it, but a new error appear:

&quot;Error: package/namespace load failed for &#039;igraph&#039;&quot;

Of course I have set the directory in the folder where I have my &quot;personal library&quot;&#039;, so I cannot understand why I cannot load both tnet and igraph package.

I think it is a trivial problem that occurs to beginners in R like me, andI tried to google the latter error, but I did not find any useful suggestions..If you can help I really appreciate it!

Thanks and best

Samir</description>
		<content:encoded><![CDATA[<p>Dear Tore,<br />
thank you for the beautiful blog.</p>
<p>I installed R on my pc andI installed the package tnet.<br />
If i compute your code, R give me an error:<br />
&#8220;Loading required package: igraph<br />
Error : .onLoad failed in loadNamespace() for &#8216;igraph&#8217;, details:<br />
call: inDL(x, as.logical(local), as.logical(now), &#8230;)<br />
error: unable to load shared library &#8216;C:/Users/ssuweis/Documents/R/win-library/2.11/igraph/libs/igraph.dll&#8217;:<br />
LoadLibrary failure:  The specified module could not be found.&#8221;</p>
<p>So I installed also the package &#8220;igraph&#8221; and I tried to load it, but a new error appear:</p>
<p>&#8220;Error: package/namespace load failed for &#8216;igraph&#8217;&#8221;</p>
<p>Of course I have set the directory in the folder where I have my &#8220;personal library&#8221;&#8216;, so I cannot understand why I cannot load both tnet and igraph package.</p>
<p>I think it is a trivial problem that occurs to beginners in R like me, andI tried to google the latter error, but I did not find any useful suggestions..If you can help I really appreciate it!</p>
<p>Thanks and best</p>
<p>Samir</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Mauricio</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1138</link>
		<dc:creator>Mauricio</dc:creator>
		<pubDate>Wed, 11 Aug 2010 13:23:57 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1138</guid>
		<description>Hi Tore, 
Thank you for your reply, it&#039;s fixed my problem!!
I didn&#039;t notice this detail in the post. I was following the help(degree_w) from the tnet package, and I got confused.
With many thanks,
M</description>
		<content:encoded><![CDATA[<p>Hi Tore,<br />
Thank you for your reply, it&#8217;s fixed my problem!!<br />
I didn&#8217;t notice this detail in the post. I was following the help(degree_w) from the tnet package, and I got confused.<br />
With many thanks,<br />
M</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Tore Opsahl</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1137</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Wed, 11 Aug 2010 00:37:42 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1137</guid>
		<description>Mauricio,

You need to include alpha in the measure-parameter. 

Tore

[sourcecode language=&quot;text&quot;]
#Load tnet and network
library(tnet)
net &lt;- cbind(  
i=c(1,1,2,2,2,2,3,3,4,5,5,6),  
j=c(2,3,1,3,4,5,1,2,2,2,6,5),  
w=c(4,2,4,4,1,2,2,4,1,2,1,1))  

# Run function
degree_w(net, measure=c(&quot;degree&quot;, &quot;output&quot;, &quot;alpha&quot;), alpha=0.5)

# Output
     node degree output    alpha
[1,]    1      2      6 3.464102
[2,]    2      4     11 6.633250
[3,]    3      2      6 3.464102
[4,]    4      1      1 1.000000
[5,]    5      2      3 2.449490
[6,]    6      1      1 1.000000
[/sourcecode]</description>
		<content:encoded><![CDATA[<p>Mauricio,</p>
<p>You need to include alpha in the measure-parameter. </p>
<p>Tore</p>
<pre class="brush: plain;">
#Load tnet and network
library(tnet)
net &lt;- cbind(
i=c(1,1,2,2,2,2,3,3,4,5,5,6),
j=c(2,3,1,3,4,5,1,2,2,2,6,5),
w=c(4,2,4,4,1,2,2,4,1,2,1,1))  

# Run function
degree_w(net, measure=c(&quot;degree&quot;, &quot;output&quot;, &quot;alpha&quot;), alpha=0.5)

# Output
     node degree output    alpha
[1,]    1      2      6 3.464102
[2,]    2      4     11 6.633250
[3,]    3      2      6 3.464102
[4,]    4      1      1 1.000000
[5,]    5      2      3 2.449490
[6,]    6      1      1 1.000000
</pre>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Mauricio</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1136</link>
		<dc:creator>Mauricio</dc:creator>
		<pubDate>Tue, 10 Aug 2010 14:19:01 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1136</guid>
		<description>Hi Tore,
Thanks for your very good work.

I&#039;m trying to calculate the degree_w for my data, but it seems that the output is always equivalent when alpha is set as 1. Even for the sample network in this post, I got the same results when varying the alpha parameter...
Please, could you tell me what is my mistake here?
With many thanks

Mauricio

&gt; degree_w(net,measure=c(&quot;degree&quot;,&quot;output&quot;), type=&quot;out&quot;, alpha=1)
     node degree output
[1,]    1      2      6
[2,]    2      4     11
[3,]    3      2      6
[4,]    4      1      1
[5,]    5      2      3
[6,]    6      1      1
&gt; degree_w(net,measure=c(&quot;degree&quot;,&quot;output&quot;), type=&quot;out&quot;, alpha=0.5)
     node degree output
[1,]    1      2      6
[2,]    2      4     11
[3,]    3      2      6
[4,]    4      1      1
[5,]    5      2      3
[6,]    6      1      1</description>
		<content:encoded><![CDATA[<p>Hi Tore,<br />
Thanks for your very good work.</p>
<p>I&#8217;m trying to calculate the degree_w for my data, but it seems that the output is always equivalent when alpha is set as 1. Even for the sample network in this post, I got the same results when varying the alpha parameter&#8230;<br />
Please, could you tell me what is my mistake here?<br />
With many thanks</p>
<p>Mauricio</p>
<p>&gt; degree_w(net,measure=c(&#8220;degree&#8221;,&#8221;output&#8221;), type=&#8221;out&#8221;, alpha=1)<br />
     node degree output<br />
[1,]    1      2      6<br />
[2,]    2      4     11<br />
[3,]    3      2      6<br />
[4,]    4      1      1<br />
[5,]    5      2      3<br />
[6,]    6      1      1<br />
&gt; degree_w(net,measure=c(&#8220;degree&#8221;,&#8221;output&#8221;), type=&#8221;out&#8221;, alpha=0.5)<br />
     node degree output<br />
[1,]    1      2      6<br />
[2,]    2      4     11<br />
[3,]    3      2      6<br />
[4,]    4      1      1<br />
[5,]    5      2      3<br />
[6,]    6      1      1</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Patterns and Dynamics of Users&#8217; Behaviour and Interaction: Network Analysis of an Online Community by Bernie Hogan</title>
		<link>http://toreopsahl.com/2009/03/06/article-patterns-and-dynamics-of-users-behaviour-and-interaction-network-analysis-of-an-online-community/#comment-1135</link>
		<dc:creator>Bernie Hogan</dc:creator>
		<pubDate>Mon, 09 Aug 2010 15:17:03 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=659#comment-1135</guid>
		<description>It was indeed in the May 2009 issue. Here&#039;s the &lt;a href=&quot;http://onlinelibrary.wiley.com/doi/10.1002/asi.21015/full&quot; rel=&quot;nofollow&quot;&gt;direct link.&lt;/a&gt;</description>
		<content:encoded><![CDATA[<p>It was indeed in the May 2009 issue. Here&#8217;s the <a href="http://onlinelibrary.wiley.com/doi/10.1002/asi.21015/full" rel="nofollow">direct link.</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Projecting two-mode networks onto weighted one-mode networks by Social Technology</title>
		<link>http://toreopsahl.com/2009/05/01/projecting-two-mode-networks-onto-weighted-one-mode-networks/#comment-1134</link>
		<dc:creator>Social Technology</dc:creator>
		<pubDate>Mon, 02 Aug 2010 21:06:06 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=782#comment-1134</guid>
		<description>Good and Bad Social Technology... I found your entry interesting thus I&#039;ve added a Trackback to it on my weblog :)...</description>
		<content:encoded><![CDATA[<p>Good and Bad Social Technology&#8230; I found your entry interesting thus I&#8217;ve added a Trackback to it on my weblog :)&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Datasets by Tore Opsahl</title>
		<link>http://toreopsahl.com/datasets/#comment-1132</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Mon, 26 Jul 2010 17:31:38 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?page_id=846#comment-1132</guid>
		<description>Arash,

That entirely depend on your raw data. R is great for manipulating data: have a look at Quick-R, http://www.statmethods.net/, for an introduction.

Best,
Tore</description>
		<content:encoded><![CDATA[<p>Arash,</p>
<p>That entirely depend on your raw data. R is great for manipulating data: have a look at Quick-R, <a href="http://www.statmethods.net/" rel="nofollow">http://www.statmethods.net/</a>, for an introduction.</p>
<p>Best,<br />
Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Datasets by Arash</title>
		<link>http://toreopsahl.com/datasets/#comment-1129</link>
		<dc:creator>Arash</dc:creator>
		<pubDate>Mon, 26 Jul 2010 03:40:27 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?page_id=846#comment-1129</guid>
		<description>Dear Dr.Tore : 
How can I convert the raw data of a database into a structured form of dataset, like datasets which you have uploaded ?</description>
		<content:encoded><![CDATA[<p>Dear Dr.Tore :<br />
How can I convert the raw data of a database into a structured form of dataset, like datasets which you have uploaded ?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Tore Opsahl</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1126</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Sat, 24 Jul 2010 16:15:04 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1126</guid>
		<description>Hi Ben,

I have actually made those in illustrator / photoshop. Not recommended, but that method enables you to make the graphs exactly as you want.  

Best,
Tore</description>
		<content:encoded><![CDATA[<p>Hi Ben,</p>
<p>I have actually made those in illustrator / photoshop. Not recommended, but that method enables you to make the graphs exactly as you want.  </p>
<p>Best,<br />
Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Ben</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1125</link>
		<dc:creator>Ben</dc:creator>
		<pubDate>Sat, 24 Jul 2010 10:19:11 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1125</guid>
		<description>Hi Tore,

What kind of software do you use for drawing your graph pictures?

For example, this one:

http://thetore.files.wordpress.com/2008/12/fig1.png?w=271&amp;h=177

Thanks,
Ben</description>
		<content:encoded><![CDATA[<p>Hi Tore,</p>
<p>What kind of software do you use for drawing your graph pictures?</p>
<p>For example, this one:</p>
<p><a href="http://thetore.files.wordpress.com/2008/12/fig1.png?w=271&amp;h=177" rel="nofollow">http://thetore.files.wordpress.com/2008/12/fig1.png?w=271&amp;h=177</a></p>
<p>Thanks,<br />
Ben</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Marco</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1119</link>
		<dc:creator>Marco</dc:creator>
		<pubDate>Wed, 30 Jun 2010 10:18:54 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1119</guid>
		<description>Hi Tore,

got a quick question, maybe you can help me: I&#039;m calculating the EigenValues of a Matrix, but R provides me only ordered values..is there a way to have unordered results?

Thnaks in advance

Marco</description>
		<content:encoded><![CDATA[<p>Hi Tore,</p>
<p>got a quick question, maybe you can help me: I&#8217;m calculating the EigenValues of a Matrix, but R provides me only ordered values..is there a way to have unordered results?</p>
<p>Thnaks in advance</p>
<p>Marco</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Thor Sigfusson</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1113</link>
		<dc:creator>Thor Sigfusson</dc:creator>
		<pubDate>Thu, 24 Jun 2010 11:30:52 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1113</guid>
		<description>Dear Tore,

It worked.  Thanks a lot.

Thor</description>
		<content:encoded><![CDATA[<p>Dear Tore,</p>
<p>It worked.  Thanks a lot.</p>
<p>Thor</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Datasets by Tore Opsahl</title>
		<link>http://toreopsahl.com/datasets/#comment-1109</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Sat, 19 Jun 2010 10:19:13 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?page_id=846#comment-1109</guid>
		<description>For undirected networks, each tie should be mentioned twice -- one in each direction. You can use the symmetrise-function to do this. Let me know if you have further issues after running this command.

Tore</description>
		<content:encoded><![CDATA[<p>For undirected networks, each tie should be mentioned twice &#8212; one in each direction. You can use the symmetrise-function to do this. Let me know if you have further issues after running this command.</p>
<p>Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Datasets by jay</title>
		<link>http://toreopsahl.com/datasets/#comment-1107</link>
		<dc:creator>jay</dc:creator>
		<pubDate>Thu, 17 Jun 2010 08:26:32 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?page_id=846#comment-1107</guid>
		<description>Hi Tore,

I am trying to use tnet for a behavioral dataset as a trial, I tried an undirected network .

sampledata &lt;- rbind(
c(1,2,3),
c(1,3,2),
c(2,3,4),
c(2,4,5),
c(2,5,2),
c(6,5,1))

and used the weighted_richclub_w() function on the above. I find that for directed=FALSE and for rich=&quot;k&quot; and reshuffle=&quot;weights&quot;, it gives the following error message:

&quot;Error in random.m[i, j + 1] &lt;- random.phi[which(random.phi[, &quot;x&quot;] == j),  : 
  subscript out of bounds&quot;

The same error appears for rich=&quot;k&quot; and reshuffle=&quot;links&quot; with directed=FALSE

With directed=NULL there is no error ! 

1. I don&#039;t understand why it gave an error with directed=FALSE even though the input was actually an undirected network.

2. For the case of directed weighted network, how is the generalization done for null models weight reshuffle and weights &amp; links reshuffle of your PRL 101 paper ? 

3. Does the combination rich=&quot;k&quot;, reshuffle=&quot;links&quot; correspond to weight reshuffle, and rich=&quot;k&quot;, reshuffle=&quot;weights&quot; correspond to weights &amp; links reshuffle and rich=&quot;s&quot;, reshuffle=&quot;weights.local&quot; correspond to directed reshuffle null model of your PRL 101 paper ? 

Your comments on these will help me apply tnet to my data.

ciao,
jay</description>
		<content:encoded><![CDATA[<p>Hi Tore,</p>
<p>I am trying to use tnet for a behavioral dataset as a trial, I tried an undirected network .</p>
<p>sampledata &lt;- rbind(<br />
c(1,2,3),<br />
c(1,3,2),<br />
c(2,3,4),<br />
c(2,4,5),<br />
c(2,5,2),<br />
c(6,5,1))</p>
<p>and used the weighted_richclub_w() function on the above. I find that for directed=FALSE and for rich=&quot;k&quot; and reshuffle=&quot;weights&quot;, it gives the following error message:</p>
<p>&quot;Error in random.m[i, j + 1] &lt;- random.phi[which(random.phi[, &quot;x&quot;] == j),  :<br />
  subscript out of bounds&quot;</p>
<p>The same error appears for rich=&quot;k&quot; and reshuffle=&quot;links&quot; with directed=FALSE</p>
<p>With directed=NULL there is no error ! </p>
<p>1. I don&#039;t understand why it gave an error with directed=FALSE even though the input was actually an undirected network.</p>
<p>2. For the case of directed weighted network, how is the generalization done for null models weight reshuffle and weights &amp; links reshuffle of your PRL 101 paper ? </p>
<p>3. Does the combination rich=&quot;k&quot;, reshuffle=&quot;links&quot; correspond to weight reshuffle, and rich=&quot;k&quot;, reshuffle=&quot;weights&quot; correspond to weights &amp; links reshuffle and rich=&quot;s&quot;, reshuffle=&quot;weights.local&quot; correspond to directed reshuffle null model of your PRL 101 paper ? </p>
<p>Your comments on these will help me apply tnet to my data.</p>
<p>ciao,<br />
jay</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Article: Node centrality in weighted networks: Generalizing degree and shortest paths by Tore Opsahl</title>
		<link>http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/#comment-1095</link>
		<dc:creator>Tore Opsahl</dc:creator>
		<pubDate>Tue, 15 Jun 2010 06:01:06 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=2204#comment-1095</guid>
		<description>Hi Thor,

tnet cannot -so far- handle node labels, so they are simply the id numbers of the nodes. 

The best way to enter larger networks is to load an edgelist file. You can do this by arranging your data in a txt file like this:

1  5 5
1 12 5
1 19 5
1 21 5
1 4 1
....

Then write in R: net &lt;- read.table(&quot;filename.txt&quot;)

Hope this helps,

Tore</description>
		<content:encoded><![CDATA[<p>Hi Thor,</p>
<p>tnet cannot -so far- handle node labels, so they are simply the id numbers of the nodes. </p>
<p>The best way to enter larger networks is to load an edgelist file. You can do this by arranging your data in a txt file like this:</p>
<p>1  5 5<br />
1 12 5<br />
1 19 5<br />
1 21 5<br />
1 4 1<br />
&#8230;.</p>
<p>Then write in R: net &lt;- read.table(&quot;filename.txt&quot;)</p>
<p>Hope this helps,</p>
<p>Tore</p>
]]></content:encoded>
	</item>
</channel>
</rss>
