### updates on docs

parent 634e4b31
Pipeline #78035 failed with stage
in 19 minutes and 49 seconds
 ... @@ -38,11 +38,11 @@ gplot(g, collect(1:nodes), collect(1:nodes)) ... @@ -38,11 +38,11 @@ gplot(g, collect(1:nodes), collect(1:nodes)) ## Defining competition processes ## Defining competition processes We propose that any individual have a constant birth rate, and competes with all the individuals present in the same patch. Assume there are N_t individuals at time t. We propose that any individual have a constant birth rate, and competes with all the individuals present in the same patch. Assume there are N_t individuals at time t. Let i \in \{ 1,2,\dots,N_t\}. x_{i,t} \in \{1,2,\dots,9\} denotes the position of the i-th individual at time t. Let i \in \{ 1,2,\dots,N_t\}. x_{i} \in \{1,2,\dots,9\} denotes the position of the i-th individual. The competition pressure experienced by individual i is such that The competition pressure experienced by individual i is such that math math d(x_{i,t}) = \sum_j^{N(t)} \delta(x_{i,t}-x_{j,t}) d(x_{i},t) = \sum_j^{N(t)} \delta(x_{i}-x_{j})   where \delta is the dirac function. where \delta is the dirac function. ... ...
 ... @@ -16,7 +16,7 @@ A particular event, birth or death, is chosen at random with a probability equal ... @@ -16,7 +16,7 @@ A particular event, birth or death, is chosen at random with a probability equal ### Time steps ### Time steps An event is exponentiallly distributed in time, with parameter \lambda = U(t). This makes events memoryless, meaning that the probability of having a birth or death event is always the same, no matter when (P(X > s_t | X > t) = P(X > s) . An event is exponentiallly distributed in time, with parameter \lambda = U(t). This makes events memoryless, meaning that the probability of having a birth or death event is always the same, no matter when (P(X > s_t | X > t) = P(X > s) . !!! tip "Inversion method" @autodocs @autodocs Modules = [ABMEv] Modules = [ABMEv] ... ...
 ... @@ -91,3 +91,14 @@ function get_xarray(world::World,geotrait::Bool=false) ... @@ -91,3 +91,14 @@ function get_xarray(world::World,geotrait::Bool=false) return xarray return xarray end end @deprecate get_xarray(world,geotrait=false) get_x(world,Colon()) @deprecate get_xarray(world,geotrait=false) get_x(world,Colon()) """ function give_birth(mum_idx::Int,w::World) Copies agent within index mum_idx, and increment it by dx. Return new agent (offspring). """ function give_birth(mum_idx::Int,w::World) new_a = copyxt(w[mum_idx]) increment_x!(new_a,space(w),parameters(w),time(w)) return new_a end
 ... @@ -5,15 +5,6 @@ $(TYPEDEF) ... @@ -5,15 +5,6 @@$(TYPEDEF) """ """ struct Gillepsie <: AbstractAlg end struct Gillepsie <: AbstractAlg end export Gillepsie export Gillepsie """ function give_birth(a::Agent,t,p::Dict) Used for Gillepsie setting """ function give_birth(mum_idx::Int,w::World) new_a = copyxt(w[mum_idx]) increment_x!(new_a,space(w),parameters(w),time(w)) return new_a end function updateBirthEvent!(w::World,::Gillepsie,mum_idx::Int,b,d) function updateBirthEvent!(w::World,::Gillepsie,mum_idx::Int,b,d) # updating competition only the two columns corresponding to agent idx # updating competition only the two columns corresponding to agent idx ... ...
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment