similar to: fit a line to power law distribution

Hi, I am trying to fit a line in the log plot of my networks degree distribution to show that it is a power-law distribution. I am using the following commands. However, I am not able to see the fitted line. Any comments to help? I am using following packages: igraph, splines,base,VGAM, netmodels. g is my network, d is the degree of nodes in the network, and dd is the degree distribution d

Dear all , I am trying to install a package by name 'netmodels' keep on getting the following error : > install.packages("netmodels") Warning in install.packages("netmodels") : argument 'lib' is missing: using '/usr/lib64/R/library' also installing the dependency ‘VGAM’ trying URL

Hi to all, does anybody knows whether there is a package to plot those http://www.equine-science.de/temp/graph.jpg graphs. the thickness of the points and/or the lines should be represent the numbers of behaviours With kind regards Knut

Oh, thanks, in my current case, I haven’t config “Address” parameter in A’s host config, is this will make A prohibited it listen on the tinc ports? Question: 1. if I config “Address” in A’s config, and even though A is in a private subnet, it might still possible for A to establish connection with X(X is public IP address)? 2. If there any parameter to disable the direct connection discovery,

H, Narcissus Quick one for the below case, if node A have a direct connection to node B, and node B have a connection to node X, then I found node A will be able to talk to node X, but the communication path is go through node B, instead of build direct connection between A and X, is that right? I tested this in my environment. A >> B >> X > On 1 May 2017, at 3:07 PM, Narcissus

Dear all, I'm using igraph for some analysis about the network I have. I have a question about the function "power.law.fit". I wonder if there is any test for checking whether the "power.law.fit" is good for the input, i.e., under which situation, could we use this function to get a reliable result. I'm afraid even I input a random graph without any property of

Does any one have Photoshop CS2 working? If so, can you please, for the benefit of all of us who cant seem to get it going, post detailed instructions on what you did? After several days of heavy googling ive come up with dozens of "i copied some files and registry keys and it worked" comments, but no actual instructions on what they did. Im starting to feel like Narcissus. Ive tried

I don't really think Address config in node description will decide it will listening for the public connection or not. From my own case, even if a real private node(pppoe dynamic address, tcp port listening not allowed, but Udp allowed) can have a p2p direct connection, I think it based on udp NAT traverse, but if you use TCPonly for this node, and also forbidden the incoming traffic to this

Indeed it depends, tinc will have a port listening for incoming connections(both tcp and udp), if A have exposed its listening ports, a direct connection will be tried to build between the nodes, otherwise it will go from the intermediate node. -- Narcissus Emi 日時: 2017年5月1日 15:12:16, Bright Zhao (startryst at gmail.com) が書きました:: > H, Narcissus > > Quick one for the below case, if

Hi, Tinc Expert in my tinc.conf, the ConnectTo to host X is commented, like below: #ConnectTo = X and there is a script: /etc/tinc/netname/hosts/X-up, I thought commented the ConnectTo X wouldn’t trigger the X-up, but it did. Why? What’s the logic behind to trigger host-up? How can I avoid this except remove the host-up file? Bright Zhao

Hi, I have two tinc nodes which announce default gate to internet. How does tinc select which node is prefered when I route to the tinc device and not a special ip? tinc 1.0.16 ALBI...

Hello R Help Team, I have created graph from weighted adjecency matrix .Is there a way I can find highly connected nodes in Igraph like the Package RBGL does. nathan -- View this message in context: http://www.nabble.com/Highly-Connected-Nodes-in-Igraph-tp22377522p22377522.html Sent from the R help mailing list archive at Nabble.com.

I'm trying to draw an arrow with a curved shaft on the graph as a straight one looks messy on a detailed graph. I've looked in arrows but it doesn't seem to give an option. larrows doesn't look much more promising. I had a look in the archive and couldn't find anything. Any thoughts? Thanks Paul -- View this message in context:

Hello, I`m not sure if in this list I can post this problem, but... I`m trying compile swfdec in windows platform (with mingw) and I find many errors in the make process, some in compilance process (some solve it). But I can?t solve the bellow problem in make process: make[3]: Entering directory `/home/Administrador/swfdec-0.4.3/player' /bin/sh ../libtool --tag=CC --mode=link gcc -g -O2

Dear colleagues, I'm trying to have a look at the Assortative and Disassortative ( http://en.wikipedia.org/wiki/Assortative_mixing) of the network I have. But it seems that the igraph hasn't mentioned that yet. I have to get the in/out degree of the vertices of each edge and calculate the Pearson's Correlation coefficient which seems to be quite a huge task for me. :( So I wonder if

Hi all, I'm very new to R and read a few tutorials, however I'm having difficulty trying to figure out how to plot a minimum spanning tree. I have a csv file that contains an n-by-n matrix of distances between strains of bacteria called matrix.csv. Looks like: id,strain1, strain2,strain3 strain1,0,.2,.8 strain2,.3,0,.7 strain3,.4,.6,0 I've been messing around with some information

Dear R users: There appears to be a conflict between the statnet package and the igraph package. With igraph loaded into memory, the network() function of statnet failed, returning the error to the effect that the matrix being converted was "not a graph object." Removing igraph from memory restored statnet to proper function. Apologies if this is redundant. I could not find this

Hi R-users, I'm using igraph for an undirected graph. i used clusters() igraph function to know the component size(subgraphs) as shown bellow: c <-clusters(g)    # component sizes size <- sort(c$csize, decreasing=TRUE) cat("Top 20 cluster of the graph","\n") for (i in 1:20) {   cat(i,"  size:",size[i] ,"\n") } Can anyone help how to extract the

Hi, I have a data set consisting of the x and y coordinate locations of 1600 points. I would like to generate a graph using the functions in igraph. However the graph making functions in igraph requires the data to be in the form of an adjacency matrix. I'd like some advice on how to convert my point pattern to an adjacency matrix or functions out there that would do it directly. I've

Dear R users, I am trying to draw a network using igraph package. I intend to place the hub nodes (the ones with the relatively more connection with other nodes) in the center of the graph. Also, the graph need to be in the fashion that the higher the correlation between two nodes is , the closer the two nodes will be. Is there any layout that can help or any other way to do this? Thanks in