With the recent progress of spatial information technologies and communication technologies, it has become easier to track positions of a large number of moving objects in real-ti...
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering a...
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
Security communication systems composed of highly reliable components may have few if any failures while undergoing heavy testing or field-usage. This paper combines (i) analysis ...
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...