A Backward Particle Interpretation of Feynman-Kac Formulae
|
|
- Theodora Haynes
- 6 years ago
- Views:
Transcription
1 A Backward Particle Interpretation of Feynman-Kac Formulae Pierre Del Moral, Arnaud Doucet, Sumeetpal Singh To cite this version: Pierre Del Moral, Arnaud Doucet, Sumeetpal Singh. A Backward Particle Interpretation of Feynman- Kac Formulae. [Research Report] RR-7019, 2009, pp.21. <inria v1> HAL Id: inria Submitted on 18 Aug 2009 v1, last revised 1 Oct 2009 v2 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
2 ISTITUT ATIOAL DE RECHERCHE E IFORMATIQUE ET E AUTOMATIQUE A Backward Particle Interpretation of Feynman-Kac Formulae Pierre Del Moral Arnaud Doucet Sumeetpal S. Singh 7019 July 2009 Thème UM a pport d e r e cherche ISS ISR IRIA/RR FR+EG
3
4 A Backward Particle Interpretation of Feynman-Kac Formulae Pierre Del Moral, Arnaud Doucet, Sumeetpal S. Singh Thème UM Systèmes numériques Équipes-Projets ALEA Rapport de recherche n 7019 July pages Abstract: We design a particle interpretation of Feynman-Kac measures on path spaces based on a backward Markovian representation combined with a traditional mean field particle interpretation of the flow of their final time marginals. In contrast to traditional genealogical tree based models, these new particle algorithms can be used to compute normalized additive functionals on-the-fly as well as their limiting occupation measures with a given precision degree that does not depend on the final time horizon. We provide uniform convergence results w.r.t. the time horizon parameter as well as functional central limit theorems and exponential concentration estimates, yielding what seems to be the first results of this type for this class of models. We also illustrate these results in the context of computational physics and imaginary time Schroedinger type partial differential equations, with a special interest in the numerical approximation of the invariant measure associated to h-processes. Key-words: Feynman-Kac models, mean field particle algorithms, functional central limit theorems, exponential concentration, non asymptotic estimates. Centre IRIA Bordeaux et Sud-Ouest & Institut de Mathématiques de Bordeaux, Université de Bordeaux I, 351 cours de la Libération Talence cedex, France, Pierre.Del-Moral@inria.fr Department of Statistics & Department of Computer Science, University of British Columbia, Agricultural Road, Vancouver, BC, V6T 1Z2, Canada, and The Institute of Statistical Mathematics, Minami-Azabu, Minato-ku, Tokyo , Japan arnaud@stat.ubc.ca Department of Engineering, University of Cambridge, Trumpington Street, CB2 1PZ, United Kingdom, sss40@cam.ac.uk Centre de recherche IRIA Bordeaux Sud Ouest Domaine Universitaire - 351, cours de la Libération Talence Cedex Téléphone :
5 A Backward Particle Interpretation of Feynman-Kac Formulae Résumé : ous présentons de nouvelles interprétations particulaires de mesures de Feynman-Kac trajectorielles fondées sur une représentation markovienne à rebours de ces modèles, couplée avec les interprétations particulaires de type champ moyen classiques du flot des mesures marginales par rapport aux temps terminaux. A la différence des algorithmes particulaires fondés sur des évolutions d arbres généalogiques, ces nouvelles techniques permettent de calculer récursivement des fonctionnelles additives normalisées et leur mesures limites avec un degré de précision uniforme par rapport à l horizon temporel considéré. ous proposons des résultats de convergence uniformes par rapport à l horizon temporel, ainsi que des théorèmes de la limite centrale fonctionnels et des inégalités de concentration exponentielles. Ces résultats semblent être les premiers de ce type pour cette classe d algorithmes particulaires. ous illustrons ces résultats en physique numérique avec des approximations particulaires d équations aux dérivées partielles de type Schroedinger et le calcul effectif des mesures stationnaires associées aux h-processus. Mots-clés : Modèles de Feynman-Kac, algorithmes stochastiques de type champ moyen, théorème de la limite centrale fonctionnels, inégalités de concentration exponentielle, estimations non asymptotiques
6 A Backward Particle Interpretation of Feynman-Kac Formulae 3 1 Introduction Let E n n 0 be a sequence of measurable spaces equipped with some σ-fields E n n 0, and we let PE n be the set of all probability measures over the set E n, with n 0. We let X n be a Markov chain with Markov transition M n on E n, and we consider a sequence of 0,1]-valued potential functions G n on the set E n. The Feynman-Kac path measure associated with the pairs M n, G n is the probability measure Q n on the product state space E [0,n] := E 0... E n defined by the following formula dq n := 1 Z n 0 p<n G p X p dp n 1.1 where Z n is a normalizing constant and P n is the distribution of the random paths X p 0 p n of the Markov process X p from the origin p = 0, up to the current time p = n. We also denote by Γ n = Z n Q n its unnormalized version. These distributions arise in a variety of application areas, including filtering, Bayesian inference, branching processes in biology, particle absorption problems in physics and many other instances. We refer the reader to the pair of books [4, 9] and references therein. Feynman-Kac models also play a central role in the numerical analysis of certain partial differential equations, offering a natural way to solve these functional integral models by simulating random paths of stochastic processes. These Feynman-Kac models were originally presented by Mark Kac in 1949 [11] for continuous time processes. These continuous time models are used in molecular chemistry and computational physics to calculate the ground state energy of some Hamiltonian operators associated with some potential function V describing the energy of a molecular configuration see for instance [1, 5, 13, 16], and references therein. To better connect these partial differential equation models with 1.1, let us assume that M n x n 1, dx n is the Markov probability transition X n = x n X n+1 = x n+1 coming from a discretization in time X n = X t n of a continuous time E-valued Markov process X t on a given time mesh t n n 0 with a given time step t n t n 1 = t. For potential functions of the form G n = e V t, the measures Q n t 0 Q tn represents the time discretization of the following distribution: dq t = 1 t exp Z t 0 V X s ds dp X t where P X t stands for the distribution of the random paths X s 0 s t with a given infinitesimal generator L. The marginal distributions γ t at time t of the unnormalized measures Z t dq t are the solution of the so-called imaginary time Schroedinger equation, given in weak formulation on every sufficiently regular function f by d dt γ tf := γ t L V f with L V = L V The errors introduced by the discretization of the time are well understood for regular models, we refer the interested reader to [6, 8, 12, 14] in the context of nonlinear filtering. In this article, we design an numerical approximation of the distributions Q n based on the simulation of a sequence of mean field interacting particle systems. In molecular chemistry, these evolutionary type models are often interpreted as a quantum or diffusion Monte Carlo model. In this context, particles often are referred as walkers, to distinguish the virtual particle-like objects to physical particles, like electrons of atoms. In contrast to traditional genealogical tree based approximations see for instance [4], the particle model presented in this article can approximate additive functionals of the form 1 F n x 0,...,x n = f p x p 1.2 n p n RR n 7019
7 4 Del Moral & Doucet & Singh uniformly with respect to the time horizon. Moreover this computation can be done on-the-fly. To give a flavor of the impact of these results, we recall that the precision of the algorithm corresponds to the size of the particle system. If Q n stands for the -particle approximation of Q n, under some appropriate regularity properties, we shall prove the following uniform and non asymptotic Gaussian concentration estimates 1 : 1 log sup P n 0 [Q n Q n ]F n b + ǫ ǫ 2 /2b 2 for any ǫ > 0, and for some finite constant b <. For time homogeneous models M n, f n, G n = M, f, G associated with a lower bounded potential function G > δ, and a M-reversible transition w.r.t. to some probability measure µ s.t. Mx,. µ and Mx,./dµ L 2 µ, it can be established that Q n F n converges to µ h f, as n, with the measure µ h defined below µ h dx := 1 µhmh hx Mhx µdx In the above display, h is a positive eigenmeasure associated with the top eigenvalue of the integral operator Qx, dy = GxMx, dy on L 2 µ see for instance section 12.4 in [4]. This measure µ h is in fact the invariant measure of the h-process defined as the Markov chain X h with elementary Markov transitions M h x, dy Mx, dyhy. As the initiated reader would have certainly noticed, the above convergence result is only valid under some appropriate mixing conditions on the h-process. The long time behavior of these h-processes and their connections to various applications areas of probability, analysis, geometry and partial differential equations, have been the subject of countless papers for many years in applied probability. In our framework, using elementary manipulations, the Gaussian estimate given above can be used to calibrate the convergence of the particle estimate Q n F n towards µ h f, as the pair of parameters and n. The rest of this article is organized as follows: In section 2, we describe the mean field particle models used to design the particle approximation measures Q n. In section 3, we state the main results presented in this article, including a functional central limit theorem, and non asymptotic mean error bounds. Section 4 is dedicated to a key backward Markov chain representation of the measures Q n. The analysis of our particle approximations is provided in section 5. The final two sections, section 6 and section 7, are mainly concerned with the proof of the two main theorems presented in section 3. For the convenience of the reader, we end this introduction with some notation used in the present article. We denote respectively by ME, and BE, the set of all finite signed measures on some measurable space E, E, and the Banach space of all bounded and measurable functions f equipped with the uniform norm f. We let µf = µdx fx, be the Lebesgue integral of a function f BE, with respect to a measure µ ME. We recall that a bounded integral kernel Mx, dy from a measurable space E, E into an auxiliary measurable space E, E is an operator f Mf from BE into BE such that the functions x Mfx := Mx, dyfy E are E-measurable and bounded, for any f BE. In the above displayed formulae, dy stands for an infinitesimal neighborhood of a point y in E. The kernel M also generates a dual operator µ µm from ME into ME defined by µmf := µmf. A Markov kernel is a positive and bounded integral operator M with M1 = 1. Given a pair of bounded integral operators M 1, M 2, we let M 1 M 2 the composition operator defined by M 1 M 2 f = M 1 M 2 f. For time homogenous state spaces, we denote by M m = M m 1 M = MM m 1 the m-th composition of a given bounded integral 1 Consult the last paragraph of this section for a statement of the notation used in this article. IRIA
8 A Backward Particle Interpretation of Feynman-Kac Formulae 5 operator M, with m 1. Given a positive function G on E, we let Ψ G : η PE Ψ G η PE, be the Boltzmann-Gibbs transformation defined by Ψ G ηdx := 1 ηg 2 Description of the models Gx ηdx The numerical approximation of the path-space distributions 1.1 requires extensive calculations. The mean field particle interpretation of these models are based on the fact that the flow of the n-th time marginals η n of the measures Q n satisfy a non linear evolution equation of the following form η n+1 dy = η n dxk n+1,ηn x, dy 2.1 for some collection of Markov transitions K n+1,η, indexed by the time parameter n 0 and the set of probability measures PE n. The mean field particle interpretation of the nonlinear measure valued model 2.1 is the En -valued Markov chain ξ n = ξn, 1 ξn, 2...,ξn E n with elementary transitions defined as P ξ n+1 dx ξ n = i=1 K n+1,η n ξ i n, dx i with η n := 1 j=1 δ ξ j n 2.2 In the above displayed formula, dx stands for an infinitesimal neighborhood of the point x = x 1,...,x En+1. The initial system ξ 0 consists of independent and identically distributed random variables with common law η 0. We let Fn := σ ξ 0,...,ξ n be the natural filtration associated with the -particle approximation model defined above. The resulting particle model coincides with a genetic type stochastic algorithm ξ n ξ n ξ n+1 with selection transitions ξ n ξ n and mutation transitions ξ n ξ n+1 dictated by the potential or fitness functions G n and the Markov transitions M n+1. During the selection stage ξ n ξ n, for every index i, with a probability ǫ n G n ξn, i we set ξ n i = ξn, i otherwise we replace ξn i with a new individual ξ n i = ξn j randomly chosen from the whole population with a probability proportional to G n ξn. j The parameter ǫ n 0 is a tuning parameter that must satisfy the constraint ǫ n G n ξn i 1, for every 1 i. For ǫ n = 0, the resulting proportional selection transition corresponds to the so-called simple genetic model. During the mutation stage, the selected particles ξ n i ξn+1 i evolve independently according to the Markov transitions M n+1. If we interpret the selection transition as a birth and death process, then arises the important notion of the ancestral line of a current individual. More precisely, when a particle ξ n 1 i ξn i evolves to a new location ξn, i we can interpret ξ n 1 i as the parent of ξn. i Looking backwards in time and recalling that the particle ξ n 1 i has selected a site ξ j n 1 in the configuration at time n 1, we can interpret this site ξ j n 1 as the parent of ξ n 1 i and therefore as the ancestor denoted ξn 1,n i at level n 1 of ξn. i Running backwards in time we may trace the whole ancestral line ξ i 0,n ξ i 1,n... ξ i n 1,n ξ i n,n = ξ i n 2.3 More interestingly, the occupation measure of the corresponding -genealogical tree model converges as to the conditional distribution Q n. For any function F n on the path space E [0,n], we have the following convergence to be stated precisely later as, RR n 7019 lim 1 F n ξ0,n, i ξ1,n, i...,ξn,n i = i=1 Q n dx 0,...,x n F n x 0,...,x n 2.4
9 6 Del Moral & Doucet & Singh This convergence result can be refined in various directions. evertheless, the asymptotic variance σnf 2 n of the above occupation measure around Q n increases quadratically with the final time horizon n for additive functions of the form F n x 0,...,x n = f p x p σnf 2 n n p n with some collection of non negative functions f p on E p. To be more precise, let us examine a time homogeneous model E n, f n, G n, M n = E,f, G, M with constant potential functions G n = 1 and mutation transitions M s.t. η 0 M = η 0. For the choice of the tuning parameter ǫ = 0, using the asymptotic variance formulae in [4, eqn. 9.13, page 304 ], for any function f s.t. η 0 f = 0 and η 0 f 2 = 1 we prove that 2 σnf 2 n = E M q p+ fx q 0 p n 0 q n with the positive part a + = maxa,0 and the convention M 0 = Id, the identity transition. For Mx, dy = η 0 dy, we find that 2 σnf 2 n = E fx q = n + 1n + 2/ p n 0 q p We further assume that the Markov transitions M n x n 1, dx n are absolutely continuous with respect to some measures λ n dx n on E n and we have H x n 1, x n E n 1 E n H n x n 1, x n = dm nx n 1,. dλ n x n > 0 In this situation, we have the backward decomposition formula Q n dx 0,...,x n = η n dx n M n x n, dx 0,...,x n with the Markov transitions M n defined below M n x n, dx 0,...,x n 1 := n M q,ηq 1 x q, dx q 1 In the above display, M n+1,η is the collection of Markov transitions defined for any n 0 and η PE n by 1 M n+1,η x, dy = η G n H n+1., x G ny H n+1 y,x ηdy 2.8 A detailed proof of this formula and its extended version is provided in section 4. Using the representation in 2.7, one natural way to approximate Q n is to replace the measures η n with their -particle approximations η n. The resulting particle approximation measures, Q n, is then Q n dx 0,...,x n := η n dx n M n x n, dx 0,...,x n with the random transitions M n x n, dx 0,...,x n 1 := q=1 n M q,η q 1 x q, dx q q=1 IRIA
10 A Backward Particle Interpretation of Feynman-Kac Formulae 7 At this point, it is convenient to recall that for any bounded measurable function f n on E n, the measures η n can be written as follows: η n f n := γ nf n with γ n f n := E f n X n G p X p = η n f n η p G p 2.11 γ n 1 0 p<n 0 p<n The multiplicative formula in the r.h.s. of 2.11 is easily checked using the fact that γ n+1 1 = γ n G n = η n G n γ n 1. Mimicking the above formulae, we set Γ n = γn 1 Q n with γn 1 := ηp G p and γn dx = γn 1 ηn dx 0 p<n otice that the -particle approximation measures Q n can be computed recursively with respect to the time parameter. For instance, for linear functionals of the form 2.5, we have Q n F n = η n F n with a sequence of random functions Fn on E n that can be computed on-the-fly according to the following recursion Fn = ] [M n,η...m n 1 p+1,η f p p = f n + M n,η n 1 Fn 1 0 p n with the initial value F 0 = f 0. In contrast to the genealogical tree based particle model 2.4, this new particle algorithm requires 2 computations instead of, in the sense that: 1 j F n ξ j n = f n ξ j n + 1 i G n 1 ξ i n 1H n ξ i n 1, ξ j n 1 i G n 1ξ i n 1 H nξ i n 1, ξj n F n 1ξ i n 1 The convergence analysis of the -particle measures Q n towards their limiting value Q n, as, is intimately related to the convergence of the flow of particle measures ηp 0 p n towards their limiting measures η p 0 p n. Several estimates can be easily derived more or less directly from the convergence analysis of the particle occupation measures ηn developed in [4], including L p -mean error bounds and exponential deviation estimates. It is clearly out of the scope of the present work to review all these consequences. One of the central objects in this analysis is the local sampling errors Vn induced by the mean field particle transitions and defined by the following stochastic perturbation formula ηn = ηn 1K n,η n Vn 2.12 The fluctuation and the deviations of these centered random measures Vn can be estimated using non asymptotic Kintchine s type L r -inequalities, as well as Hoeffding s or Bernstein s type exponential deviations [4, 7]. We also proved in [3] that these random perturbations behave asymptotically as Gaussian random perturbations. More precisely, for any fixed time horizon n 0, the sequence of random fields Vn converges in law, as the number of particles tends to infinity, to a sequence of independent, Gaussian and centered random fields V n ; with, for any bounded function f on E n, and n 0, EV n f 2 = η n 1 dxk n,ηn 1 x, dy fy K n,ηn 1 fx In section 5, we provide some key decompositions expressing the deviation of the particle measures Γ n, Q n around their limiting values Γ n, Q n in terms of these local random fields models. These decomposition can be used to derive almost directly some exponential and L p -mean error bounds using the stochastic analysis developed in [4]. We shall use these functional central limit theorems and some of their variations in various places in the present article. RR n 7019
11 8 Del Moral & Doucet & Singh 3 Statement of some results In the present article, we have chosen to concentrate on functional central limit theorems, as well as on non asymptotic variance theorems in terms of the time horizon. To describe our results, it is necessary to introduce the following notation. Let βm denote the Dobrushin coefficient of a Markov transition M from a measurable space E into another measurable space E which defined by the following formula βm := sup {oscmf ; f Osc 1 E } where Osc 1 E stands the set of E -measurable functions f with oscillation, denoted oscf = sup { fx fy ; x, y E }, less than or equal to 1. Some stochastic models discussed in the present article are based on sequences of random Markov transitions M that depend on some mean field particle model with random particles. In this case, βm may fail to be measurable. For this type of models we shall use outer probability measures to integrate these quantities. For instance, the mean value E βm is to be understood as the infimum of the quantities EB where B βm are measurable dominating functions. We also recall that γ n satisfy the linear recursive equation γ n = γ p Q p,n with Q p,n = Q p+1 Q p+2...q n and Q n x, dy = G n 1 x M n x, dy for any 0 p n. Using elementary manipulations, we also check that Γ n F n = γ p D p,n F n with the bounded integral operators D p,n from E p into E [0,n] defined below with D p,n F n x p := M p x p, dx 0,...,x Q p,n x p, dx p+1,...,x n F n x 0,...,x n 3.1 Q p,n x p, dx p+1,...,x n := p q<n Q q+1 x q, dx q+1 We also let G p,n, P p,n be the pair of potential functions and Markov transitions defined below G p,n = Q p,n 1/η p Q p,n 1 and P p,n F n = D p,n F n /D p,n Let the mapping Φ p,n : PE p PE n, 0 p n, be defined as follows Φ p,n µ p = µ pq p,n µ p Q p,n 1 Our first main result is a functional central limit theorem for the pair of random fields on BE [0,n] defined below Wn Γ, := Γ n Γ n and Wn Q, := [Q n Q n ] W Γ, n is centered in the sense that E Wn Γ, F n = 0 for any F n BE [0,n]. The proof of this surprising unbiasedness property can be found in corollary 5.3, in section 5. The first main result of this article is the following multivariate fluctuation theorem. Theorem 3.1 We suppose that the following regularity condition is met for any n 1 and for any pair of states x, y E n 1, E n H + h n y H n x, y h + n y with h + n /h n L 4 η n and h + n L 1 λ n 3.3 IRIA
12 A Backward Particle Interpretation of Feynman-Kac Formulae 9 In this situation, the sequence of random fields Wn Γ,, resp. Wn Q,, converge in law, as, to the centered Gaussian fields Wn Γ, resp. Wn Q, defined for any F n BE [0,n] by W Γ n F n = W Q n F n = n γ p 1 V p D p,n F n p=0 n V p G p,n P p,n F n Q n F n p=0 The second main result of the article is the following non asymptotic theorem. Theorem 3.2 For any r 1, n 0, F n BE [0,n] s.t. F n 1 E [Q n Q n ]F n r 1 r a r 0 p n b 2 p,n c p,n 3.4 for some finite constants a r < whose values only depend on the parameter r, and a pair of constants b p,n, c p,n such that b p,n supq p,n 1x/Q p,n 1y and c p,n E βpp,n x,y In the above display, P p,n stands for the random Markov transitions defined as P p,n by replacing in 3.1 and 3.2 the transitions M p by M p. For linear functionals of the form 2.5, with f n Osc 1 E n, the constant c p,n in 3.4 can be chosen so that c p,n 0 q<p β M p,η...m q+1,η + q p q n b 2 q,n βs p,q 3.5 with the Markov transitions S p,q from E p into E q defined for any function f BE q by the following formula S p,q f = Q p,q f/q p,q 1. We emphasize that the L r -mean error bounds described in the above theorem enter the stability properties of the semigroups S p,q and the one associated with the backward Markov transitions M n+1,η n. In several instances, the term in the r.h.s. of 3.5 can be uniformly bounded with respect to the time horizon. For instance, in the toy example we discussed in 2.6, we have the estimates b p,n = 1 and c p,n 1 = [Q E n Q n ]F n r 1 r a r n + 1 In more general situations, these estimates are related to the stability properties of the Feynman- Kac semigroup. To simplify the presentation, let us suppose that the pair of potential-transitions G n, M n are time homogeneous G n, H n, M n = G, H, M and chosen so that the following regularity condition is satisfied M m x, x 2 Gx δ Gx and M m x, dy ρ M m x, dy 3.6 for some m 1 and some parameters δ, ρ [1, 2. Under this rather strong condition, we have b p,n ρδ m and βs p,q 1 ρ 2 δ m q p/m See for instance corollary in [4] and the more recent article [2]. On the other hand, let us suppose that inf x,y,y Hx, y/hx, y = αh > 0 RR n 7019
13 10 Del Moral & Doucet & Singh In this case, we have M n,η x, dy αh 2 M n,η x, dy = β M p,η...m q+1,η 1 αh 2 p q q For linear functional models of the form 2.5 associated with functions f n Osc 1 E n, it is now readily checked that E [Q n Q n ]F n r 1 r a r b n for some finite constant b < whose values do not depend on the time parameter n. With some information on the constants a r, these L r -mean error bounds can turned to uniform exponential estimates w.r.t. the time parameter for normalized additive functionals of the following form F n x 0,...,x n := 1 n p n f p x p To be more precise, by lemma in [4], the collection of constants a r in 3.7 can be chosen so that a 2r 2r 2r! 2 r /r! and a 2r+1 2r+1 2r + 1! 2 r /r! 3.8 In this situation, it is easily checked that for any ǫ > 0, and 1, we have the following uniform Gaussian concentration estimates: 1 [Q log sup P n Q n ]F n b + ǫ ǫ 2 /2b 2 n 0 This result is a direct consequence of the fact that for any non negative random variable U r 1 EU r 1 r a r b log P U b + ǫ ǫ 2 /2b 2 To check this claim, we develop the exponential to prove that log E t 0 e tu bt + bt2 log P U b + ǫ sup ǫt bt2 2 t A backward Markov chain formulation This section is mainly concerned with the proof of the backward decomposition formula 2.7. Before proceeding, we recall that the measures γ n, η n satisfy the non linear equations and their semigroups are given by γ n = γ n 1 Q n and η n+1 := Φ n+1 η n := Ψ Gn η n M n+1 γ n = γ p Q p,n and η n f n := η p Q p,n f n /η p Q p,n 1 for any function f n BE n. In this connection, we also mention that the semigroup of the pair of measures Γ n, Q n defined in 1.1 for any 0 p n and any F n BE [0,n], we have Γ n F n = γ p D p,n F n and Q n F n = η p D p,n F n /η p D p,n These formulae are a direct consequence of the following observation η p D p,n F n = Q p dx 0,...,x p Q p,n x p, dx p+1,...,x n F n x 0,...,x n IRIA
14 A Backward Particle Interpretation of Feynman-Kac Formulae 11 Lemma 4.1 For any 0 p < n, we have with γ p dx p Q p,n x p, dx p+1,...,x n = γ n dx n M n,p x n, dx p,...,x n M n,p x n, dx p,...,x n 1 := p q<n M q+1,ηq x q+1, dx q In particular, for any time n 0, the Feynman-Kac path measures Q n defined in 1.1 can be expressed in terms of the sequence of marginal measures η p 0 p n, with the following backward Markov chain formulation Q n dx 0,...,x n = η n dx n M n,0 x n, dx 0,...,x n 1 : 4.3 Before entering into the details of the proof of this lemma, we mention that 4.3 holds true for any well defined Markov transition M n+1,ηn y,dx from E n into E n+1 satisfying the local backward equation Ψ Gn η n dx M n+1 x, dy = Φ n+1 η n dy M n+1,ηn y, dx or equivalently In other words, we have the duality formula η n dx Q n+1 x, dy = η n Q n+1 dy M n+1,ηn y, dx 4.4 Ψ Gn η n f M n+1 g = Φ n+1 η n g M n+1,ηn f 4.5 Also notice that for any pair of measures µ, ν on E n s.t. µ ν, we have µm n+1 νm n+1. Indeed, if we have νm n+1 A = 0, the function M n+1 1 A is null ν-almost everywhere, and therefore µ-almost everywhere from which we conclude that µm n+1 A = 0. For any bounded measurable function g on E n we set Ψ g G n η n dx = Ψ Gn η n dx gx Ψ Gn η n dx From the previous discussion, we have Ψ g G n η n M n+1 Ψ Gn η n M n+1 and it is easily checked that M n+1,ηn gy = dψg G n η n M n+1 dψ Gn η n M n+1 y is a well defined Markov transition from E n+1 into E n satisfying the desired backward equation. These manipulations are rather classical in the literature on Markov chains see for instance [15], and references therein. Under the regularity condition H the above transition is explicitly given by the formula 2.8. ow, we come to the proof of lemma 4.1. Proof of lemma 4.1: We prove 4.2 using a backward induction on the parameter p. By 4.4, the formula is clearly true for p = n 1. Suppose the result has been proved at rank p. Since we have and γ dx Q,n x, dx p,...,x n = γ dx Q p x, dx p Q p,n x p, dx p+1,...,x n γ dx Q p x, dx p = γ p dx p M p,η x p, dx Using the backward induction we conclude that the desired formula is also met at rank p 1. The second assertion is a direct consequence of 4.2. The end of the proof of the lemma is now completed. RR n 7019
15 12 Del Moral & Doucet & Singh We end this section with some properties of backward Markov transitions associated with a given initial probability measure that may differ from the one associated with the Feynman-Kac measures. These mathematical objects appear in a natural way in the analysis of the -particle approximation transitions M n introduced in Definition 4.2 For any 0 p n and any probability measure η PE p, we denote by M n+1,p,η the Markov transition from E n+1 into E [p,n] = E p... E n defined by M n+1,p,η x n+1, dx p,...,x n = M q+1,φp,qηx q+1, dx q p q n otice that this definition is consistent with the definition of the Markov transitions M p,n introduced in lemma 4.1: M n+1,p,ηp x n+1, dx p,...,x n = M n+1,p x n+1, dx p,...,x n Also observe that M n+1,p,η can alternatively be defined by the pair of recursions M n+1,p,η x n+1, dx p,...,x n = M n+1,p+1,φp+1η x n+1, dx p+1,...,x n M p+1,η x p+1, dx p 4.6 = M n+1,φp,nηx n+1, dx n M n,p,η x n, dx p,...,x n 1 The proof of the following lemma follows the same lines of arguments as the ones used in the proof of lemma 4.1. For the convenience of the reader, the details of this proof are postponed to the appendix. Lemma 4.3 For any 0 p < n and any probability measure η PE p, we have In other words, we have ηq p,n dx n M n,p,η x n, dx p,...,x n 1 = ηdx p Q p,n x p, dx p+1,...,x n M n,p,η x n, dx p,...,x n 1 = η Q p,n 1dx p,...,x n 1 G n 1 x n 1 H n x n 1, x n ηq p,n 1 G n 1 H n., x n 4.7 with the measure η Q p,n 1 defined below η Q p,n 1 dx p,...,x n 1 := ηdx p Q p,n 1 x p, dx p+1,...,x n 1 5 Particle approximation models We provide in this section some preliminary results on the convergence of the -particle measures Γ n, Q n to their limiting values Γ n, Q n, as. Most of the forthcoming analysis is developed in terms of the following integral operators. Definition 5.1 For any 0 p n, we let Dp,n be the F-measurable integral operators from BE [0,n] into BE p defined below Dp,nF n x p := M p x p, dx 0,...,x Q p,n x p, dx p+1,...,x n F n x 0,...,x n with the conventions D 0,n = Q 0,n, and resp. D n,n = M n, for p = 0, and resp. p = n IRIA
16 A Backward Particle Interpretation of Feynman-Kac Formulae 13 The main result of this section is the following theorem. Theorem 5.2 For any 0 p n, and any function F n on the path space E [0,n], we have E Γ n F n F p = γ p D p,n F n and W Γ, n F n = n p=0 γ p 1 V p D p,n F n Proof of theorem 5.2: To prove the first assertion, we use a backward induction on the parameter p. For p = n, the result is immediate since we have Γ n F n = γn 1 ηn D n,n F n We suppose that the formula is valid at a given rank p n. In this situation, we have E Γ n F n F = γp 1 E ηp D p,n F n F = γ1 ηg H p., x p λ p dx p Dp,nF n x p 5.1 Using the fact that γ 1 η G H p., x p λ p dx p M p,η x p, dx = γ dx Q p x, dx p we conclude that the r.h.s. term in 5.1 takes the form γ dx M x, dx 0,...,x p 2 Q,n x, dx p,...,x n F n x 0,...,x n = γ D,n F n This ends the proof of the first assertion. The proof of the second assertion is based on the following decomposition Γ n Γ n Fn = n [ E Γ n F n F p E Γ n F n ] F = p=0 n γp 1 p=0 η p D p,n F n 1 η G η D,n F n where F 1 is the trivial sigma field. By definition of the random fields Vp, it remains to prove that η D,n F n = ηq p Dp,nF n To check this formula, we use the decomposition η dx M x, dx 0,...,x p 2 Q,n x, dx p,...,x n = η dx Q p x, dx p M x, dx 0,...,x p 2 Q p,n x p, dx p+1,...,x n 5.2 Using the fact that ηdx Q p x, dx p = ηq p dx p M p,η x p, dx we conclude that the term in the r.h.s. of 5.2 is equal to ηq p dx p M p x p, dx 0,...,x Q p,n x p, dx p+1,...,x n RR n 7019
17 14 Del Moral & Doucet & Singh This ends the proof of the theorem. Several consequences of theorem 5.2 are now emphasized. On the one hand, using the fact that the random fields Vn are centered given Fn 1, we find that On the other hand, using the fact that E Γ n F n = Γ n F n γ p 1 γ n 1 = γ p1 γ p Q p,n 1 = 1 η p Q p,n 1 we prove the following decomposition with the pair of parameters W Γ, n F n = γ n 1 Q n Q n Fn = γ n 1,D p,n defined below n p=0 γ p 1 V p D p,nf n 5.3 γ n 1 := γ n 1 γ n 1 and D p,nf n = D p,nf n η p Q p,n Using again the fact that the random fields V n Using the estimates E W Γ, n F n 2 = n p=0 are centered given F n 1, we have [ ] E γ p 1 2 E Vp D 2 p,nf n F D p,nf n Q p,n 1 F n D p,nf n Q p,n 1 F n with Q p,n 1 = Q p,n1 η p Q p,n we prove the non asymptotic variance estimate E W Γ, n F n 2 n E γ p 1 2 Q p,n 1 2 = p=0 n [ 1 + E [γ p 1 1] 2] Q p,n 1 2 for any function F n such that F n 1. On the other hand, using the decomposition γ n 1 Q n Q n = [ γ n 1 1 ] Q n + Q n Q n p=0 we prove that [Q E n F n Q n F n ] 2 1/2 1 E Wn Γ F n 2 1/2 [γ + E n 1 1 ] 2 1/2 Some interesting bias estimates can also be obtained using the fact that E Q n F n Q n F n = E [ 1 γ n 1 ] [ Q n F n Q n F n ] and the following easily proved upper bound E Q n F n Q n F n [1 E γ n 1 ] 2 1/2 [Q E n F n Q n F n ] 2 1/2 IRIA
18 A Backward Particle Interpretation of Feynman-Kac Formulae 15 Under the regularity condition M m stated in 3.6, we proved in a recent article [2], that for any n p 0, and any > n + 1ρδ m we have [ γ Q p,n 1 δ m ρ and E n 1 1 ] 2 4 n + 1 ρ δ m From these estimates, we readily prove the following corollary. Corollary 5.3 Assume that condition M m is satisfied for some parameters m, δ, ρ. In this situation, for any n p 0, any F n such that F n 1, and any > n + 1ρδ m we have E W Γ, n F n = 0 and E W Γ, n F n 2 δ m ρ 2 n ρδm n + 2 In addition, we have and the bias estimate [Q E n F n Q n F n ] 2 2n + 1ρδ 4 m + ρδ [1 m + 2 ] n + 2 E Q n F n Q n F n 2 2 n + 1ρδ m 4 + ρδ m [ n + 2 ] 1/2 6 Fluctuation properties This section is mainly concerned with the proof of theorem 3.1. Unless otherwise is stated, in the further developments of this section, we assume that the regularity condition H + presented in 3.3 is satisfied for some collection of functions h n, h + n. Our first step to establish theorem 3.1 is the fluctuation analysis of the -particle measures Γ n, Q n given in proposition 6.2 whose proof relies on the following technical lemma. Lemma 6.1 M n x n, dx 0,...,x n 1 M n x n, dx 0,...,x n 1 = 0 p n [ M n,p,η p ] M n,p,φpη x n, dx p,...,x n 1 M p x p, dx 0,...,x The proof of this lemma follows elementary but rather tedious calculations; thus it is postponed to the appendix. We now state proposition 6.2. Proposition 6.2 For any 1, 0 p n, x p E p, m 1, and F n BE [0,n] such that F n 1, we have E D p,nf n D p,n F n x p m 1 m am bn h + 2 p x p 6.1 h p for some finite constants am <, resp. bn <, whose values only depend on the parameters m, resp. on the time horizon n. Proof: Using lemma 6.1, we find that D p,nf n D p,n F n = 0 q p [ M p,q,η q M p,q,φqη q 1 ] T p,q,n F n RR n 7019
19 16 Del Moral & Doucet & Singh with the random function T p,q,nf n defined below T p,q,nf n x q,...,x p := Q p,n x p, dx p+1,...,x n M q x q, dx 0,...,x q 1 F n x 0,...,x n Using formula 4.7, we prove that for any m 1 and any function F on E [q,p] [ ] E M p,q,η q M p,q,φqη F x q 1 p m 1 Fq 1 m h + p am bn F h p 2 x p for some finite constants am < and bn < whose values only depend on the parameters m and n. Using these almost sure estimates, we easily prove 6.1. This ends the proof of the proposition. ow, we come to the proof of theorem 3.1. Proof of theorem 3.1: Using theorem 5.2, we have the decomposition W Γ, n F n = n p=0 with the second order remainder term n Rn Γ, F n := γp 1 Vp F p,n p=0 γ p 1 V p D p,n F n + R Γ, n F n and the function F p,n := [D p,n D p,n ]F n By Slutsky s lemma and by the continuous mapping theorem it clearly suffices to check that Rn Γ, F n converge to 0, in probability, as. To prove this claim, we notice that E Vp F 2 p,n F Φ p η F 2 p,n On the other hand, we have Φ p η F p,n 2 = λ p dx p Ψ G η Hp., x p F p,nx p 2 F 2 η p p,n + This yields the rather crude estimate Φ p η F p,n 2 λ p dx p [ Ψ G η ΨG η ] H p., x p F p,nx p 2 = λ p dx p Ψ G η Hp., x p F p,nx p 2 η p F p,n Q p,n 1 2 λ p dx p [ Ψ G η ΨG η ] H p., x p from which we conclude that E Vp F 2 p,n [ F η p dx p E p,n x p ] 2 +4 Q p,n 1 2 λ p dx p E [ Ψ G η ΨG η ] H p., x p IRIA
20 A Backward Particle Interpretation of Feynman-Kac Formulae 17 We can establish that [ E ΨG η η ΨG ] H p., x p bn h + p x p See for instance section 7.4.3, theorem in [4]. Using proposition 6.2, E Vp F 2 1 h + 4 p p,n cn η p + λ p h + p for some finite constant cn <. The end of the proof of the first assertion now follows standard computations. To prove the second assertion, we use the following decomposition [Q n Q n ]F n = 1 γ n 1 W Γ, n F n Q n F n with the random fields W Γ, n defined in 5.3. We complete the proof using the fact that γ n 1 tends to 1, almost surely, as. This ends the proof of the theorem. h p We end this section with some comments on the asymptotic variance associated to the Gaussian fields W Q n. Using 4.1, we prove that Q n = Ψ Dp,n1 η pp p,n with the pair of integral operators D p,n, P p,n from BE [0,n] into BE p D p,n F n := D p,nf n η p Q p,n 1 = D p,n1 η p Q p,n 1 P p,nf n and P p,n F n := D p,nf n D p,n 1 from which we deduce the following formula D p,n F n Q n F n x p = D p,n 1x p [P p,n F n x p P p,n F n y p ] Ψ Dp,n1 η pdy p 6.2 Under condition M m, for any function F n with oscillations oscf n 1, we prove the following estimate D p,n 1 δ m ρ = E Wn Q F n 2 n δ m ρ 2 βp p,n 2 7 on asymptotic estimates This section is mainly concerned with the proof of theorem 3.2. We follow the same semigroup techniques as the ones we used in section in [4] to derive uniform estimates w.r.t. the time parameter for the -particle measures ηn. We use the decomposition [Q n Q n ]F n = η p Dp,nF n ηp Dp,n1 η D,nF n η D,n 1 0 p n with the conventions η 1D 1,n = η 0 Q 0,n, for p = 0. ext, we observe that η D,nF n = η dx M x, dx 0,...,x p 2 Q,n x, dx p,...,x n F n x 0,...,x n = η dx Q p x, dx p p=0 RR n 7019 M x, dx 0,...,x p 2 Q p,n x p, dx p+1,...,x n F n x 0,...,x n
21 18 Del Moral & Doucet & Singh On the other hand, we have ηdx Q p x, dx p = ηq p dx p M p,η x p, dx from which we conclude that ηd,nf n = ηq p Dp,nF n This yields the decomposition [Q n Q n ]F n = 0 p n η p Dp,nF n ηp Dp,n1 Φ pηd p,nf n Φ p η D p,n1 7.1 with the convention Φ 0 η 1 = η 0, for p = 0. If we set F p,n = F n Φ pη D p,nf n Φ p η D p,n1 then every term in the r.h.s. of 7.1 takes the following form η p D p,n F p,n η p D p,n1 = η pq p,n 1 [ ηp Q p,n 1 ηp D p,n F p,n Φ p ηd p,n F ] p,n with the integral operators D p,n defined in 5.4. ext, we observe that D p,n1 = Q p,n 1, and D p,n1 = D p,n 1. Thus, in terms of the local sampling random fields V p, we have proved that η p D p,n F p,n η p D p,n1 = 1 1 ηp D p,n 1 V p D p,n F p,n 7.2 and D p,nf n = D p,n 1 P p,nf n with P p,nf n := D p,nf n D p,n1 From these observations, we prove that 7.3 Φ p ηd p,nf n Φ p η D p,n1 = Φ pηq p,n 1 Pp,nF n Φ p η Q = Ψ Qp,n1 Φp η Pp,nF n p,n1 Arguing as in 6.2 we obtain the following decomposition D p,n F p,nx p = D p,n 1x p [ P p,nf n x p P p,nf n y p ] Ψ Qp,n1Φ p η dy p and therefore D p,n F p,n b p,n βpp,n Q p,n 1x p oscf n with b p,n sup x p,y p Q p,n 1y p We end the proof of 3.4 using the fact that for any r 1, p 0, f BE p s.t. oscf 1 we have the almost sure Kintchine type inequality E Vp f r F 1 r a r IRIA
22 A Backward Particle Interpretation of Feynman-Kac Formulae 19 for some finite non random constants a r < whose values only depend on r. Indeed, using the fact that each term in the sum of 7.1 takes the form 7.2 we prove that E [Q n Q n ]F n r 1 r ar 0 p n b 2 p,n E oscp p,nf n This ends the proof of the first assertion 3.4 of theorem 3.2. For linear functionals of the form 2.5, it is easily checked that ] Dp,nF n = Q p,n 1 [M p,η...m q+1,η f q q + Q p,q f q Q q,n 1 0 q p with the convention M p,η...m p+1,η p Dp,n1 = Q p,n 1, we conclude that P p,nf n = f p + 0 q<p p<q n = Id, the identity operator, for q = p. Recalling that [M p,η...m q+1,η q ] f q + p<q n Q p,q Q q,n 1 f q Q p,q Q q,n 1 and therefore P p,nf n = 0 q<p [M p,η...m q+1,η q ] f q + p q n Q p,q Q q,n 1 f q Q p,q Q q,n 1 Q p,q Q q,n 1 f q Q p,q Q q,n 1 = S p,qq q,n 1 f q S p,q Q q,n 1 with S p,q g = Q p,qg Q p,q 1 with the potential functions Q q,n 1 defined in 5.5. After some elementary computations, we obtain the following estimates oscp p,nf n 0 q<p β M p,η...m q+1,η q oscf q + p q n b2 q,n βs p,q oscf q This ends the proof of the second assertion 3.5 of theorem 3.2. Appendix Proof of lemma 4.3 We prove the lemma by induction on the parameter n> p. For n = p + 1, we have M p+1,p,η x p+1, dx p = M p+1,η x p+1, dx p and Q p,p+1 x p, dx p+1 = Q p+1 x p, dx p+1 By definition of the transitions M p+1,η, we have ηq p+1 dx p+1 M p+1,p,η x p+1, dx p = ηdx p Q p,p+1 x p, dx p+1 We suppose that the result has been proved at rank n. In this situation, we notice that ηdx p Q p,n+1 x p, dx p+1,...,x n+1 = ηdx p Q p,n x p, dx p+1,...,x n Q n+1 x n, dx n+1 = ηq p,n dx n Q n+1 x n, dx n+1 M n,p,η x n, dx p,...,x n 1 RR n 7019 = ηq p,n 1 Φ p,n ηdx n Q n+1 x n, dx n+1 M n,p,η x n, dx p,...,x n 1
23 20 Del Moral & Doucet & Singh Using the fact that Φ p,n ηdx n Q n+1 x n, dx n+1 = Φ p,n ηq n+1 dx n+1 M n+1,φp,nηx n+1, dx n and ηq p,n 1 Φ p,n ηq n+1 dx n+1 = ηq p,n+1 dx n+1 we conclude that ηdx p Q p,n+1 x p, dx p+1,...,x n+1 = ηq p,n+1 dx n+1 M n+1,φp,nηx n+1, dx n M n,p,η x n, dx p,...,x n 1 = ηq p,n+1 dx n+1 M n+1,p,η x n+1, dx p,...,x n This ends the proof of the lemma. Proof of lemma 6.1: Using the recursions 4.6, we prove that M n+1,p,η p x n+1, dx p,...,x n = M n+1,p+1,φp+1η p x n+1, dx p+1,...,x n M p+1,η p x p+1, dx p On the other hand, we also have M p+1x p+1, dx 0,...,x p = M p+1,η p x p+1, dx p M p x p, dx 0,...,x from which we conclude that M n+1,p+1,φp+1η p x n+1, dx p+1,...,x n M p+1x p+1, dx 0,...,x p = M n+1,p,η p x n+1, dx p,...,x n M p x p, dx 0,...,x The end of the proof is now a direct consequence of the following decomposition M n x n, dx 0,...,x n 1 M n x n, dx 0,...,x n 1 = 1 p n [ M n,p,η p x n, dx p,...,x n 1 M p x p, dx 0,...,x ] M n,,η x n, dx,...,x n 1 M x, dx 0,...,x p 2 +M n,0,η 0 x n, dx 0,...,x n 1 M n,0,η0 x n, dx 0,...,x n 1 with the conventions M n,0,η 0 x n, dx 0,...,x n 1 M 0 x 0, dx 0,...,x 1 = M n,0,η 0 x n, dx 0,...,x n 1 for p = 0, and for p = n M n,n,η n x n, dx n,...,x n 1 M n x n, dx 0,...,x n 1 = M n x n, dx 0,...,x n 1 IRIA
24 A Backward Particle Interpretation of Feynman-Kac Formulae 21 References [1] E. Cancès, B. Jourdain and T. Lelièvre. Quantum Monte Carlo simulations of fermions. A mathematical analysis of the fixed-node approximation. ESAIM: M2A, 169, pp [2] F. Cerou, P. Del Moral, and A. Guyader. A non asymptotic variance theorem for unnormalized Feynman-Kac particle models, HAL-IRIA Research Report [3] P. Del Moral and L. Miclo. Branching and interacting particle systems approximations of Feynman-Kac formulae with applications to non-linear filtering. In Séminaire de Probabilités, XXXIV, volume 1729 of Lecture otes in Math., pages Springer, Berlin [4] P. Del Moral. Feynman-Kac formulae. Genealogical and interacting particle systems with applications, Probability and its Applications, Springer Verlag, ew York [5] P. Del Moral and L. Miclo. Particle approximations of Lyapunov exponents connected to Schroedinger operators and Feynman-Kac semigroups. ESAIM: P&S, 7, [6] P. Del Moral, J. Jacod and P. Protter. The Monte-Carlo Method for filtering with discrete-time observations. Proba. Theory Rel. Fields, 120, [7] P. Del Moral and E. Rio. Concentration inequalities for mean field particle models HAL-IRIA RR [8] G.B. Di Masi, M. Pratelli and W.G. Runggaldier. An approximation for the nonlinear filtering problem with error bounds. Stochastics, 144, [9] A. Doucet,. de Freitas and. Gordon, editors. Sequential Monte Carlo Methods in Pratice. Statistics for engineering and Information Science. Springer, ew York [10] S.J. Godsill, A. Doucet and M. West. Monte Carlo smoothing for nonlinear time series. J. Amer. Stat. Assoc., 99465, [11] M. Kac. On distributions of certain Wiener functionals. Trans. American Math. Soc., 651, 1: [12] H. Korezlioglu and W.J. Runggaldier. Filtering for nonlinear systems driven by nonwhite noises : An approximating scheme. Stochastics and Stochastics Rep., 441-2, [13] M. El Makrini, B. Jourdain and T. Lelièvre, Diffusion Monte Carlo method: umerical analysis in a simple case. ESAIM: M2A, 412, [14] J. Picard. Approximation of the non linear filtering problems and order of convergence. Filtering and control of random processes. Lecture otes in Control and Inf. Sc., vol.61, Springer 1984 [15] D. Revuz. Markov chains. orth Holland [16] M. Rousset. On the control of an interacting particle approximation of Schroedinger ground states. SIAM J. Math. Anal., 38 3, RR n 7019
25 Centre de recherche IRIA Bordeaux Sud Ouest Domaine Universitaire - 351, cours de la Libération Talence Cedex France Centre de recherche IRIA Grenoble Rhône-Alpes : 655, avenue de l Europe Montbonnot Saint-Ismier Centre de recherche IRIA Lille ord Europe : Parc Scientifique de la Haute Borne - 40, avenue Halley Villeneuve d Ascq Centre de recherche IRIA ancy Grand Est : LORIA, Technopôle de ancy-brabois - Campus scientifique 615, rue du Jardin Botanique - BP Villers-lès-ancy Cedex Centre de recherche IRIA Paris Rocquencourt : Domaine de Voluceau - Rocquencourt - BP Le Chesnay Cedex Centre de recherche IRIA Rennes Bretagne Atlantique : IRISA, Campus universitaire de Beaulieu Rennes Cedex Centre de recherche IRIA Saclay Île-de-France : Parc Orsay Université - ZAC des Vignes : 4, rue Jacques Monod Orsay Cedex Centre de recherche IRIA Sophia Antipolis Méditerranée : 2004, route des Lucioles - BP Sophia Antipolis Cedex Éditeur IRIA - Domaine de Voluceau - Rocquencourt, BP Le Chesnay Cedex France ISS
A Backward Particle Interpretation of Feynman-Kac Formulae
A Backward Particle Interpretation of Feynman-Kac Formulae Pierre Del Moral, Arnaud Doucet, Sumeetpal Singh To cite this version: Pierre Del Moral, Arnaud Doucet, Sumeetpal Singh. A Backward Particle Interpretation
More informationA Backward Particle Interpretation of Feynman-Kac Formulae
A Backward Particle Interpretation of Feynman-Kac Formulae P. Del Moral Centre INRIA de Bordeaux - Sud Ouest Workshop on Filtering, Cambridge Univ., June 14-15th 2010 Preprints (with hyperlinks), joint
More informationConcentration inequalities for Feynman-Kac particle models. P. Del Moral. INRIA Bordeaux & IMB & CMAP X. Journées MAS 2012, SMAI Clermond-Ferrand
Concentration inequalities for Feynman-Kac particle models P. Del Moral INRIA Bordeaux & IMB & CMAP X Journées MAS 2012, SMAI Clermond-Ferrand Some hyper-refs Feynman-Kac formulae, Genealogical & Interacting
More informationMaximizing the Cohesion is NP-hard
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Maximizing the Cohesion is NP-hard arxiv:1109.1994v2 [cs.ni] 9 Oct 2011 Adrien Friggeri Eric Fleury N 774 version 2 initial version 8 September
More informationMean field simulation for Monte Carlo integration. Part II : Feynman-Kac models. P. Del Moral
Mean field simulation for Monte Carlo integration Part II : Feynman-Kac models P. Del Moral INRIA Bordeaux & Inst. Maths. Bordeaux & CMAP Polytechnique Lectures, INLN CNRS & Nice Sophia Antipolis Univ.
More informationOn the behavior of upwind schemes in the low Mach number limit. IV : P0 Approximation on triangular and tetrahedral cells
On the behavior of upwind schemes in the low Mach number limit. IV : P0 Approximation on triangular and tetrahedral cells Hervé Guillard To cite this version: Hervé Guillard. On the behavior of upwind
More informationA new class of interacting Markov Chain Monte Carlo methods
A new class of interacting Marov Chain Monte Carlo methods P Del Moral, A Doucet INRIA Bordeaux & UBC Vancouver Worshop on Numerics and Stochastics, Helsini, August 2008 Outline 1 Introduction Stochastic
More informationNumerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models
Numerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models Florian Lemarié To cite this version: Florian Lemarié. Numerical
More informationOn Adaptive Resampling Procedures for Sequential Monte Carlo Methods
On Adaptive Resampling Procedures for Sequential Monte Carlo Methods Pierre Del Moral, Arnaud Doucet, Ajay Jasra To cite this version: Pierre Del Moral, Arnaud Doucet, Ajay Jasra. On Adaptive Resampling
More informationA CMA-ES for Mixed-Integer Nonlinear Optimization
A CMA-ES for Mixed-Integer Nonlinear Optimization Nikolaus Hansen To cite this version: Nikolaus Hansen. A CMA-ES for Mixed-Integer Nonlinear Optimization. [Research Report] RR-, INRIA.. HAL Id: inria-
More informationAn introduction to particle simulation of rare events
An introduction to particle simulation of rare events P. Del Moral Centre INRIA de Bordeaux - Sud Ouest Workshop OPUS, 29 juin 2010, IHP, Paris P. Del Moral (INRIA) INRIA Bordeaux-Sud Ouest 1 / 33 Outline
More informationContraction properties of Feynman-Kac semigroups
Journées de Statistique Marne La Vallée, January 2005 Contraction properties of Feynman-Kac semigroups Pierre DEL MORAL, Laurent MICLO Lab. J. Dieudonné, Nice Univ., LATP Univ. Provence, Marseille 1 Notations
More informationAdvanced Monte Carlo integration methods. P. Del Moral (INRIA team ALEA) INRIA & Bordeaux Mathematical Institute & X CMAP
Advanced Monte Carlo integration methods P. Del Moral (INRIA team ALEA) INRIA & Bordeaux Mathematical Institute & X CMAP MCQMC 2012, Sydney, Sunday Tutorial 12-th 2012 Some hyper-refs Feynman-Kac formulae,
More informationCongestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks Alonso Silva Patricio Reyes Mérouane Debbah N 6854 February 29 Thème
More informationBounded Normal Approximation in Highly Reliable Markovian Systems
Bounded Normal Approximation in Highly Reliable Markovian Systems Bruno Tuffin To cite this version: Bruno Tuffin. Bounded Normal Approximation in Highly Reliable Markovian Systems. [Research Report] RR-3020,
More informationBound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions
Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions Tomas Lang, Jean-Michel Muller To cite this version: Tomas Lang, Jean-Michel Muller Bound on Run of Zeros and
More informationMean field simulation for Monte Carlo integration. Part I : Intro. nonlinear Markov models (+links integro-diff eq.) P. Del Moral
Mean field simulation for Monte Carlo integration Part I : Intro. nonlinear Markov models (+links integro-diff eq.) P. Del Moral INRIA Bordeaux & Inst. Maths. Bordeaux & CMAP Polytechnique Lectures, INLN
More informationOn the concentration properties of Interacting particle processes
ISTITUT ATIOAL DE RECHERCHE E IFORMATIQUE ET E AUTOMATIQUE arxiv:1107.1948v2 [math.a] 12 Jul 2011 On the concentration properties of Interacting particle processes Pierre Del Moral, Peng Hu, Liming Wu
More informationA filtering method for the interval eigenvalue problem
A filtering method for the interval eigenvalue problem Milan Hladik, David Daney, Elias P. Tsigaridas To cite this version: Milan Hladik, David Daney, Elias P. Tsigaridas. A filtering method for the interval
More informationOn the Robustness of the Snell envelope
On the Robustness of the Snell envelope Pierre Del Moral, Peng Hu, adia Oudjane, Bruno Rémillard To cite this version: Pierre Del Moral, Peng Hu, adia Oudjane, Bruno Rémillard On the Robustness of the
More informationA generalization of Cramér large deviations for martingales
A generalization of Cramér large deviations for martingales Xiequan Fan, Ion Grama, Quansheng Liu To cite this version: Xiequan Fan, Ion Grama, Quansheng Liu. A generalization of Cramér large deviations
More informationStability of Feynman-Kac Semigroup and SMC Parameters' Tuning
Stability of Feynman-Kac Semigroup and SMC Parameters' Tuning François GIRAUD PhD student, CEA-CESTA, INRIA Bordeaux Tuesday, February 14th 2012 1 Recalls and context of the analysis Feynman-Kac semigroup
More informationReal-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions
Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions Nikolaus Hansen, Steffen Finck, Raymond Ros, Anne Auger To cite this version: Nikolaus Hansen, Steffen Finck, Raymond
More informationHenry law and gas phase disappearance
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:0904.1195v1 [physics.chem-ph] 7 Apr 2009 Henry law and gas phase disappearance Jérôme Jaffré Amel Sboui apport de recherche N 6891
More informationA General Framework for Nonlinear Functional Regression with Reproducing Kernel Hilbert Spaces
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A General Framework for Nonlinear Functional Regression with Reproducing Kernel Hilbert Spaces Hachem Kadri Emmanuel Duflos Manuel Davy
More informationBounds on eigenvalues and singular values of interval matrices
Bounds on eigenvalues and singular values of interval matrices Milan Hladik, David Daney, Elias P. Tsigaridas To cite this version: Milan Hladik, David Daney, Elias P. Tsigaridas. Bounds on eigenvalues
More informationThe 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach
The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach Cyril Duron, Jean-Marie Proth To cite this version: Cyril Duron, Jean-Marie Proth. The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach.
More informationSensitivity to the cutoff value in the quadratic adaptive integrate-and-fire model
Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire model Jonathan Touboul To cite this version: Jonathan Touboul. Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire
More informationQuartic formulation of Coulomb 3D frictional contact
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Quartic formulation of Coulomb 3D frictional contact Olivier Bonnefon Gilles Daviet N 0400 January 10, 2011 Modeling, Optimization, and
More informationOn the Concentration Properties of Interacting Particle Processes. Contents
Foundations and Trends R in Machine Learning Vol. 3, Nos. 3 4 (2010) 225 389 c 2012 P. Del Moral, P. Hu, and L. Wu DOI: 10.1561/2200000026 On the Concentration Properties of Interacting Particle Processes
More informationLow frequency resolvent estimates for long range perturbations of the Euclidean Laplacian
Low frequency resolvent estimates for long range perturbations of the Euclidean Laplacian Jean-Francois Bony, Dietrich Häfner To cite this version: Jean-Francois Bony, Dietrich Häfner. Low frequency resolvent
More informationMultiplication by an Integer Constant: Lower Bounds on the Code Length
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Multiplication by an Integer Constant: Lower Bounds on the Code Length Vincent Lefèvre N 4493 Juillet 2002 THÈME 2 ISSN 0249-6399 ISRN INRIA/RR--4493--FR+ENG
More informationSome tight polynomial-exponential lower bounds for an exponential function
Some tight polynomial-exponential lower bounds for an exponential function Christophe Chesneau To cite this version: Christophe Chesneau. Some tight polynomial-exponential lower bounds for an exponential
More informationUnbiased minimum variance estimation for systems with unknown exogenous inputs
Unbiased minimum variance estimation for systems with unknown exogenous inputs Mohamed Darouach, Michel Zasadzinski To cite this version: Mohamed Darouach, Michel Zasadzinski. Unbiased minimum variance
More informationCutwidth and degeneracy of graphs
Cutwidth and degeneracy of graphs Benoit Kloeckner To cite this version: Benoit Kloeckner. Cutwidth and degeneracy of graphs. IF_PREPUB. 2009. HAL Id: hal-00408210 https://hal.archives-ouvertes.fr/hal-00408210v1
More informationOn constraint qualifications with generalized convexity and optimality conditions
On constraint qualifications with generalized convexity and optimality conditions Manh-Hung Nguyen, Do Van Luu To cite this version: Manh-Hung Nguyen, Do Van Luu. On constraint qualifications with generalized
More informationA new simple recursive algorithm for finding prime numbers using Rosser s theorem
A new simple recursive algorithm for finding prime numbers using Rosser s theorem Rédoane Daoudi To cite this version: Rédoane Daoudi. A new simple recursive algorithm for finding prime numbers using Rosser
More informationOn the uniform Poincaré inequality
On the uniform Poincaré inequality Abdesslam oulkhemair, Abdelkrim Chakib To cite this version: Abdesslam oulkhemair, Abdelkrim Chakib. On the uniform Poincaré inequality. Communications in Partial Differential
More informationA proximal approach to the inversion of ill-conditioned matrices
A proximal approach to the inversion of ill-conditioned matrices Pierre Maréchal, Aude Rondepierre To cite this version: Pierre Maréchal, Aude Rondepierre. A proximal approach to the inversion of ill-conditioned
More informationAnalysis in weighted spaces : preliminary version
Analysis in weighted spaces : preliminary version Frank Pacard To cite this version: Frank Pacard. Analysis in weighted spaces : preliminary version. 3rd cycle. Téhéran (Iran, 2006, pp.75.
More informationError Bounds on Complex Floating-Point Multiplication
Error Bounds on Complex Floating-Point Multiplication Richard Brent, Colin Percival, Paul Zimmermann To cite this version: Richard Brent, Colin Percival, Paul Zimmermann. Error Bounds on Complex Floating-Point
More informationDYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS
DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS Issam Naghmouchi To cite this version: Issam Naghmouchi. DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS. 2010. HAL Id: hal-00593321 https://hal.archives-ouvertes.fr/hal-00593321v2
More informationA Note on Node Coloring in the SINR Model
A Note on Node Coloring in the SINR Model Bilel Derbel, El-Ghazali Talbi To cite this version: Bilel Derbel, El-Ghazali Talbi. A Note on Node Coloring in the SINR Model. [Research Report] RR-7058, INRIA.
More informationOn Poincare-Wirtinger inequalities in spaces of functions of bounded variation
On Poincare-Wirtinger inequalities in spaces of functions of bounded variation Maïtine Bergounioux To cite this version: Maïtine Bergounioux. On Poincare-Wirtinger inequalities in spaces of functions of
More informationDissipative Systems Analysis and Control, Theory and Applications: Addendum/Erratum
Dissipative Systems Analysis and Control, Theory and Applications: Addendum/Erratum Bernard Brogliato To cite this version: Bernard Brogliato. Dissipative Systems Analysis and Control, Theory and Applications:
More informationNew estimates for the div-curl-grad operators and elliptic problems with L1-data in the half-space
New estimates for the div-curl-grad operators and elliptic problems with L1-data in the half-space Chérif Amrouche, Huy Hoang Nguyen To cite this version: Chérif Amrouche, Huy Hoang Nguyen. New estimates
More informationSpace-time directional Lyapunov exponents for cellular au- automata
Space-time directional Lyapunov exponents for cellular automata Maurice Courbage, Brunon Kaminski To cite this version: Space-time directional Lyapunov exponents for cellular au- Maurice Courbage, Brunon
More informationOptimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Optimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives Olympia
More informationReplicator Dynamics and Correlated Equilibrium
Replicator Dynamics and Correlated Equilibrium Yannick Viossat To cite this version: Yannick Viossat. Replicator Dynamics and Correlated Equilibrium. CECO-208. 2004. HAL Id: hal-00242953
More informationOn the longest path in a recursively partitionable graph
On the longest path in a recursively partitionable graph Julien Bensmail To cite this version: Julien Bensmail. On the longest path in a recursively partitionable graph. 2012. HAL Id:
More informationA Context free language associated with interval maps
A Context free language associated with interval maps M Archana, V Kannan To cite this version: M Archana, V Kannan. A Context free language associated with interval maps. Discrete Mathematics and Theoretical
More informationCramér large deviation expansions for martingales under Bernstein s condition
Cramér large deviation expansions for martingales under Bernstein s condition Xiequan Fan, Ion Grama, Quansheng Liu To cite this version: Xiequan Fan, Ion Grama, Quansheng Liu. Cramér large deviation expansions
More informationStickelberger s congruences for absolute norms of relative discriminants
Stickelberger s congruences for absolute norms of relative discriminants Georges Gras To cite this version: Georges Gras. Stickelberger s congruences for absolute norms of relative discriminants. Journal
More informationThe Mahler measure of trinomials of height 1
The Mahler measure of trinomials of height 1 Valérie Flammang To cite this version: Valérie Flammang. The Mahler measure of trinomials of height 1. Journal of the Australian Mathematical Society 14 9 pp.1-4.
More informationBernstein s basis and real root isolation
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Bernstein s basis and real root isolation Bernard Mourrain Fabrice Rouillier Marie-Françoise Roy N 5149 Mars 2004 THÈME 2 N 0249-6399 ISRN
More informationOn the Robustness of the Snell envelope
On the Robustness of the Snell envelope Pierre Del Moral, Peng Hu, adia Oudjane, Bruno Rémillard To cite this version: Pierre Del Moral, Peng Hu, adia Oudjane, Bruno Rémillard On the Robustness of the
More informationUnfolding the Skorohod reflection of a semimartingale
Unfolding the Skorohod reflection of a semimartingale Vilmos Prokaj To cite this version: Vilmos Prokaj. Unfolding the Skorohod reflection of a semimartingale. Statistics and Probability Letters, Elsevier,
More informationOn path partitions of the divisor graph
On path partitions of the divisor graph Paul Melotti, Eric Saias To cite this version: Paul Melotti, Eric Saias On path partitions of the divisor graph 018 HAL Id: hal-0184801 https://halarchives-ouvertesfr/hal-0184801
More informationAn algorithm for reporting maximal c-cliques
An algorithm for reporting maximal c-cliques Frédéric Cazals, Chinmay Karande To cite this version: Frédéric Cazals, Chinmay Karande. An algorithm for reporting maximal c-cliques. [Research Report] RR-5642,
More informationA simple kinetic equation of swarm formation: blow up and global existence
A simple kinetic equation of swarm formation: blow up and global existence Miroslaw Lachowicz, Henryk Leszczyński, Martin Parisot To cite this version: Miroslaw Lachowicz, Henryk Leszczyński, Martin Parisot.
More informationQuasi-periodic solutions of the 2D Euler equation
Quasi-periodic solutions of the 2D Euler equation Nicolas Crouseilles, Erwan Faou To cite this version: Nicolas Crouseilles, Erwan Faou. Quasi-periodic solutions of the 2D Euler equation. Asymptotic Analysis,
More informationOn Symmetric Norm Inequalities And Hermitian Block-Matrices
On Symmetric Norm Inequalities And Hermitian lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna On Symmetric Norm Inequalities And Hermitian lock-matrices 015 HAL Id: hal-0131860
More informationRigid Transformation Estimation in Point Registration Procedures: Study of the Use of Mahalanobis Distances
Rigid Transformation Estimation in Point Registration Procedures: Study of the Use of Mahalanobis Distances Manuel Yguel To cite this version: Manuel Yguel. Rigid Transformation Estimation in Point Registration
More informationA Note on Auxiliary Particle Filters
A Note on Auxiliary Particle Filters Adam M. Johansen a,, Arnaud Doucet b a Department of Mathematics, University of Bristol, UK b Departments of Statistics & Computer Science, University of British Columbia,
More informationREVERSIBILITY AND OSCILLATIONS IN ZERO-SUM DISCOUNTED STOCHASTIC GAMES
REVERSIBILITY AND OSCILLATIONS IN ZERO-SUM DISCOUNTED STOCHASTIC GAMES Sylvain Sorin, Guillaume Vigeral To cite this version: Sylvain Sorin, Guillaume Vigeral. REVERSIBILITY AND OSCILLATIONS IN ZERO-SUM
More informationLinear Quadratic Zero-Sum Two-Person Differential Games
Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard To cite this version: Pierre Bernhard. Linear Quadratic Zero-Sum Two-Person Differential Games. Encyclopaedia of Systems and Control,
More informationPaths with two blocks in n-chromatic digraphs
Paths with two blocks in n-chromatic digraphs Stéphan Thomassé, Frédéric Havet, Louigi Addario-Berry To cite this version: Stéphan Thomassé, Frédéric Havet, Louigi Addario-Berry. Paths with two blocks
More informationFull-order observers for linear systems with unknown inputs
Full-order observers for linear systems with unknown inputs Mohamed Darouach, Michel Zasadzinski, Shi Jie Xu To cite this version: Mohamed Darouach, Michel Zasadzinski, Shi Jie Xu. Full-order observers
More informationPosterior Covariance vs. Analysis Error Covariance in Data Assimilation
Posterior Covariance vs. Analysis Error Covariance in Data Assimilation François-Xavier Le Dimet, Victor Shutyaev, Igor Gejadze To cite this version: François-Xavier Le Dimet, Victor Shutyaev, Igor Gejadze.
More informationCompleteness of the Tree System for Propositional Classical Logic
Completeness of the Tree System for Propositional Classical Logic Shahid Rahman To cite this version: Shahid Rahman. Completeness of the Tree System for Propositional Classical Logic. Licence. France.
More informationA note on the acyclic 3-choosability of some planar graphs
A note on the acyclic 3-choosability of some planar graphs Hervé Hocquard, Mickael Montassier, André Raspaud To cite this version: Hervé Hocquard, Mickael Montassier, André Raspaud. A note on the acyclic
More informationPositive mass theorem for the Paneitz-Branson operator
Positive mass theorem for the Paneitz-Branson operator Emmanuel Humbert, Simon Raulot To cite this version: Emmanuel Humbert, Simon Raulot. Positive mass theorem for the Paneitz-Branson operator. Calculus
More informationA non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications
A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications Alexandre Sedoglavic To cite this version: Alexandre Sedoglavic. A non-commutative algorithm for multiplying (7 7) matrices
More informationOn the nonrelativistic binding energy for positive ions
On the nonrelativistic binding energy for positive ions G.I. Plindov, I.K. Dmitrieva To cite this version: G.I. Plindov, I.K. Dmitrieva. On the nonrelativistic binding energy for positive ions. Journal
More informationSolving the neutron slowing down equation
Solving the neutron slowing down equation Bertrand Mercier, Jinghan Peng To cite this version: Bertrand Mercier, Jinghan Peng. Solving the neutron slowing down equation. 2014. HAL Id: hal-01081772
More informationAxiom of infinity and construction of N
Axiom of infinity and construction of N F Portal To cite this version: F Portal. Axiom of infinity and construction of N. 2015. HAL Id: hal-01162075 https://hal.archives-ouvertes.fr/hal-01162075 Submitted
More informationInfluence of a Rough Thin Layer on the Potential
Influence of a Rough Thin Layer on the Potential Ionel Ciuperca, Ronan Perrussel, Clair Poignard To cite this version: Ionel Ciuperca, Ronan Perrussel, Clair Poignard. Influence of a Rough Thin Layer on
More informationBeat phenomenon at the arrival of a guided mode in a semi-infinite acoustic duct
Beat phenomenon at the arrival of a guided mode in a semi-infinite acoustic duct Philippe GATIGNOL, Michel Bruneau, Patrick LANCELEUR, Catherine Potel To cite this version: Philippe GATIGNOL, Michel Bruneau,
More informationSubmodular Partition Functions
Submodular Partition Functions Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé To cite this version: Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé. Submodular Partition Functions.
More informationOn the simultaneous stabilization of three or more plants
On the simultaneous stabilization of three or more plants Christophe Fonte, Michel Zasadzinski, Christine Bernier-Kazantsev, Mohamed Darouach To cite this version: Christophe Fonte, Michel Zasadzinski,
More informationOptimal Routing Policy in Two Deterministic Queues
Optimal Routing Policy in Two Deterministic Queues Bruno Gaujal, Emmanuel Hyon To cite this version: Bruno Gaujal, Emmanuel Hyon. Optimal Routing Policy in Two Deterministic Queues. [Research Report] RR-37,
More informationContraction analysis of nonlinear random dynamical systems
Contraction analysis of nonlinear random dynamical systems Nicolas Tabareau, Jean-Jacques Slotine To cite this version: Nicolas Tabareau, Jean-Jacques Slotine. Contraction analysis of nonlinear random
More informationNorm Inequalities of Positive Semi-Definite Matrices
Norm Inequalities of Positive Semi-Definite Matrices Antoine Mhanna To cite this version: Antoine Mhanna Norm Inequalities of Positive Semi-Definite Matrices 15 HAL Id: hal-11844 https://halinriafr/hal-11844v1
More informationChebyshev polynomials, quadratic surds and a variation of Pascal s triangle
Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle Roland Bacher To cite this version: Roland Bacher. Chebyshev polynomials, quadratic surds and a variation of Pascal s triangle.
More informationOn the stability and the applications of interacting particle systems
1/42 On the stability and the applications of interacting particle systems P. Del Moral INRIA Bordeaux Sud Ouest PDE/probability interactions - CIRM, April 2017 Synthesis joint works with A.N. Bishop,
More informationOn Symmetric Norm Inequalities And Hermitian Block-Matrices
On Symmetric Norm Inequalities And Hermitian lock-matrices Antoine Mhanna To cite this version: Antoine Mhanna On Symmetric Norm Inequalities And Hermitian lock-matrices 016 HAL Id: hal-0131860
More informationOn a series of Ramanujan
On a series of Ramanujan Olivier Oloa To cite this version: Olivier Oloa. On a series of Ramanujan. Gems in Experimental Mathematics, pp.35-3,, . HAL Id: hal-55866 https://hal.archives-ouvertes.fr/hal-55866
More informationPerformance analysis of clouds with phase-type arrivals
Performance analysis of clouds with phase-type arrivals Farah Ait Salaht, Hind Castel-Taleb To cite this version: Farah Ait Salaht, Hind Castel-Taleb. Performance analysis of clouds with phase-type arrivals.
More informationb-chromatic number of cacti
b-chromatic number of cacti Victor Campos, Claudia Linhares Sales, Frédéric Maffray, Ana Silva To cite this version: Victor Campos, Claudia Linhares Sales, Frédéric Maffray, Ana Silva. b-chromatic number
More informationON THE UNIQUENESS IN THE 3D NAVIER-STOKES EQUATIONS
ON THE UNIQUENESS IN THE 3D NAVIER-STOKES EQUATIONS Abdelhafid Younsi To cite this version: Abdelhafid Younsi. ON THE UNIQUENESS IN THE 3D NAVIER-STOKES EQUATIONS. 4 pages. 212. HAL Id:
More informationVibro-acoustic simulation of a car window
Vibro-acoustic simulation of a car window Christophe Barras To cite this version: Christophe Barras. Vibro-acoustic simulation of a car window. Société Française d Acoustique. Acoustics 12, Apr 12, Nantes,
More informationAnisotropy dynamics of CuMn spin glass through torque measurements
Anisotropy dynamics of CuMn spin glass through torque measurements J.B. Pastora, T.W. Adair, D.P. Love To cite this version: J.B. Pastora, T.W. Adair, D.P. Love. Anisotropy dynamics of CuMn spin glass
More informationPollution sources detection via principal component analysis and rotation
Pollution sources detection via principal component analysis and rotation Marie Chavent, Hervé Guegan, Vanessa Kuentz, Brigitte Patouille, Jérôme Saracco To cite this version: Marie Chavent, Hervé Guegan,
More informationSolving an integrated Job-Shop problem with human resource constraints
Solving an integrated Job-Shop problem with human resource constraints Olivier Guyon, Pierre Lemaire, Eric Pinson, David Rivreau To cite this version: Olivier Guyon, Pierre Lemaire, Eric Pinson, David
More informationRare event simulation for a static distribution
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Rare event simulation for a static distribution F. Cérou P. Del Moral T. Furon A. Guyader N 6792 Janvier 2009 Thèmes COG et NUM apport de
More informationOn Newton-Raphson iteration for multiplicative inverses modulo prime powers
On Newton-Raphson iteration for multiplicative inverses modulo prime powers Jean-Guillaume Dumas To cite this version: Jean-Guillaume Dumas. On Newton-Raphson iteration for multiplicative inverses modulo
More informationDelaunay triangulation of a random sample of a good sample has linear size
Delaunay triangulation of a random sample of a good sample has linear size Olivier Devillers, Marc Glisse To cite this version: Olivier Devillers, Marc Glisse. Delaunay triangulation of a random sample
More informationComment on: Sadi Carnot on Carnot s theorem.
Comment on: Sadi Carnot on Carnot s theorem. Jacques Arnaud, Laurent Chusseau, Fabrice Philippe To cite this version: Jacques Arnaud, Laurent Chusseau, Fabrice Philippe. Comment on: Sadi Carnot on Carnot
More informationThe FLRW cosmological model revisited: relation of the local time with th e local curvature and consequences on the Heisenberg uncertainty principle
The FLRW cosmological model revisited: relation of the local time with th e local curvature and consequences on the Heisenberg uncertainty principle Nathalie Olivi-Tran, Paul M Gauthier To cite this version:
More information