Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/akshayxml/anchor-node-finder

The code and results for finding anchor nodes in different networks which reduce the APL of the network.
https://github.com/akshayxml/anchor-node-finder

2d-networks 3d-network average-path-length complex-networks cylindrical-networks erdos-reyni-graphs graph random-networks

Last synced: 28 days ago
JSON representation

The code and results for finding anchor nodes in different networks which reduce the APL of the network.

Awesome Lists containing this project

README 

        
# Anchor Node Finder

Contains the code for detecting anchor node in different type of networks. Anchor node is a node which will have the most long-ranged links connected to it so that the average path length of the network gets reduced by maximum.



## 2-D GRID NETWORK:



### Code:

- The main.py can be used to generate N*N 2-D grid networks. It will also add the most optimum LL and calculate the APL. These data are stored in an Excel Sheet. 

- It can also be used to plot APL-LL graph and the degree distribution. It is possible to print the adjacency matrix that can be used to check whether the code is working properly or not. These parts are kept in comments as they are not essential for our work and can be used when necessary.

- Command line arguments are necessary for executing the program. The two arguments that must be provided are: size of the grid network, the number of LL to be added. Eg: to generate a `4x4` grid network and add 20 LLs, the code can be executed as follows:

`python main.py 4 20`



### Output:

- Anchor Node plots show the position of the anchor node in different grid networks. 

- APL_LL charts show the variation of APL with the addition of LL for different grid networks.

- Degree Distributions folder contains the degree distribution, i.e. the count of different degree nodes, for various grid networks. Each folder contains the degree distribution of networks as more and more LL are added.



## RANDOM GRAPHS:



### Code:

- The main.py can be used to generate 10 random graphs with a given probability. It will also add the most optimum LL and calculate the APL. These data are stored in two txt files. First txt file contains the edgelist of the graph generated and the second txt file contains the LLs added along with the APL after their addition.

- Only one command line argument needs to be provided, i.e. the probability of the random graph. For eg: to generate 10 random graphs with probability 0.04 the code can be executed as follows-

		`python main.py 0.04`

- The number of nodes needed in the graph and the number of LLs to be added can be changed by changing the value of their respective variables in the code.

- The centrality of graphs can be found be using the codes given in the centrality folder. 

- The edgelist generated previously must be kept in the same folder as the centrality code. 

- The highest_centrality.py is used to find the node with the highest degree centrality in the graph. Node with highest betweenness and closeness centrality can be found using the same code by change nx.degree_centrality(G) in line 47 to whatever centrality the user wishes to use.



### Output:

- It contains the data generated for random graphs with 50 and 100 nodes. Within each folder, contains various folders which are classified based on the probability used. Two txt files are present for each graph as told earlier. Apart from this, centrality folder contains the nodes with highest centrality. 

- The centrality files have been named in this format: centralHF.txt where H can be 0,1, or 2 - 0 means no-hop, 1 means 1-hop and 2 means 2-hop. F denotes the type of centrality- b means betweenness, c means closeness, and d means degree centrality. 

Each centrality txt file contains the nodes with highest centrality and it's centrality value. The node is stored in a list as there can be chance that more than one node has highest centrality value.



## CYLINDRICAL NETWORKS:



### Code:

- The code for open cylindrical network is mostly similar to the code for 2-D grid network. The only change is in that first column nodes are connected to last column nodes. When opposite nodes in first row and opposite nodes in last row are connected, we get the closed cylindrical network.

- A multiprocessing program has also been added for open cylindrical network to speed things up. Four processes are created in the program. In some cases, main.py maybe faster than multi.py. The arguments are same as that for 2-D grid network- the network size and number of LL to be added. 



### Output:

- Anchor node plots show the position of anchor node in the network for various networks. It is similar to plots seen earlier.

- LL with APL Sheets are excel and txt files that contains the details regarding the nodes between which LLs are added and the corresponding APL that we get.