Marmote Core
The project aims at realizing the prototype of a software environment dedicated to modeling with Markov chains.
|
![]() ![]() | The Bernoulli distribution with two values |
![]() ![]() | The Dirac distribution concentrated at some point |
![]() ![]() | The general discrete distribution with finite support |
![]() ![]() | A class for representing probability distributions |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | The class representing the (negative) exponential distribution |
![]() ![]() | |
![]() ![]() | Ajout de fonctionalites sur les matrices F81 (Felsenstein 81) Ce sont des matrices 4x4 qui sont caracterisees par: un vecteur de 4 probabilites p[0], p[1], p[2], p[3] un parametre de vitesse mu > 0 |
![]() ![]() | The geometric distribution with starting value 0. The parameter "p" is called "ratio" |
![]() ![]() | The 1-dimensional birth and death process with homogeneous transition rates. This model is characterized by: |
![]() ![]() | The 1-dimensional random walk with homogeneous transition probabilities. This model is characterized by: |
![]() ![]() | The general d-dimensional random walk with homogeneous transition probabilities. This model is characterized by: |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Markov Chain class |
![]() ![]() | |
![]() ![]() | The class describing a finite integer interval |
![]() ![]() | The mother class representing abstract sets |
![]() ![]() | Class for multidimensional, homogeneous random walk transition structures. These are characterized by |
![]() ![]() | The class for transmitting (Monte Carlo) simulation results between objects. Simulation results may be diverse: this structure should be able to accomodate each of the results, even if they are not all present at the same time. Results include: trajectories, empirical frequencies |
![]() ![]() | Class sparseMatrix: implementation of a transition structure using the sparse matrix data structure. Elements of the transition structure (matrix) are stored by row, using two arrays containing indices of columns, and values of entries. A priori, only non-zero entries are stored but this is not a requirement |
![]() ![]() | The general template distribution to be instantiated |
![]() ![]() | Abstract class for transition structures. These are structures which describe transitions to one state to another one, to which is attached a numeric label. Typical instances should be one-step transition matrices of discrete-time Markov chains, and infinitesimal generators of continuous-time Markov chains |
![]() ![]() | The uniform discrete distribution |
![]() ![]() | The continuous uniform distribution over some interval |