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

Noether's theorem for dissipative quantum dynamical semi-groups

Tudor Ratiu

Noether's theorem on constants of the motion of dynamical systems has recently been extended to classical dissipative systems (Markovian semi-groups) by Baez and Fong [J. Math. Phys. 54, 013301 (2013)]. We show how to extend these results to the fully quan ...

Amer Inst Physics2015

Shift-Invariant and Sampling Spaces Associated With the Fractional Fourier Transform Domain

Ayush Bhandari

Shift-invariant spaces play an important role in sampling theory, multiresolution analysis, and many other areas of signal and image processing. A special class of the shift-invariant spaces is the class of sampling spaces in which functions are determined ...

2012

Modeling of distortion caused by Markov-model burst packet losses in video transmission

Yi Zhang

This paper addresses the problem of distortion modeling for video transmission over burst-loss channels characterized by a finite state Markov chain. A Distortion Trellis model is pro- posed, enabling us to estimate at the frame level the expected mean-squ ...

2009

Sliding Window Abstraction for Infinite Markov Chains

Maria-Emanuela-Canini Mateescu, Verena Wolf

We present ail on-the-fly abstraction technique for infinite-state continuous-time Markov chains. We consider Markov chains that are specified by a finite set of transition classes. Such models naturally represent biochemical reactions and therefore play a ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Modeling and Analysis of Distortion Caused by Markov-Model Burst Packet Losses in Video Transmission

Yi Zhang

This paper addresses the problem of distortion modeling for video transmission over burst-loss channels characterized by a finite state Markov chain. Based on a detailed analysis of the error propagation and the bursty losses, a Distortion Trellis model is ...

2009

Formalisms for Specifying Markovian Population Models

Barbara Jobstmann, Verena Wolf

We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages -matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Contribution to the ergodic theory of piecewise monotone continuous maps

Bastien Faller

This thesis is devoted to the ergodic theory of the piecewise monotone continuous maps of the interval. The coding is a classical approach for these maps. Thanks to the coding, we get a symbolic dynamical system which is almost isomorphic to the initial dy ...

EPFL2008

Equivalence of labeled Markov chains

Laurent Doyen

We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observations has the same probability of occurrence in the two LMCs. We show that equ ...

2008

Asset trading volume in infinite-horizon economies with dynamically complete markets and heterogeneous agents: Comment

In a recent paper, Judd et al. [2003. Journal of Finance 58, 2203-2217] study asset trading in a version of the standard Lucas infinite horizon economy with heterogeneous agents. They report the surprising finding that (for generic economies in their class ...

2006

Probabilistic graphical models for human interaction analysis

Dong Zhang

The objective of this thesis is to develop probabilistic graphical models for analyzing human interaction in meetings based on multimodel cues. We use meeting as a study case of human interactions since research shows that high complexity information is mo ...

EPFL2006