-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmarkov_chains.cpp
More file actions
71 lines (61 loc) · 2.29 KB
/
Copy pathmarkov_chains.cpp
File metadata and controls
71 lines (61 loc) · 2.29 KB
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
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
const double TOL = 1e-10; //Tolerancia para la convergencia
const int MAX_ITER = 40; //Número máximo de iteraciones
//Función que multiplica el vector de estado por la matriz de transición
vector<double> multiply(const vector<double>& state, const vector<vector<double>>& transition) {
vector<double> newState(state.size(), 0.0);
for (int i = 0; i < state.size(); ++i) {
for (int j = 0; j < transition[i].size(); ++j) {
newState[j] += state[i] * transition[i][j];
}
}
return newState;
}
//Función que calcula diferencia máxima entre dos vectores
//Definimos la diferencia máxima como la mayor diferencia absoluta entre los elementos correspondientes de dos vectores
double maxDifference(const vector<double>& a, const vector<double>& b) {
double maxDiff = 0.0;
for (int i = 0; i < a.size(); ++i) {
double diff = fabs(a[i] - b[i]);
if (diff > maxDiff) {
maxDiff = diff;
}
}
return maxDiff;
}
//Función que calcula la distribución estacionaria
vector<double> markov_chains(const vector<vector<double>>& transition, const vector<double>& initialState, int &iter, bool &convergencia) {
vector<double> state = initialState;
convergencia = false;
for (iter = 1; iter <= MAX_ITER && maxDifference(state, multiply(state, transition)) >= TOL; ++iter) {
vector<double> newState = multiply(state, transition);
state = newState;
}
if (iter < MAX_ITER) {
convergencia = true;
}
return state;
}
int main() {
//Ejemplo de uso
vector<vector<double>> transition = {
{0.5, 0.5, 0.0},
{0.25, 0.5, 0.25},
{0, 0.5, 0.5}
};
vector<double> initialState = {0.6, 0.25, 0.15}; //Estado inicial
int iterations = 0;
bool convergencia = false;
vector<double> stationaryDistribution = markov_chains(transition, initialState, iterations, convergencia);
cout << "Distribución estacionaria: ";
for (double prob : stationaryDistribution) {
cout << prob << " ";
}
cout << endl;
cout << "Número de iteraciones: " << iterations << endl;
cout << "Convergencia alcanzada: " << (convergencia ? "Sí" : "No") << ". Tolerancia " << TOL << endl;
return 0;
}