Skip to content

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
pclus authored Feb 3, 2023
1 parent 1e2dcac commit 55c64b8
Showing 1 changed file with 5 additions and 5 deletions.
10 changes: 5 additions & 5 deletions README.md
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
# explosive-immunization
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.
# Explosive immunization
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)

Please, refer to the paper for details of the algorithm.

Expand All @@ -18,9 +18,9 @@ To run the code use
$ ./exploimmun <m> <network.txt>
```
where
* `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.
* `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.

* `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`.
* `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`.

## Outputs generated by the algorithm

Expand All @@ -32,4 +32,4 @@ All the output files are generated in the workspace

## Algorithm parameters

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`
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 comments on commit 55c64b8

Please sign in to comment.