6 citations · 10 across the 9 of their papers we have counts for
12 papers
Mean squared error reduction of (plug-in) look-ahead estimators for Markov chains
Romain Azaïs, Benoît Henry, Henri Péchoux
We consider the estimation of the invariant distribution of a Markov kernel on a discrete state space (or of the mean value of a functional under ) when solving t…
Macroscopic Activity-Based Modeling of Urban Active Mobility
Romain Azaïs, Adrien Marion, Florian Patout
This paper develops a macroscopic, activity-based model of urban active mobility using nonintrusive sensor data. It introduces attendance functions to describe spatio-temporal trav…
Asymptotic Analysis and Practical Evaluation of Jump Rate Estimators in Piecewise-Deterministic Markov Processes
Romain Azaïs, Solune Denis
Piecewise-deterministic Markov processes (PDMPs) offer a powerful stochastic modeling framework that combines deterministic trajectories with random perturbations at random times.…
Detection of Common Subtrees with Identical Label Distribution
Romain Azaïs, Florian Ingels
Frequent pattern mining is a relevant method to analyse structured data, like sequences, trees or graphs. It consists in identifying characteristic substructures of a dataset. This…
Isomorphic unordered labeled trees up to substitution ciphering
Florian Ingels, Romain Azaïs
Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the…
Maximum likelihood estimation for spinal-structured trees
Romain Azaïs, Benoît Henry
We investigate some aspects of the problem of the estimation of birth distributions (BD) in multi-type Galton-Watson trees (MGW) with unobserved types. More precisely, we consider…
Enumeration of Irredundant Forests
Florian Ingels, Romain Azaïs
Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has alr…
Estimation of the average number of continuous crossings for non-stationary non-diffusion processes
Romain Azaïs, Alexandre Genadot
Assume that you observe trajectories of a non-diffusive non-stationary process and that you are interested in the average number of times where the process crosses some threshold (…
Inference for conditioned Galton-Watson trees from their Harris path
Romain Azaïs, Alexandre Genadot, Benoît Henry
Tree-structured data naturally appear in various fields, particularly in biology where plants and blood vessels may be described by trees, but also in computer science because XML…
Optimal choice among a class of nonparametric estimators of the jump rate for piecewise-deterministic Markov processes
Romain Azaïs, Aurélie Muller-Gueudin
A piecewise-deterministic Markov process is a stochastic process whose behavior is governed by an ordinary differential equation punctuated by random jumps occurring at random time…
Piecewise deterministic Markov process - recent results
Romain Azaïs, Jean-Baptiste Bardet, Alexandre Genadot +2
We give a short overview of recent results on a specific class of Markov process: the Piecewise Deterministic Markov Processes (PDMPs). We first recall the definition of these proc…
A recursive nonparametric estimator for the transition kernel of a piecewise-deterministic Markov process
Romain Azaïs
In this paper, we investigate a nonparametric approach to provide a recursive estimator of the transition density of a non-stationary piecewise-deterministic Markov process, from o…