Publications associées à Subshift of finite type

Hidden Markov Modeling Over Graphs

Ali H. Sayed, Virginia Bordignon, Mert Kayaalp, Stefan Vlaski

This work proposes a multi-agent filtering algorithm over graphs for finite-state hidden Markov models (HMMs), which can be used for sequential state estimation or for tracking opinion formation over dynamic social networks. We show that the difference fro ...

IEEE2022

Asymptotic decoupling and weak Gibbs measures for finite alphabet shift spaces

Charles Pfister

For the spaceXin a large class of finite alphabet shift spaces (lattice models) and the class of functionsfwith bounded total oscillations, we prove that each equilibrium measure nu atf=phi is a weak Gibbs measures for phi-P(phi). In addition, the empirica ...

2020

On the relaxed maximum-likelihood blind MIMO channel estimation for orthogonal space-time block codes

Kamran Kalbasi

This paper concerns the maximum-likelihood channel estimation for MIMO systems with orthogonal space-time block codes when the finite alphabet constraint of the signal constellation is relaxed. We study the channel coefficients estimation subspace generate ...

ELSEVIER2020

Dynamic prediction-based relocation policies in one-way station-based carsharing systems with complete journey reservations

Nikolaos Geroliminis, Burak Boyaci, Martin Jean Marie Joseph Repoux, Mor Kaspi

In this paper, we study the operations of a one-way station-based carsharing system implementing a complete journey reservation policy. We consider the percentage of served demand as a primary performance measure and analyze the effect of several dynamic s ...

PERGAMON-ELSEVIER SCIENCE LTD2019

The time-dependent expected reward and deviation matrix of a finite QBD process

Sophie Myriam Hautphenne

Deriving the time-dependent expected reward function associated with a continuous-time Markov chain involves the computation of its transient deviation matrix. In this paper we focus on the special case of a finite quasi-birth-and-death (QBD) process, moti ...

ELSEVIER SCIENCE INC2019

Finding Steady States of Communicating Markov Processes Combining Aggregation/Disaggregation with Tensor Techniques

Francisco Santos Paredes Quartin de Macedo

Stochastic models for interacting processes feature a dimensionality that grows exponentially with the number of processes. This state space explosion severely impairs the use of standard methods for the numerical analysis of such Markov chains. In this wo ...

Springer Int Publishing Ag2016

Unsplittable Coverings in the Plane

János Pach, Doemoetoer Palvoelgyi

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...

Springer-Verlag Berlin2016

Unsplittable coverings in the plane

János Pach, Doemoetoer Palvoelgyi

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...

Academic Press Inc Elsevier Science2016

Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets

Giovanni Migliorati

We present novel Markov-type and Nikolskii-type inequalities for multivariate polynomials associated with arbitrary downward closed multi-index sets in any dimension. Moreover, we show how the constant of these inequalities changes, when the polynomial is ...

Elsevier2015

Measuring and Synthesizing Systems in Probabilistic Environments

Barbara Jobstmann, Rishabh Singh

The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under ...

Assoc Computing Machinery2015