You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+5-5Lines changed: 5 additions & 5 deletions
Original file line number
Diff line number
Diff line change
@@ -1,5 +1,5 @@
1
-
# explosive-immunization
2
-
Explosive immunization algorithm for network fragmentation introduced in the article Pau Clusella, Peter Grassberger, Francisco J. Pérez-Reche, and Antonio Politi Phys. Rev. Lett. **117**, 208301.
1
+
# Explosive immunization
2
+
Explosive immunization algorithm for network fragmentation, introduced in the article [Pau Clusella, Peter Grassberger, Francisco J. Pérez-Reche, and Antonio Politi Phys. Rev. Lett. **117**, 208301.](https://doi.org/10.1103/PhysRevLett.117.208301)
3
3
4
4
Please, refer to the paper for details of the algorithm.
5
5
@@ -18,9 +18,9 @@ To run the code use
18
18
$ ./exploimmun <m> <network.txt>
19
19
```
20
20
where
21
-
*`m` is a positive integer stating the number of candidates to select at each step of the algorithm. The smaller the `m`, the fastest is the algorithm, but a too small number might result on a bad performance. For networks with a million nodes, `m=1000` might be a good options.
21
+
*`m` is a positive integer stating the number of candidates to select at each step of the algorithm. The smaller the `m`, the fastest is the algorithm. However, a too small number might result on a bad performance. For networks with a million nodes, `m=1000` might be a reasonable option.
22
22
23
-
*`network.txt` is the file where the network is stored. The first line must be only the number of nodes of the networ. The following lines must contain the list of edges with the format. A edge written as `i j` means that there is a link between node `i` and `j`. **The proper format of the file is not checked by the code.** A exemplary file is given in the repository as `ER1e5.txt`.
23
+
*`network.txt` is the file where the network is stored. The first line must be just a single number, `N` the number of network nodes. The following lines must contain the list of edges. An edge written as `i j` means that there is a link between node `i` and `j`. **The proper format of the file is not checked by the code so the user should ensure everything is set appropiately.** A exemplary file is given in the repository as `ER1e5.txt`.
24
24
25
25
## Outputs generated by the algorithm
26
26
@@ -32,4 +32,4 @@ All the output files are generated in the workspace
32
32
33
33
## Algorithm parameters
34
34
35
-
The only parameter the program requires is `m`. The effective degree cut-off is set to 6. The threshold where the second score is invoked is set to 1/sqrt(N). These two parameters can be easily changed from the file `Library/exploimmun.c`
35
+
The only parameter the program requires is `m`. The effective degree cut-off is set to 6. The threshold where the second score is invoked is set to $1/\sqrt{N}$. These two parameters can be easily changed from the source file `Library/exploimmun.c`
0 commit comments