# Aggregation and Truncation of Reversible Markov Chains Modulo State Renaming

## Abstract

The theory of time-reversibility has been widely used to derive the expressions of the invariant measures and, consequently, of the equilibrium distributions for a large class of Markov chains which found applications in optimisation problems, computer science, physics, and bioinformatics. One of the key-properties of reversible models is that the truncation of a reversible Markov chain is still reversible. In this work we consider a more general notion of reversibility, i.e., the reversibility modulo state renaming, called \(\rho \)-reversibility, and show that some of the properties of reversible chains cannot be straightforwardly extended to \(\rho \)-reversible ones. Among these properties, we show that in general the truncation of the state space of a \(\rho \)-reversible chain is not \(\rho \)-reversible. Hence, we derive further conditions that allow the formulation of the well-known properties of reversible chains for \(\rho \)-reversible Markov chains. Finally, we study the properties of the state aggregation in \(\rho \)-reversible chains and prove that there always exists a state aggregation that associates a \(\rho \)-reversible process with a reversible one.

## Supplementary material

## References

- 1.Akyildiz, I.F.: Exact analysis of queueing networks with rejection blocking. In: Perros, H.G., Atliok, T. (eds.) Proceedings of the 1st International Workshop on Queueing Networks with Blocking, pp. 19–29 (1989)Google Scholar
- 2.Balsamo, S., Marin, A.: Separable solutions for Markov processes in random environments. Eur. J. Oper. Res.
**229**(2), 391–403 (2013)MathSciNetCrossRefGoogle Scholar - 3.Balsamo, S., Dei Rossi, G., Marin, A.: Lumping and reversed processes in cooperating automata. Ann. Oper. Res.
**239**, 695–722 (2014)MathSciNetCrossRefGoogle Scholar - 4.Benaim, M., Le Boudec, J.-Y.: A class of mean field interaction models for computer and communication systems. Perform. Eval.
**65**(11–12), 823–838 (2008)CrossRefGoogle Scholar - 5.Block, R., Van Houdt, B.: Spatial fairness in multi-channel CSMA line networks. In: Proceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS, pp. 1–8 (2014)Google Scholar
- 6.Buchholz, P.: Product form approximations for communicating Markov processes. Perform. Eval.
**67**(9), 797–815 (2010). Special Issue: QEST 2008CrossRefGoogle Scholar - 7.Bujari, A., Marin, A., Palazzi, C.E., Rossi, S.: Analysis of ECN/RED and SAP-LAW with simultaneous TCP and UDP traffic. Comput. Netw.
**108**, 160–170 (2016)CrossRefGoogle Scholar - 8.Comert, G.: Queue length estimation from probe vehicles at isolated intersections: estimators for primary parameters. Eur. J. Oper. Res.
**252**(2), 502–521 (2016)MathSciNetCrossRefGoogle Scholar - 9.Gates, D.J.: Growth and decrescence of two-dimensional crystals: a Markov rate process. J. Stat. Phys.
**52**(1/2), 245–257 (1988)MathSciNetCrossRefGoogle Scholar - 10.Gates, D.J., Westcott, M.: Kinetics of polymer crystallization I. Discrete and continuum models. Proc. R. Soc. Lond.
**416**, 443–461 (1988)MathSciNetCrossRefGoogle Scholar - 11.Gates, D.J., Westcott, M.: Markovian models of steady crystal growth. J. Appl. Prob.
**3**(2), 339–355 (1993)CrossRefGoogle Scholar - 12.Gelenbe, E., Labed, A.: G-Networks with multiple classes of signals and positive customers. Eur. J. Oper. Res.
**48**(5), 293–305 (1998)CrossRefGoogle Scholar - 13.Kelly, F.: Reversibility and Stochastic Networks. Wiley, New York (1979)zbMATHGoogle Scholar
- 14.Kelly, F.: Loss networks. Ann. Appl. Probab.
**1**(3), 319–378 (1991)MathSciNetCrossRefGoogle Scholar - 15.Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1976)zbMATHGoogle Scholar
- 16.Kozlowski, D., Worthington, D.: Use of queue modelling in the analysis of elective patient treatment governed by a maximum waiting time policy. Eur. J. Oper. Res.
**244**(1), 331–338 (2015)MathSciNetCrossRefGoogle Scholar - 17.Latouche, G.: Queues with paired customers. J. Appl. Probab.
**18**(3), 684–696 (1981)MathSciNetCrossRefGoogle Scholar - 18.Marin, A., Rossi, S.: On discrete time reversibility modulo state renaming and its applications. In: Proceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS, pp. 1–8 (2014)Google Scholar
- 19.Marin, A., Rossi, S.: On the relations between lumpability and reversibility. In: Proceedings of the IEEE 22nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2014), pp. 427–432 (2014)Google Scholar
- 20.Marin, A., Rossi, S.: Dynamic control of the join-queue lengths in saturated fork-join stations. In: Agha, G., Houdt, B. (eds.) QEST 2016. LNCS, vol. 9826, pp. 123–138. Springer, Cham (2016). doi: 10.1007/978-3-319-43425-4_8CrossRefzbMATHGoogle Scholar
- 21.Marin, A., Rossi, S.: On the relations between Markov chain lumpability and reversibility. Acta Inform., 1–39 (2016). doi: 10.1007/s00236-016-0266-1
- 22.Pan, R., Prabhakar, B., Psounis, K.: CHOKe, a stateless active queue management scheme for approximating fair bandwidth allocation. In: Proceedings of IEEE INFOCOM 2000, pp. 942–951. IEEE Computer Society Press, Washington, DC (2000)Google Scholar
- 23.Roy, D., Krishnamurthy, A., Heragu, S.S., Malmborg, C.J.: Queuing models to analyze dwell-point and cross-aisle location in autonomous vehicle-based warehouse systems. Eur. J. Oper. Res.
**242**(1), 72–87 (2015)CrossRefGoogle Scholar - 24.Shone, R., Knight, V.A., Williams, J.E.: Comparisons between observable and unobservable M/M/1 queues with respect to optimal customer behavior. Eur. J. Oper. Res.
**227**(1), 133–141 (2013)MathSciNetCrossRefGoogle Scholar - 25.Whittle, P.: Systems in Stochastic Equilibrium. Wiley, New York (1986)zbMATHGoogle Scholar