scholarly journals LaKSA: A Probabilistic Proof-of-Stake Protocol

Author(s):  
Daniel Reijsbergen ◽  
Pawel Szalachowski ◽  
Junming Ke ◽  
Zengpeng Li ◽  
Jianying Zhou
Keyword(s):  
1993 ◽  
Vol 30 (3) ◽  
pp. 518-528 ◽  
Author(s):  
Frank Ball ◽  
Geoffrey F. Yeo

We consider lumpability for continuous-time Markov chains and provide a simple probabilistic proof of necessary and sufficient conditions for strong lumpability, valid in circumstances not covered by known theory. We also consider the following marginalisability problem. Let {X{t)} = {(X1(t), X2(t), · ··, Xm(t))} be a continuous-time Markov chain. Under what conditions are the marginal processes {X1(t)}, {X2(t)}, · ··, {Xm(t)} also continuous-time Markov chains? We show that this is related to lumpability and, if no two of the marginal processes can jump simultaneously, then they are continuous-time Markov chains if and only if they are mutually independent. Applications to ion channel modelling and birth–death processes are discussed briefly.


Bernoulli ◽  
2015 ◽  
Vol 21 (4) ◽  
pp. 2419-2429
Author(s):  
Luc Deleaval ◽  
Nizar Demni

Sign in / Sign up

Export Citation Format

Share Document