Update README.md

README.md

@@ -4,14 +4,11 @@ Network analysis techniques (such as network motif theory) could be used to furt
 
 Complex networks across many domains (ecological food webs, neural systems, electrical circuits) are made up of statistically significant, subgraphs called network motifs. Network motifs are described by the number of nodes they involve and the nature of the connections in-between the nodes (e.g., directed, or bi-directed). The order of the motif is defined by the number of nodes it involves (i.e. n-order motif involves n+1 nodes). For example, a second-order diverging motif involves 3 nodes: 
 
-<img src="figs/div_motif.jpg" width="50%"/>
-
+<img src="figs/div_motif.jpg" width="10%"/>
 
 A subgraph must be statistically significant over a randomly connected graph to be considered a network motif of a given network. One metric for determining a subgraph’s statistical significance is its z-score when compared to randomly connected graphs. 
 
 Here, we are quantifying the network motif distribution over the sparse networks pruned in [ref paper]. We have developed our own subgraph counting algorithm based around using the masking matrices of the pruned networks. Network motifs are determined by calculating the z-score against random networks with the same number of nodes, connections, and layer structure. 
 
-![image](https://user-images.githubusercontent.com/42389485/208487993-2aef21fd-2c26-40dd-91e2-f7be2d0275d2.png)
-
 <img src="figs/motif_fig.jpg" width="50%"/>