similar to: Calculating Betweenness - Efficiency problem

Dear R helpers   I have a city.csv file as given below.   'city.csv' city_name1        city_name2 New York City    Buffallo         So I define   city_name = read.csv('city.csv') city1 = city_name$city_name1 city2 = city_name$city_name2   My problem is how do I repeat the names one after other say 10 times i.e. my output should be like   New York City Buffallo New York City

Dear all, I would like to save few variable-names with their values in a tabular form, with that I mean that files can be printed easily in R in a tabular form and also saved in a ascii file that when one opens it see also the variables in a nice tabular format. IS that possible? Below a small example of how should look results in R and in a txt file.              Postal Code | Superb

I am getting some unexpected results from some functions of igraph and it is possible that I am misinterpreting the vertex numbers. Eg., the max betweenness measure seems to be from a vertex that is not connected to a single other vertex. Below if my code snippet: require(igraph) my.graph <- graph.adjacency(adjmatrix = my.adj.matrix, mode=c("undirected")) most.between.vert <-

Hello R experts, I went through R mailing,Nabble R.I could not find solution.Can someone help me. I have undirected Graph. Here is an example of spreadsheet I have( Unique 3559 Nodes) snippet of 4 rows. Node1 Node2 Weights 1 2 5 2 3 30 2 4 30 1 4 5 3 4 30 1 3 2 I created a program reading the csv and created a Adjacency matrix.From the adjacency matrix I created graph.I am not sure the

Hi Samba List, I've been trying to get a samba+ldap working on centos 6.3. I've had some troubles adapting to the new slapd.d configuration format for the openldap, which seems unnecassarily complicated. Most of the tutorials refer to the older style slapd.conf configuration. I was following this tutorial:

I would like to apply network measures (such as betweenness centrality, upper boundedness, etc.) to a weighted graph with non-integer weights, defined by a euclidean distance matrix. The package sna provides the measures that I want to use, but seems only to operate on binary graphs. I have read work by Mark Newman (http://aps.arxiv.org/abs/cond-mat/0407503/), who suggests that a weighted graph

Nothing fancy, and I've done this before... but today I'm trying to get samba 3.10.5 with tdbsam working on Centos 6.3. iptables is stopped on the samba server. selinux is disabled on the samba server. service smb and nmb are running. samba server has an 'a' record on our dns server. samba server is set to be a wins server. Note- I have ANOTHER wins server on the same subnet for

Hello. I'm installing new FreeBSD 6.2-RELEASE, based on intel machine. Firewall type is OPEN. I have Windows Server 2000 with Active Directory on it, working in Native mode. I've installed samba-3.0.23c_2,1 from /usr/ports/net/samba3 prefix=/usr/local without krb-1.5.1 being installed. Added: nmbd_enable="NO" smbd_enable="NO" winbindd_enable="YES" to

Hi everyone, I'm writting a script that will open multiple files in a single folder and then will do some calculations to finally save everything in a big table. So here is the pseudo code #read all files in the given directory myfiles <-list.files("c:\\myDir") #initialize table ??? #loop through files for(f in myfiles[-1]) { netMat <-

Hello. I'm installing new FreeBSD 6.2-RELEASE, based on intel machine. Firewall type is OPEN. I have Windows Server 2000 with Active Directory on it, working in Native mode. I've installed samba-3.0.23c_2,1 from /usr/ports/net/samba3 prefix=/usr/local without krb-1.5.1 being installed. Added: nmbd_enable="NO" smbd_enable="NO" winbindd_enable="YES" to

igraph is a package for graphs and networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. NEW FEATURES: - We use the ARPACK library for graph related eigenvalue problems, like Page Rank calculation, Kleinberg's hub and authority scores, eigenvector centrality, etc. There is also a generic interface if someone wants to use

igraph is a package for graphs and networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. NEW FEATURES: - We use the ARPACK library for graph related eigenvalue problems, like Page Rank calculation, Kleinberg's hub and authority scores, eigenvector centrality, etc. There is also a generic interface if someone wants to use

Dear R-users, These days, I have been struggling to install the package sna on my Ubuntu 8.04 laptop. My R version is currently R 2.7.2. And I had no trouble installing any other packages (including network). However when I run 'install.packages("sna")', compilation of C codes is ok, but a syntax error is reported when building help pages and sna does not want to install. I

Hi everyone, I have successfully created and analyzed my network data. I am new to R, and Network Analysis too, but I want to color my vertex based on some of the centrality measures calculated. Can someone point me in the right direction? Again, I am new to R, but given how powerful R appears to be, I figure this is probably pretty easy to do, I just wish I could figure it out. Many thanks

Dear All, we have released version 0.6 of the igraph package today. This is a major new version, with a lot of new features, and (sadly) it is not completely compatible with code that was written for the previous igraph versions. (See "Major new features" below for details.) I have included below a list of (bigger) changes. Please see the details in the release notes and the NEWS

Dear All, we have released version 0.6 of the igraph package today. This is a major new version, with a lot of new features, and (sadly) it is not completely compatible with code that was written for the previous igraph versions. (See "Major new features" below for details.) I have included below a list of (bigger) changes. Please see the details in the release notes and the NEWS

Hi R Users I am working with the very useful SNA package (v.2.2) in R and have a query I hope you may be able to help out with: I have been using gplot commands to plot an SNA graph. Here's the code and output: library(sna); library(network); library(RODBC) setwd("c:\\temp") x = read.csv(file = "testforr.csv") Total.Sold=c(1,3,6,1,3,6,1,3,6,6,9) src=c(1:10,1)

Hi, I have the following problem. I have 5 phones behind the same nat (canreinvite=yes). it works fine to receive calls and to make calls. sound quality is good, so everything works fine. The poblem is that the phone behind nat cant call each other. It works if canreinvite=no. But i want to do this. Does anyone have an idea? Regards, cjk.

Greetings. I've already done with question at http://lists-archives.org/samba/37558-winbindd-hangs-up-while-retreiving-usernames.html and made decision, that winbindd tries to get users and groups in trusted domains. We have tree different domains in their forests, connected by trusted relationships: CITY-XXI.INT < - > DEP2.CITY-XXI.INT DEP2.CITY-XXI.INT < - > ALL.INT

Hello All, I went through lot of searching for papers to do clustering on Co-Authroship.I ran SNA metrics on my Undirected Graph(betweenness,Closeness,Eigen Vector) using R. After running the sna Metrics I found important nodes and did clustering on those nodes based on Binding strength .This clustering is done through if they are connected.I would like to do clustering based on Weight of the