A Markov model for the spread of Hepatitis C (2008)
Coutin, Laure, Decreusefond, Laurent, Dhersin, Jean-Stephane
We propose a Markov model for the spread of Hepatitis C virus (HCV) among drug users who use injections. We then proceed to an asymptotic analysis (large initial population) and show that the Markov...
A Markov model for the spread of Hepatitis C (2008)
Coutin, Laure, Decreusefond, Laurent, Dhersin, Jean-Stephane
We propose a Markov model for the spread of Hepatitis C virus (HCV) among drug users who use injections. We then proceed to an asymptotic analysis (large initial population) and show that the Markov...
A Markov model for the spread of Hepatitis C (2008)
Coutin, Laure, Decreusefond, Laurent, Dhersin, Jean-Stephane
We propose a Markov model for the spread of Hepatitis C virus (HCV) among drug users who use injections. We then proceed to an asymptotic analysis (large initial population) and show that the Markov...
A Markov model for the spread of Hepatitis C (2008)
Coutin, Laure, Decreusefond, Laurent, Dhersin, Jean-Stephane
We propose a Markov model for the spread of Hepatitis C virus (HCV) among drug users who use injections. We then proceed to an asymptotic analysis (large initial population) and show that the Markov...
A Markov model for the spread of Hepatitis C (2008)
Coutin, Laure, Decreusefond, Laurent, Dhersin, Jean-Stephane
We propose a Markov model for the spread of Hepatitis C virus (HCV) among drug users who use injections. We then proceed to an asymptotic analysis (large initial population) and show that the Markov...
Upper bound of loss probability in an OFDMA system with randomly located users (2007)
Decreusefond, Laurent, Ferraz, Eduardo, Martins, Philippe
For OFDMA systems, we find a rough but easily computed upper bound for the probability of loosing communications by insufficient number of sub-channels on downlink. We consider as random the...
Upper bound of loss probability in an OFDMA system with randomly located users (2007)
Decreusefond, Laurent, Ferraz, Eduardo, Martins, Philippe
For OFDMA systems, we find a rough but easily computed upper bound for the probability of loosing communications by insufficient number of sub-channels on downlink. We consider as random the...
Upper bound of loss probability in an OFDMA system with randomly located users (2007)
Decreusefond, Laurent, Ferraz, Eduardo, Martins, Philippe
For OFDMA systems, we find a rough but easily computed upper bound for the probability of loosing communications by insufficient number of sub-channels on downlink. We consider as random the...
Upper bound of loss probability in an OFDMA system with randomly located users (2007)
Decreusefond, Laurent, Ferraz, Eduardo, Martins, Philippe
For OFDMA systems, we find a rough but easily computed upper bound for the probability of loosing communications by insufficient number of sub-channels on downlink. We consider as random the...
Fluid limit of a heavily loaded EDF queue with impatient customers (2007)
Decreusefond, Laurent, Moyal, Pascal
In this paper we present the fluid limit of an heavily loaded Earliest Deadline First queue with impatient customers, represented by a measure-valued process keeping track of residual time-credits of...
Rubinstein distance on configurations spaces (2007)
Decreusefond, Laurent, Savy, Nicolas
By a method inspired of the Stein's method, we derive an upper-bound of the Rubinstein distance between two absolutely continuous probability measures on configurations space. As an application, we...
A functional central limit theorem for the M/GI/infinity queue (2007)
Decreusefond, Laurent, Moyal, Pascal
In this paper, we present a functional fluid limit theorem and a functional central limit theorem for a queue with an infinity of servers M/GI/$\infty$. The system is represented by a point-measure...
Rubinstein distance on configurations spaces (2007)
Decreusefond, Laurent, Savy, Nicolas
By a method inspired of the Stein's method, we derive an upper-bound of the Rubinstein distance between two absolutely continuous probability measures on configurations space. As an application, we...
A functional central limit theorem for the M/GI/infinity queue (2006)
Decreusefond, Laurent, Moyal, Pascal
In this paper, we present a functional fluid limit theorem and a functional central limit theorem for a queue with an infinity of servers M/GI/$\infty$. The system is represented by a point-measure...
Hitting times for Gaussian processes (2006)
Decreusefond, Laurent, Nualart, David
We establish a general formula for the Laplace transform of the hitting times of a Gaussian process. Some consequences are derived, and particular cases like the fractional Brownian motion are...
Fluid limit of a heavily loaded EDF queue with impatient customers (2005)
Decreusefond, Laurent, Moyal, Pascal
In this paper we present the fluid limit of an heavily loaded Earliest Deadline First queue with impatient customers, represented by a measure-valued process keeping track of residual time-credits of...
Filtered Brownian motions as weak limit of filtered Poisson processes (2005)
Decreusefond, Laurent, Savy, Nicholas
The main result of this paper is a limit theorem which shows the convergence in law, on a Hölderian space, of filtered Poisson processes (a class of processes which contains shot noise process) to...
C. R. Acad. Sci. Paris, t. 332, Srie I, p. 1--6, 2001 - PXMA????.TEX - (2002)
We construct a Stratonovitch-Skorohod-like stochastic integral for general Gaussian processes. We study its sample-paths regularity and one of its numerical approximating schemes. We also analyze the...
Fractional Brownian Motion: Theory And Applications (1998)
Laurent Decreusefond, Suleyman Ust Unel
We present new theoretical results on the fractional Brownian motion, including different definitions (and their relationships) of the stochastic integral with respect to this process, Girsanov...
An Approximate Analysis of Waiting Time in Multi-classes Queues (1997)
Ken Chen, Laurent Decreusefond
This paper deals with non-preemptive and work-conserving M/G/1 queues ordered by the Earliest-Deadline-First (EDF) queueing discipline. The EDF discipline is more and more used for handling real-time...
An Approximate Analysis of Waiting Time in Multi-classes M/G/1/./EDF Queues (1997)
Ken Chen, Laurent Decreusefond
This paper deals with non-preemptive and work-conserving M/G/1 queues ordered by the Earliest-Deadline-First (EDF) queueing discipline. The EDF discipline is more and more used for handling real-time...
On The Error-Correcting Capabilities Of Cycle Codes Of Graphs (1996)
We are interested in a function f(p) that represents the probability that a random subset of edges of a Delta-regular graph G contains half the edges of some cycle of G. f(p) is also the probability...
On The Error-Correcting Capabilities Of Cycle Codes Of Graphs (1996)
We are interested in a function f(p) that represents the probability that a random subset of edges of a Delta-regular graph G contains half the edges of some cycle of G. f(p) is also the probability...
Une inégalité d'interpolation sur l'espace de Wiener (1995)
Laurent Decreusefond, Yaozhong Hu, Ali Suleyman
In this note we prove an interpolation inequality in L p -norm between the Sobolev spaces of order 0 and 2 on the Wiener space. R'esum'e Dans cette note nous d'emontrons une in'egalit'e...