forked from riccardoscalco/Pykov
/
pykov.py
1543 lines (1309 loc) · 44.4 KB
/
pykov.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# -*- coding: utf-8 -*-
# PyKov is Python package for the creation, manipulation and study of Markov
# Chains.
# Copyright (C) 2014 Riccardo Scalco
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
# Email: riccardo.scalco@gmail.com
"""Pykov documentation.
.. module:: A Python module for finite Markov chains.
:platform: Unix, Windows, Mac
.. moduleauthor::
Riccardo Scalco <riccardo.scalco@gmail.com>
"""
import random
import math
import six
import numpy
import sys
from collections import OrderedDict
import scipy.sparse as ss
import scipy.sparse.linalg as ssl
if sys.version_info < (2, 6):
from sets import Set
else:
Set = set
__date__ = 'March 2015'
__version__ = 1.1
__license__ = 'GNU General Public License Version 3'
__authors__ = 'Riccardo Scalco'
__many_thanks_to__ = 'Sandra Steiner, Nicky Van Foreest, Adel Qalieh'
def _del_cache(fn):
"""
Delete cache.
"""
def wrapper(*args, **kwargs):
self = args[0]
try:
del(self._states)
except AttributeError:
pass
try:
del(self._succ)
except AttributeError:
pass
try:
del(self._pred)
except AttributeError:
pass
try:
del(self._steady)
except AttributeError:
pass
try:
del(self._guess)
except AttributeError:
pass
try:
del(self._fundamental_matrix)
except AttributeError:
pass
return fn(*args, **kwargs)
return wrapper
class PykovError(Exception):
"""
Exception definition form Pykov Errors.
"""
def __init__(self, value):
self.value = value
def __str__(self):
return repr(self.value)
class Vector(OrderedDict):
"""
"""
def __init__(self, data=None, **kwargs):
"""
>>> pykov.Vector({'A':.3, 'B':.7})
{'A':.3, 'B':.7}
>>> pykov.Vector(A=.3, B=.7)
{'A':.3, 'B':.7}
"""
OrderedDict.__init__(self)
if data:
self.update([item for item in six.iteritems(data)
if abs(item[1]) > numpy.finfo(numpy.float).eps])
if len(kwargs):
self.update([item for item in six.iteritems(kwargs)
if abs(item[1]) > numpy.finfo(numpy.float).eps])
def __getitem__(self, key):
"""
>>> q = pykov.Vector(C=.4, B=.6)
>>> q['C']
0.4
>>> q['Z']
0.0
"""
try:
return OrderedDict.__getitem__(self, key)
except KeyError:
return 0.0
def __setitem__(self, key, value):
"""
>>> q = pykov.Vector(C=.4, B=.6)
>>> q['Z']=.2
>>> q
{'C': 0.4, 'B': 0.6, 'Z': 0.2}
>>> q['Z']=0
>>> q
{'C': 0.4, 'B': 0.6}
"""
if abs(value) > numpy.finfo(numpy.float).eps:
OrderedDict.__setitem__(self, key, value)
elif key in self:
del(self[key])
def __mul__(self, M):
"""
>>> p = pykov.Vector(A=.3, B=.7)
>>> p * 3
{'A': 0.9, 'B': 2.1}
>>> q = pykov.Vector(C=.5, B=.5)
>>> p * q
0.35
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> p * T
{'A': 0.91, 'B': 0.09}
>>> T * p
{'A': 0.42, 'B': 0.3}
"""
if isinstance(M, int) or isinstance(M, float):
return self.__rmul__(M)
if isinstance(M, Matrix):
e2p, p2e = M._el2pos_()
x = self._toarray(e2p)
A = M._dok_(e2p).tocsr().transpose()
y = A.dot(x)
result = Vector()
result._fromarray(y, e2p)
return result
elif isinstance(M, Vector):
result = 0
for state, value in six.iteritems(self):
result += value * M[state]
return result
else:
raise TypeError('unsupported operand type(s) for *:' +
' \'Vector\' and ' + repr(type(M))[7:-1])
def __rmul__(self, M):
"""
>>> p = pykov.Vector(A=.3, B=.7)
>>> 3 * p
{'A': 0.9, 'B': 2.1}
"""
if isinstance(M, int) or isinstance(M, float):
result = Vector()
for state, value in six.iteritems(self):
result[state] = value * M
return result
else:
raise TypeError('unsupported operand type(s) for *: ' +
repr(type(M))[7:-1] + ' and \'Vector\'')
def __add__(self, v):
"""
>>> p = pykov.Vector(A=.3, B=.7)
>>> q = pykov.Vector(C=.5, B=.5)
>>> p + q
{'A': 0.3, 'C': 0.5, 'B': 1.2}
"""
if isinstance(v, Vector):
result = Vector()
for state in set(six.iterkeys(self)) | set(v.keys()):
result[state] = self[state] + v[state]
return result
else:
raise TypeError('unsupported operand type(s) for +:' +
' \'Vector\' and ' + repr(type(v))[7:-1])
def __sub__(self, v):
"""
>>> p = pykov.Vector(A=.3, B=.7)
>>> q = pykov.Vector(C=.5, B=.5)
>>> p - q
{'A': 0.3, 'C': -0.5, 'B': 0.2}
>>> q - p
{'A': -0.3, 'C': 0.5, 'B': -0.2}
"""
if isinstance(v, Vector):
result = Vector()
for state in set(six.iterkeys(self)) | set(v.keys()):
result[state] = self[state] - v[state]
return result
else:
raise TypeError('unsupported operand type(s) for -:' +
' \'Vector\' and ' + repr(type(v))[7:-1])
def _toarray(self, el2pos):
"""
>>> p = pykov.Vector(A=.3, B=.7)
>>> el2pos = {'A': 1, 'B': 0}
>>> v = p._toarray(el2pos)
>>> v
array([ 0.7, 0.3])
"""
p = numpy.zeros(len(el2pos))
for key, value in six.iteritems(self):
p[el2pos[key]] = value
return p
def _fromarray(self, arr, el2pos):
"""
>>> p = pykov.Vector()
>>> el2pos = {'A': 1, 'B': 0}
>>> v = numpy.array([ 0.7, 0.3])
>>> p._fromarray(v,el2pos)
>>> p
{'A': 0.3, 'B': 0.7}
"""
for elem, pos in el2pos.items():
self[elem] = arr[pos]
return None
def sort(self, reverse=False):
"""
List of (state,probability) sorted according the probability.
>>> p = pykov.Vector({'A':.3, 'B':.1, 'C':.6})
>>> p.sort()
[('B', 0.1), ('A', 0.3), ('C', 0.6)]
>>> p.sort(reverse=True)
[('C', 0.6), ('A', 0.3), ('B', 0.1)]
"""
res = list(six.iteritems(self))
res.sort(key=lambda lst: lst[1], reverse=reverse)
return res
def normalize(self):
"""
Normalize the vector so that the entries sum is 1.
>>> p = pykov.Vector({'A':3, 'B':1, 'C':6})
>>> p.normalize()
>>> p
{'A': 0.3, 'C': 0.6, 'B': 0.1}
"""
s = self.sum()
for k in six.iterkeys(self):
self[k] = self[k] / s
def choose(self, random_func = None):
"""
Choose a state according to its probability.
>>> p = pykov.Vector(A=.3, B=.7)
>>> p.choose()
'B'
Optionally, a function that generates a random number can be supplied.
>>> def FakeRandom(min, max): return 0.01
>>> p = pykov.Vector(A=.05, B=.4, C=.4, D=.15)
>>> p.choose(FakeRandom)
'A'
.. seealso::
`Kevin Parks recipe <http://code.activestate.com/recipes/117241/>`_
"""
if random_func is None:
random_func = random.uniform
n = random_func(0, 1)
for state, prob in six.iteritems(self):
if n < prob:
break
n = n - prob
return state
def entropy(self):
"""
Return the entropy.
.. math::
H(p) = \sum_i p_i \ln p_i
.. seealso::
Khinchin, A. I.
Mathematical Foundations of Information Theory
Dover, 1957.
>>> p = pykov.Vector(A=.3, B=.7)
>>> p.entropy()
0.6108643020548935
"""
return -sum([v * math.log(v) for v in self.values()])
def relative_entropy(self, p):
"""
Return the Kullback-Leibler distance.
.. math::
d(q,p) = \sum_i q_i \ln (q_i/p_i)
.. note::
The Kullback-Leibler distance is not symmetric.
>>> p = pykov.Vector(A=.3, B=.7)
>>> q = pykov.Vector(A=.4, B=.6)
>>> p.relative_entropy(q)
0.02160085414354654
>>> q.relative_entropy(p)
0.022582421084357485
"""
states = set(six.iterkeys(self)) & set(p.keys())
return sum([self[s] * math.log(self[s] / p[s]) for s in states])
def copy(self):
"""
Return a shallow copy.
>>> p = pykov.Vector(A=.3, B=.7)
>>> q = p.copy()
>>> p['C'] = 1.
>>> q
{'A': 0.3, 'B': 0.7}
"""
return Vector(self)
def sum(self):
"""
Sum the values.
>>> p = pykov.Vector(A=.3, B=.7)
>>> p.sum()
1.0
"""
return float(sum(self.values()))
def dist(self, v):
"""
Return the distance between the two probability vectors.
.. math::
d(q,p) = \sum_i |q_i - p_i|
>>> p = pykov.Vector(A=.3, B=.7)
>>> q = pykov.Vector(C=.5, B=.5)
>>> q.dist(p)
1.0
"""
if isinstance(v, Vector):
result = 0
for state in set(six.iterkeys(self)) | set(v.keys()):
result += abs(v[state] - self[state])
return result
class Matrix(OrderedDict):
"""
"""
def __init__(self, data=None):
"""
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
"""
OrderedDict.__init__(self)
if data:
self.update([item for item in six.iteritems(data)
if abs(item[1]) > numpy.finfo(numpy.float).eps])
def __getitem__(self, *args):
"""
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T[('A','B')]
0.3
>>> T['A','B']
0.3
>>>
0.0
"""
try:
return OrderedDict.__getitem__(self, args[0])
except KeyError:
return 0.0
@_del_cache
def __setitem__(self, key, value):
"""
>>> T = pykov.Matrix()
>>> T[('A','B')] = .3
>>> T
{('A', 'B'): 0.3}
>>> T['A','A'] = .7
>>> T
{('A', 'B'): 0.3, ('A', 'A'): 0.7}
>>> T['B','B'] = 0
>>> T
{('A', 'B'): 0.3, ('A', 'A'): 0.7}
>>> T['A','A'] = 0
>>> T
{('A', 'B'): 0.3}
>>> T = pykov.Matrix({('A','B'): 3, ('A','A'): 7, ('B','A'): .1})
>>> T.states()
{'A', 'B'}
>>> T['A','C']=1
>>> T.states()
{'A', 'B', 'C'}
>>> T['A','C']=0
>>> T.states()
{'A', 'B'}
"""
if abs(value) > numpy.finfo(numpy.float).eps:
OrderedDict.__setitem__(self, key, value)
elif key in self:
del(self[key])
@_del_cache
def __delitem__(self, key):
"""
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> del(T['B', 'A'])
>>> T
{('A', 'B'): 0.3, ('A', 'A'): 0.7}
"""
OrderedDict.__delitem__(self, key)
@_del_cache
def pop(self, key):
"""
Remove specified key and return the corresponding value.
See: help(OrderedDict.pop)
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.pop(('A','B'))
0.3
>>> T
{('B', 'A'): 1.0, ('A', 'A'): 0.7}
"""
return OrderedDict.pop(self, key)
@_del_cache
def popitem(self):
"""
Remove and return some (key, value) pair as a 2-tuple.
See: help(OrderedDict.popitem)
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.popitem()
(('B', 'A'), 1.0)
>>> T
{('A', 'B'): 0.3, ('A', 'A'): 0.7}
"""
return OrderedDict.popitem(self)
@_del_cache
def clear(self):
"""
Remove all keys.
See: help(OrderedDict.clear)
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.clear()
>>> T
{}
"""
OrderedDict.clear(self)
@_del_cache
def update(self, other):
"""
Update with keys and their values present in other.
See: help(OrderedDict.update)
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> d = {('B', 'C'):2}
>>> T.update(d)
>>> T
{('B', 'A'): 1.0, ('B', 'C'): 2, ('A', 'B'): 0.3, ('A', 'A'): 0.7}
"""
OrderedDict.update(self, other)
@_del_cache
def setdefault(self, k, *args):
"""
See: help(OrderedDict.setdefault)
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.setdefault(('A','A'),1)
0.7
>>> T
{('B', 'A'): 1.0, ('A', 'B'): 0.3, ('A', 'A'): 0.7}
>>> T.setdefault(('A','C'),1)
1
>>> T
{('B', 'A'): 1.0, ('A', 'B'): 0.3, ('A', 'A'): 0.7, ('A', 'C'): 1}
"""
return OrderedDict.setdefault(self, k, *args)
def copy(self):
"""
Return a shallow copy.
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> W = T.copy()
>>> T[('B','B')] = 1.
>>> W
{('B', 'A'): 1.0, ('A', 'B'): 0.3, ('A', 'A'): 0.7}
"""
return Matrix(self)
def _dok_(self, el2pos, method=''):
"""
"""
m = len(el2pos)
S = ss.dok_matrix((m, m))
if method == '':
for k, v in six.iteritems(self):
i = el2pos[k[0]]
j = el2pos[k[1]]
S[i, j] = float(v)
elif method == 'transpose':
for k, v in six.iteritems(self):
i = el2pos[k[0]]
j = el2pos[k[1]]
S[j, i] = float(v)
return S
def _from_dok_(self, mat, pos2el):
"""
"""
for ii, val in mat.items():
self[pos2el[ii[0]], pos2el[ii[1]]] = val
return None
def _numpy_mat(self, el2pos):
"""
Return a numpy.matrix object from a dictionary.
-- Parameters --
t_ij : the OrderedDict, values must be real numbers, keys should be tuples of
two strings.
el2pos : see _map()
"""
m = len(el2pos)
T = numpy.matrix(numpy.zeros((m, m)))
for k, v in six.iteritems(self):
T[el2pos[k[0]], el2pos[k[1]]] = v
return T
def _from_numpy_mat(self, T, pos2el):
"""
Return a dictionary from a numpy.matrix object.
-- Parameters --
T : the numpy.matrix.
pos2el : see _map()
"""
for i in range(len(T)):
for j in range(len(T)):
if T[i, j]:
self[(pos2el[i], pos2el[j])] = T[i, j]
return None
def _el2pos_(self):
"""
"""
el2pos = {}
pos2el = {}
for pos, element in enumerate(list(self.states())):
el2pos[element] = pos
pos2el[pos] = element
return el2pos, pos2el
def stochastic(self):
"""
Make a right stochastic matrix.
Set the sum of every row equal to one,
raise ``PykovError`` if it is not possible.
>>> T = pykov.Matrix({('A','B'): 3, ('A','A'): 7, ('B','A'): .2})
>>> T.stochastic()
>>> T
{('B', 'A'): 1.0, ('A', 'B'): 0.3, ('A', 'A'): 0.7}
>>> T[('A','C')]=1
>>> T.stochastic()
pykov.PykovError: 'Zero links from node C'
"""
s = {}
for k, v in self.succ().items():
summ = float(sum(v.values()))
if summ:
s[k] = summ
else:
raise PykovError('Zero links from state ' + k)
for k in six.iterkeys(self):
self[k] = self[k] / s[k[0]]
def pred(self, key=None):
"""
Return the precedessors of a state (if not indicated, of all states).
In Matrix notation: return the coloum of the indicated state.
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.pred()
{'A': {'A': 0.7, 'B': 1.0}, 'B': {'A': 0.3}}
>>> T.pred('A')
{'A': 0.7, 'B': 1.0}
"""
try:
if key is not None:
return self._pred[key]
else:
return self._pred
except AttributeError:
self._pred = OrderedDict([(state, Vector()) for state in self.states()])
for link, probability in six.iteritems(self):
self._pred[link[1]][link[0]] = probability
if key is not None:
return self._pred[key]
else:
return self._pred
def succ(self, key=None):
"""
Return the successors of a state (if not indicated, of all states).
In Matrix notation: return the row of the indicated state.
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.succ()
{'A': {'A': 0.7, 'B': 0.3}, 'B': {'A': 1.0}}
>>> T.succ('A')
{'A': 0.7, 'B': 0.3}
"""
try:
if key is not None:
return self._succ[key]
else:
return self._succ
except AttributeError:
self._succ = OrderedDict([(state, Vector()) for state in self.states()])
for link, probability in six.iteritems(self):
self._succ[link[0]][link[1]] = probability
if key is not None:
return self._succ[key]
else:
return self._succ
def remove(self, states):
"""
Return a copy of the Chain, without the indicated states.
.. warning::
All the links where the states appear are deleted, so that the result
will not be in general a stochastic matrix.
..
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.remove(['B'])
{('A', 'A'): 0.7}
>>> T = pykov.Chain({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.,
('C','D'): .5, ('D','C'): 1., ('C','B'): .5})
>>> T.remove(['A','B'])
{('C', 'D'): 0.5, ('D', 'C'): 1.0}
"""
return Matrix(OrderedDict([(key, value) for key, value in six.iteritems(self) if
key[0] not in states and key[1] not in states]))
def states(self):
"""
Return the set of states.
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.states()
{'A', 'B'}
"""
try:
return self._states
except AttributeError:
self._states = set()
for link in six.iterkeys(self):
self._states.add(link[0])
self._states.add(link[1])
return self._states
def __pow__(self, n):
"""
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T**2
{('A', 'B'): 0.21, ('B', 'A'): 0.70, ('A', 'A'): 0.79, ('B', 'B'): 0.30}
>>> T**0
{('A', 'A'): 1.0, ('B', 'B'): 1.0}
"""
el2pos, pos2el = self._el2pos_()
P = self._numpy_mat(el2pos)
P = P**n
res = Matrix()
res._from_numpy_mat(P, pos2el)
return res
def pow(self, n):
return self.__pow__(n)
def __mul__(self, v):
"""
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T * 3
{('B', 'A'): 3.0, ('A', 'B'): 0.9, ('A', 'A'): 2.1}
>>> p = pykov.Vector(A=.3, B=.7)
>>> T * p
{'A': 0.42, 'B': 0.3}
>>> W = pykov.Matrix({('N', 'M'): 0.5, ('M', 'N'): 0.7,
('M', 'M'): 0.3, ('O', 'N'): 0.5,
('O', 'O'): 0.5, ('N', 'O'): 0.5})
>>> W * W
{('N', 'M'): 0.15, ('M', 'N'): 0.21, ('M', 'O'): 0.35,
('M', 'M'): 0.44, ('O', 'M'): 0.25, ('O', 'N'): 0.25,
('O', 'O'): 0.5, ('N', 'O'): 0.25, ('N', 'N'): 0.6}
"""
if isinstance(v, Vector):
e2p, p2e = self._el2pos_()
x = v._toarray(e2p)
M = self._dok_(e2p).tocsr()
y = M.dot(x)
result = Vector()
result._fromarray(y, e2p)
return result
elif isinstance(v, Matrix):
e2p, p2e = self._el2pos_()
M = self._dok_(e2p).tocsr()
N = v._dok_(e2p).tocsr()
C = M.dot(N).todok()
if 'Chain' in repr(self.__class__):
res = Chain()
elif 'Matrix' in repr(self.__class__):
res = Matrix()
res._from_dok_(C, p2e)
return res
elif isinstance(v, int) or isinstance(v, float):
return Matrix(OrderedDict([(key, value * v) for key, value in
six.iteritems(self)]))
else:
raise TypeError('unsupported operand type(s) for *:' +
' \'Matrix\' and ' + repr(type(v))[7:-1])
def __rmul__(self, v):
"""
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> 3 * T
{('B', 'A'): 3.0, ('A', 'B'): 0.9, ('A', 'A'): 2.1}
"""
if isinstance(v, int) or isinstance(v, float):
return Matrix(OrderedDict([(key, value * v) for key, value in
six.iteritems(self)]))
else:
raise TypeError('unsupported operand type(s) for *:' +
' \'Matrix\' and ' + repr(type(v))[7:-1])
def __add__(self, M):
"""
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> I = pykov.Matrix({('A','A'):1, ('B','B'):1})
>>> T + I
{('B', 'A'): 1.0, ('A', 'B'): 0.3, ('A', 'A'): 1.7, ('B', 'B'): 1.0}
"""
if isinstance(M, Matrix):
result = Matrix()
for link in set(six.iterkeys(self)) | set(M.keys()):
result[link] = self[link] + M[link]
return result
else:
raise TypeError('unsupported operand type(s) for +:' +
' \'Matrix\' and ' + repr(type(M))[7:-1])
def __sub__(self, M):
"""
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> I = pykov.Matrix({('A','A'):1, ('B','B'):1})
>>> T - I
{('B', 'A'): 1.0, ('A', 'B'): 0.3, ('A', 'A'): -0.3, ('B', 'B'): -1}
"""
if isinstance(M, Matrix):
result = Matrix()
for link in set(six.iterkeys(self)) | set(M.keys()):
result[link] = self[link] - M[link]
return result
else:
raise TypeError('unsupported operand type(s) for -:' +
' \'Matrix\' and ' + repr(type(M))[7:-1])
def trace(self):
"""
Return the Matrix trace.
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.trace()
0.7
"""
return sum([self[k, k] for k in self.states()])
def eye(self):
"""
Return the Identity Matrix.
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.eye()
{('A', 'A'): 1., ('B', 'B'): 1.}
"""
return Matrix(OrderedDict([((state, state), 1.) for state in self.states()]))
def ones(self):
"""
Return a ``Vector`` instance with entries equal to one.
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.ones()
{'A': 1.0, 'B': 1.0}
"""
return Vector(OrderedDict([(state, 1.) for state in self.states()]))
def transpose(self):
"""
Return the transpose Matrix.
>>> T = pykov.Matrix({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.transpose()
{('B', 'A'): 0.3, ('A', 'B'): 1.0, ('A', 'A'): 0.7}
"""
return Matrix(OrderedDict([((key[1], key[0]), value) for key, value in
six.iteritems(self)]))
def _UMPFPACKSolve(self, b, x=None, method='UMFPACK_A'):
"""
UMFPACK ( U nsymmetric M ulti F Rontal PACK age)
Parameters
----------
method:
"UMFPACK_A" : \mathbf{A} x = b (default)
"UMFPACK_At" : \mathbf{A}^T x = b
References
----------
A column pre-ordering strategy for the unsymmetric-pattern multifrontal
method, T. A. Davis, ACM Transactions on Mathematical Software, vol 30,
no. 2, June 2004, pp. 165-195.
"""
e2p, p2e = self._el2pos_()
if method == "UMFPACK_At":
A = self._dok_(e2p).tocsr().transpose()
else:
A = self._dok_(e2p).tocsr()
bb = b._toarray(e2p)
x = ssl.spsolve(A, bb, use_umfpack=True)
res = Vector()
res._fromarray(x, e2p)
return res
class Chain(Matrix):
"""
"""
def move(self, state, random_func = None):
"""
Do one step from the indicated state, and return the final state.
>>> T = pykov.Chain({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.move('A')
'B'
Optionally, a function that generates a random number can be supplied.
>>> def FakeRandom(min, max): return 0.01
>>> T.move('A', FakeRandom)
'B'
"""
return self.succ(state).choose(random_func)
def pow(self, p, n):
"""
Find the probability distribution after n steps, starting from an
initial ``Vector``.
>>> T = pykov.Chain({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> p = pykov.Vector(A=1)
>>> T.pow(p,3)
{'A': 0.7629999999999999, 'B': 0.23699999999999996}
>>> p * T * T * T
{'A': 0.7629999999999999, 'B': 0.23699999999999996}
"""
return p * self**n
def steady(self):
"""
With the assumption of ergodicity, return the steady state.
.. note::
Inverse iteration method (P is the Markov chain)
.. math::
Q = \mathbf{I} - P
Q^T x = e
e = (0,0,\dots,0,1)
..
..
.. seealso::
W. Stewart: Introduction to the Numerical Solution of Markov Chains,
Princeton University Press, Chichester, West Sussex, 1994.
>>> T = pykov.Chain({('A','B'): .3, ('A','A'): .7, ('B','A'): 1.})
>>> T.steady()
{'A': 0.7692307692307676, 'B': 0.23076923076923028}
"""
try:
return self._steady
except AttributeError:
e2p, p2e = self._el2pos_()
m = len(e2p)
P = self._dok_(e2p).tocsr()
Q = ss.eye(m, format='csr') - P
e = numpy.zeros(m)
e[-1] = 1.
Q = Q.transpose()
# not elegant singular matrix error
Q[0, 0] = Q[0, 0] + _machineEpsilon()
x = ssl.spsolve(Q, e, use_umfpack=True)
x = x/sum(x)
res = Vector()
res._fromarray(x, e2p)
self._steady = res
return res
def entropy(self, p=None, norm=False):
"""
Return the ``Chain`` entropy, calculated with the indicated probability
Vector (the steady state by default).
.. math::
H_i = \sum_j P_{ij} \ln P_{ij}
H = \sum \pi_i H_i
.. seealso::