class MarkovC extends Error
The MarkovC
class supports the creation and use of Continuous-Time Markov Chains
'CTMC's. Note: the transition matrix 'tr' gives the state transition rates
off-diagonal. The diagonal elements must equal minus the sum of the rest
of their row. Transient solution: Solve the Chapman-Kolmogorov differential
equations. Equilibrium solution (steady-state): solve for 'p' in 'p * tr = 0'.
- See also
www.math.wustl.edu/~feres/Math450Lect05.pdf
- Alphabetic
- By Inheritance
- MarkovC
- Error
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
MarkovC(tr: MatrixD)
- tr
the transition rate matrix
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
animate(): Unit
Animate 'this' continuous-time Markov Chain.
Animate 'this' continuous-time Markov Chain. Place the nodes around a circle and connect them if there is a such a transition.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
flaw(method: String, message: String): Unit
- Definition Classes
- Error
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
val
jump: MatrixD
The jump matrix derived from the transition rate matrix 'tr'
-
def
limit: VectorD
Compute the limiting probabilistic state as 't -> infinity', by finding the left nullspace of the tr matrix: solve for 'p' such that 'p * tr = 0' and normalize 'p', i.e., '||p|| = 1'.
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
next(p: VectorD, t: Double = 1.0): VectorD
Compute the next probabilistic state at t time units in the future.
Compute the next probabilistic state at t time units in the future.
- p
the current state probability vector
- t
compute for time t
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
simulate(i0: Int, endTime: Double): Unit
Simulate the continuous-time Markov chain, by starting in state 'i0' and after the state's holding, making a transition to the next state according to the jump matrix.
Simulate the continuous-time Markov chain, by starting in state 'i0' and after the state's holding, making a transition to the next state according to the jump matrix.
- i0
the initial/start state
- endTime
the end time for the simulation
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
Convert 'this' continuous-time Markov Chain to s string.
Convert 'this' continuous-time Markov Chain to s string.
- Definition Classes
- MarkovC → AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )