Search results for "PROB"
showing 10 items of 8859 documents
Study and Comparison of Surface Roughness Measurements
2014
Journées du Groupe de Travail en Modélisation Géométrique (GTMG'14), Lyon; This survey paper focus on recent researches whose goal is to optimize treatments on 3D meshes, thanks to a study of their surface features, and more precisely their roughness and saliency. Applications like watermarking or lossy compression can benefit from a precise roughness detection, to better hide the watermarks or quantize coarsely these areas, without altering visually the shape. Despite investigations on scale dependence leading to multi-scale approaches, an accurate roughness or pattern characterization is still lacking, but challenging for those treatments. We think there is still room for investigations t…
Discovering human mobility from mobile data : probabilistic models and learning algorithms
2020
Smartphone usage data can be used to study human indoor and outdoor mobility. In our work, we investigate both aspects in proposing machine learning-based algorithms adapted to the different information sources that can be collected.In terms of outdoor mobility, we use the collected GPS coordinate data to discover the daily mobility patterns of the users. To this end, we propose an automatic clustering algorithm using the Dirichlet process Gaussian mixture model (DPGMM) so as to cluster the daily GPS trajectories. This clustering method is based on estimating probability densities of the trajectories, which alleviate the problems caused by the data noise.By contrast, we utilize the collecte…
Synchronization and fluctuations for interacting stochastic systems with individual and collective reinforcement
2020
The Pólya urn is the paradigmatic example of a reinforced stochastic process. It leads to a random (non degenerated) time-limit. The Friedman urn is a natural generalization whose a.s. time-limit is not random anymore. In this work, in the stream of previous recent works, we introduce a new family of (finite) systems of reinforced stochastic processes, interacting through an additional collective reinforcement of mean field type. The two reinforcement rules strengths (one componentwise, one collective) are tuned through (possibly) different rates n −γ. In the case the reinforcement rates are like n −1 , these reinforcements are of Pólya or Friedman type as in urn contexts and may thus lead …
Statistics of transitions for Markov chains with periodic forcing
2013
The influence of a time-periodic forcing on stochastic processes can essentially be emphasized in the large time behaviour of their paths. The statistics of transition in a simple Markov chain model permits to quantify this influence. In particular the first Floquet multiplier of the associated generating function can be explicitly computed and related to the equilibrium probability measure of an associated process in higher dimension. An application to the stochastic resonance is presented.
PARAMETER ESTIMATION FOR FRACTIONAL ORNSTEIN-UHLENBECK PROCESSES: NON-ERGODIC CASE
2011
We consider the parameter estimation problem for the non-ergodic fractional Ornstein-Uhlenbeck process defined as $dX_t=\theta X_tdt+dB_t,\ t\geq0$, with a parameter $\theta>0$, where $B$ is a fractional Brownian motion of Hurst index $H\in(1/2,1)$. We study the consistency and the asymptotic distributions of the least squares estimator $\hat{\theta}_t$ of $\theta$ based on the observation $\{X_s,\ s\in[0,t]\}$ as $t\rightarrow\infty$.
Exact simulation of diffusion first exit times: algorithm acceleration
2020
In order to describe or estimate different quantities related to a specific random variable, it is of prime interest to numerically generate such a variate. In specific situations, the exact generation of random variables might be either momentarily unavailable or too expensive in terms of computation time. It therefore needs to be replaced by an approximation procedure. As was previously the case, the ambitious exact simulation of exit times for diffusion processes was unreachable though it concerns many applications in different fields like mathematical finance, neuroscience or reliability. The usual way to describe exit times was to use discretization schemes, that are of course approxim…
Variable Length Markov Chains, Persistent Random Walks: a close encounter
2020
This is the story of the encounter between two worlds: the world of random walks and the world of Variable Length Markov Chains (VLMC). The meeting point turns around the semi-Markov property of underlying processes.
Statistical consequences of the Devroye inequality for processes. Applications to a class of non-uniformly hyperbolic dynamical systems
2005
In this paper, we apply Devroye inequality to study various statistical estimators and fluctuations of observables for processes. Most of these observables are suggested by dynamical systems. These applications concern the co-variance function, the integrated periodogram, the correlation dimension, the kernel density estimator, the speed of convergence of empirical measure, the shadowing property and the almost-sure central limit theorem. We proved in \cite{CCS} that Devroye inequality holds for a class of non-uniformly hyperbolic dynamical systems introduced in \cite{young}. In the second appendix we prove that, if the decay of correlations holds with a common rate for all pairs of functio…
Persistent random walks, variable length Markov chains and piecewise deterministic Markov processes *
2013
A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the dynamics of $(S_t)$. This so-called "persistent" random walk is nolonger Markovian and, under suitable conditions, the rescaled process converges towards the integrated telegraph noise (ITN) as the time-scale and space-scale parameters tend to zero (see Herrmann and Vallois, 2010; Tapiero-Vallois, Tapiero-Vallois2}). The ITN process is effectively non-Markovian too. The aim is to consider persistent random walks $(S_t)$ whose increments are Markov chains with…
The central limit theorem for linear eigenvalue statistics of the sum of independent random matrices of rank one
2014
International audience