Metadata-Version: 2.1
Name: propagsim
Version: 0.2
Summary: Implementation of CAST propagation model
Home-page: https://github.com/parcoor/py-propagsim
Author: Manuel Capel
Author-email: manuel.capel@parcoor.com
License: UNKNOWN
Platform: UNKNOWN
Classifier: Programming Language :: Python :: 3
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: OS Independent
Description-Content-Type: text/markdown

# py-propagsim
[![license](https://img.shields.io/github/license/DAVFoundation/captain-n3m0.svg?style=flat-square)](https://github.com/DAVFoundation/captain-n3m0/blob/master/LICENSE)

Author: Manuel Capel

![CAST geographical time evolution](../master/img/mapevolution.gif?raw=true "CAST geographical time evolution")

This is the implementation in Python of a propagation model that we propose to call *CAST* as *Cell Agent State Transitions*. Its purpose is modeling the propagation of epidemics and the impact of actions to counter it.

[:fr:](https://gist.github.com/Helmasaur/fb8ca2c08131c58341d443b43672a1f5) For French, see this [blog article](https://blog.parcoor.com/2020-04-22-cast-prediction-propagation/)

![CAST contaminations transitions](../master/img/chainevolution.gif?raw=true "CAST contaminations transitions")

## Installation
```
pip install propagsim
```

## Usage
See this [notebook](examples/example0.ipynb) for a (toy) example of an implementation of this model

![CAST state time evolution](../master/img/nevolution.png?raw=true "CAST state time evolution")

## Model description
### Basic objects
Basically, this model considers three types of object:
1. **Cell**. A *cell* can contain 0, 1 or many *agent*s at any time. It has also a *position* (Euclidean coordinates on a plan)
2. **Agent**. An agent has one (and only one) *state* at a given moment, and is also in one (and only one) cell. The *cell* where an *agent* is initially is considered to be its *home_cell*.
3. **State**. A state has a predefined *severity*, *contagiousity* and *sensitivity*, all in (0, 1)

### Contagion
A contagion happens within a cell, when it contains several agents at the same time and one of them is contagious.
When an agent has a state with *contagiousity* > 0, then the other agents in the same cell can get infected. 
The probability of *Agent_A* to contaminate *Agent_B* in *cell* is given by:

<img src="https://render.githubusercontent.com/render/math?math=p = contagiousity(state(Agent_A)) \times sensitivity(state(Agent_B)) \times unsafety(cell)">

**NB**: 
* The highest contagiousity in the cell is taken to compute *p*.
* The *unsafety* of a *cell* measures how a cell is unsafe for contagion (social distancing respected or not inside etc.)

![CAST contamination process](../master/img/contagion.png?raw=true "CAST contamination process")

If *Agent_B* gets infected, it gets to its own state having the least strictly positive *severity* (it can't jump directly to a more severe state).

### State transition
A *state transition matrix* and *state durations* are attached to each *agent*. The *state transition matrix* is a Markovian matrix describing the transition probabilities between the states an agent can take. The *state durations* are the duration of each state. If a agent is in a given *state*, it will switch to another one sampled according to its *state transition matrix*

**NB**: Different *agent*s can share the same states and the same *state transition matrix* but have different *state durations*, or have have the same *state*, the same *state durations* but a different *state transition matrix*, or etc.

### Moves
A move consists in moving *agent*s to other cells. When a move is done, all *agent*s are concerned. It happens it two steps:
1. Selecting *agent*s that will move
2. moving the selected *agent*s to their new cells

#### Agent selection
The probability of an *agent* to be selected for a move is:

<img src="https://render.githubusercontent.com/render/math?math=p = proba\_move(agent) \times (1 - severity(state(agent)))">


The first factor represents the mobility of the *agent* so to say. The second factor represents the fact that the more severe the state of an *agent*, the less the probability that it will move.

#### Cell selection
The *cell* where to move a selected *agent* is sampled according to a probability

<img src="https://render.githubusercontent.com/render/math?math=p \~ \frac{attractivity(cell)}{distance(home\_cell(agent), cell)}">

![CAST move process](../master/img/move.png?raw=true "CAST move process")

**NB**: 
* a limitation of this model is that the attractivity of each *cell* is the same for all *agent*. An extension / refinement of this model would be to have *cell* attractivities personalized by agent.
* The distance is always computed from the *home_cell* of an agent, not from its *current_cell*. An *agent* is considered wandering around its *home_cell*
* The *agent*s not selected for a move will be moved to their *home_cell* afterward

### Temporality
Each time *period* contains move rounds (they don't have to have all the same number of move *rounds*). During each move *round*, *agent*s are selected and moved as described above. Id they are infected, they can infect other agents in the same *cell* than themselves. A time *period* finishes when all agents are simultanously *forwarded*. Each *agent* is actually in a given state, that has a given duration. By a *forward*, the time in this state is incremented by 1. If this time then exceeds the duration of the current state of the agent, the agent moves to the next state according to its *transition* described above.

![CAST temporality](../master/img/temporality.png?raw=true "CAST temporality")

## Contributing
Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.

Please make sure to update tests as appropriate.

## License
[MIT](https://choosealicense.com/licenses/mit/)


