# Simple python NetworkX graph calculations

IT & Networking Other - IT & Networking Posted 1 year ago

Hourly Job

Hours to be determined
Less than 1 week
\$\$

Intermediate Level

I am looking for a mix of experience and value

## Details

Take the NetworkX python modules readily available on the web:

Take as input pairs of nodes in format [node, node]

return results: The output should look like a sorted list of highest to lowest ASes for betwenness centrality.

betweenness_centrality
http://networkx.lanl.gov/reference/generated/networkx.algorithms.centrality.betweenness_centrality.html#networkx.algorithms.centrality.betweenness_centrality

using

http://networkx.github.io/documentation/latest/examples/algorithms/krackhardt_centrality.html

#!/usr/bin/env python
"""
Centrality measures

from networkx import *

G=krackhardt_kite_graph()

print("Betweenness")
b=betweenness_centrality(G)
for v in G.nodes():
print("%0.2d %5.3f"%(v,b[v]))

print("Degree centrality")
d=degree_centrality(G)
for v in G.nodes():
print("%0.2d %5.3f"%(v,d[v]))

print("Closeness centrality")
c=closeness_centrality(G)
for v in G.nodes():
print("%0.2d %5.3f"%(v,c[v]))

That is the first job, just betweenness_centrality

Then if successful also:

1) Total nodes and links
2) Average degree
3) Clustering coefficient
4) Assortativity
5) Radius and diameter
6) Average path length
7) Connected components
8) Modularity

• Other Skills:

Client Activity on this Job

Last Viewed: 1 year ago

Proposals: 4

Hired: 1

(4.89) 7 reviews

United States
Cambridge 10:45 AM

15 Jobs Posted
60% Hire Rate, 1 Open Job

\$208 Total Spent
13 Hires, 0 Active

\$16.67/hr Avg Hourly Rate Paid
5 Hours

Member Since Jul 18, 2013