Good resource to learn basics of Network science:

Recent summary of Graph Network and their use in ML:

Examples of Network graphs:

Network building and manipulation will be done using `NetworkX`

- a python package made for this exact function

```
import os
import numpy as np
import networkx as nx
#----- PLOTTING PARAMS ----#
import matplotlib.pyplot as plt
from matplotlib.pyplot import cm
%config InlineBackend.figure_format = 'retina'
%config InlineBackend.print_figure_kwargs={'facecolor' : "w"}
```

## 1. Basics

**Nodes:** Points which are connected to each other. Can represent people, words, or atoms -- objects which have attributes of their own

**Edges:** Connection between the `nodes`

- show how nodes (entities) are connected, bond distance, social network (friendships) -- property which connect the entities

```
G = nx.Graph()
# Add a node
G.add_node(42)
# Add node from list of entities
temp_list = ['A','B','C']
G.add_nodes_from(temp_list)
```

```
G.nodes
```

```
G.remove_node(42) #This is definite node name and should exist in the network
# Multiple nodes
G.remove_nodes_from(['A','Z','Blah']) #Here it is compared to the element to that in the list
```

```
G.nodes
```

```
# this also adds nodes if they don't already exist
G.add_edge('C','Z')
```

```
print(G.edges, G.nodes)
```

```
G.add_edges_from([('B', 'C') , ('B', 'Z')])
```

```
G.edges
```

```
# remove multiple edges (list of tuples)
G.remove_edges_from([('A', 'B') , ('C', 'B')]) #Here list are commutative
```

```
G.edges
```

```
G.number_of_nodes()
```

```
G.number_of_edges()
```

```
G.degree('B')
```

```
G.clear()
```

```
G = nx.read_edgelist('./data/facebook_combined.txt')
```

```
G.number_of_nodes()
```

```
G.number_of_edges()
```

```
dict_neighbors = G.neighbors('2')
```

```
G.degree('2')
```

```
list(dict_neighbors)
```

```
G.clear()
```

## 3. Type of different networks

### a. Weighted Graphs

**Edge weight**
Consider that the edge that you are adding should contain additional information, such as the strength of the connection. This would be important, for example, when analyzing communication networks to check friendship/connectivity strength. You want to capture how many times they exchanged e-mails, calls, text messages, to indicate the strength of the connection. For this you will assign weights to the edge, values that can be the number of communications, or the fraction of communications, normalized.

I had used this type of graph in my analysis for Indian spices. In that case, the edge was assigned a weight corresponding to the number of times a pair of spice occured together in a recipe.

```
G.add_edge('Water','Soda', weight=10)
```

Ways to access edge property:

```
G.edges.data()
```

```
G['Soda']['Water']
```

```
G['Water']['Soda']
```

```
G['Water']['Soda']['weight'] = -1
```

```
G.edges.data()
```

```
G.nodes
```

```
dg = nx.to_directed(G)
```

```
dg.edges
```

```
dg.get_edge_data('Water','Soda')
```

### c. Multigraphs

`NetworkX`

provides classes for graphs which allow multiple edges between any pair of nodes. The `MultiGraph`

and `MultiDiGraph`

classes allow you to add the same edge twice, possibly with different edge data. This can be powerful for some applications, but many algorithms are not well defined on such graphs.

```
MG = nx.MultiGraph()
MG.add_weighted_edges_from([(1, 2, 3.0), (1, 2, 75), (2, 3, 5), (1, 2, 4.2)])
```

```
MG.edges
```

```
MG.edges.data('weight')
```

```
MG.edges.data()
```

```
MG[1][2]
```

```
from networkx.algorithms import bipartite
```

```
bip = nx.Graph()
```

```
bip.add_nodes_from(['apple', 'peach', 'watermelon', 'pear'], bipartite=0)
bip.add_nodes_from(['Alice', 'Steve', 'Mary'], bipartite=1)
```

```
bip.add_edges_from([('Alice', 'apple'), ('Alice', 'peach'), ('Steve', 'watermelon'),
('Mary', 'pear'), ('Mary', 'apple'), ('Mary', 'watermelon')])
```

```
nx.draw(bip, with_labels=True)
```

Currently, `NetworkX`

does not provide a bipartite graph visualization method to visually delimit the two sets of nodes. However, we can draw the left and right set of nodes and see how they connect to each other. Further, you can play around with coloring the nodes based on the 'bipartite' attribute to further refine visually to which node set each node belongs to.

```
import scipy.sparse as sparse
X, Y = bipartite.sets(bip)
pos = dict()
pos.update((n, (1, i*10)) for i, n in enumerate(X))
pos.update((n, (1.5, i*10)) for i, n in enumerate(Y))
nx.draw(bip, with_labels=True, pos=pos)
```

Bipartite graphs can be projected as two separate graphs `G1 = (U, E1)`

and `G2 = (V, E2)`

. The edges will be different though.

We can create a network of fruits, where nodes will be fruits and the edges will between two fruits will be created if someone likes both fruits. Such, peach and apple will have one edge, as Alice likes both. Same for apple and pear, which are both liked by Mary. Likewise, we can create the second network as the network of individuals, where connections between them will be their preference for the same fruit. Here, we can create a connection/edge between Steve and Mary since both of them like watermelon.

## 3. Network Models

Network models can be very useful for comparing their topology to the structural properties of our network built from real data. Different network models have very distinct structural characteristics, which defines their behavior in case of information flow on the network, attacks/failures on the nodes/edges, etc, and these properties have been extensively studied and are well documented. Knowing to which network model your graph corresponds to can provide valuable insights about its potential behavior under various circumstances.

There are a miriad of network models with different topological properties. Here we will try out some of the most useful ones (that frequently occur in real complex systems).

```
ba = nx.barabasi_albert_graph(10, 5)
nx.draw_spectral(ba, node_size=200)
```

Barabasi-Alber Graph. A graph of N nodes is grown by attaching new nodes each with M edges that are preferentially attached to existing nodes with high degree.

```
er = nx.erdos_renyi_graph(50, 0.1)
nx.draw_circular(er)
```

```
complete = nx.complete_graph(5)
nx.draw(complete)
```