Publication

On the estimation of arterial route travel time distribution with Markov chains

Related publications (41)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Propagation Models for Biochemical Reaction Networks

Maria-Emanuela-Canini Mateescu

In this thesis we investigate different ways of approximating the solution of the chemical master equation (CME). The CME is a system of differential equations that models the stochastic transient behaviour of biochemical reaction networks. It does so by d ...

EPFL2011

Prescription-induced jump distributions in multiplicative Poisson processes

Andrea Rinaldo, Samir Suweis, Amos Maritan

Generalized Langevin equations (GLE) with multiplicative white Poisson noise pose the usual prescription dilemma leading to different evolution equations (master equations) for the probability distribution. Contrary to the case of multiplicative gaussian w ...

2011

Quantum fluctuations of one-dimensional free fermions and Fisher-Hartwig formula for Toeplitz determinants

We revisit the problem of finding the probability distribution of a fermionic number of one-dimensional spinless free fermions on a segment of a given length. The generating function for this probability distribution can be expressed as a determinant of a ...

2011

Markov Chain Modeling And Analysis Of Complicated Phenomena In Coupled Chaotic Oscillators

Martin Hasler

In this paper, we propose a Markov chain modeling of complicated phenomena observed from coupled chaotic oscillators. Once we obtain the transition probability matrix from computer simulation results, various statistical quantities can be easily calculated ...

2010

The Metropolized Partial Importance Sampling MCMC mixes slowly on minimal reversal rearrangement paths

Krister Swenson

Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a negative result on the rate of convergence of the generally used Markov chains. ...

2010

Speeding up Markov Chain Monte Carlo without Likelihood

Jonas Helfer

This article presents the implementation and initial test results for an algorithm called SuffStat MCMC, which aims to speed up Approximate Bayesian Computation without likelihood. ...

2010

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

Sliding Window Abstraction for Infinite Markov Chains

Maria-Emanuela-Canini Mateescu, Verena Wolf

We present an 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 an ...

2009

Stationary Features and Cat Detection

François Fleuret

Most discriminative techniques for detecting instances from object categories in still images consist of looping over a partition of a pose space with dedicated binary classifiers. The efficiency of this strategy for a complex pose, i.e., for fine-grained ...

2008

Stationary Features and Cat Detection

François Fleuret

IDIAP2007