Sorry, you need to enable JavaScript to visit this website.
Partager

Publications

Publications

Les thèses soutenues au CMAP sont disponibles en suivant ce lien:
Découvrez les thèses du CMAP

Sont listées ci-dessous, par année, les publications figurant dans l'archive ouverte HAL.

2013

  • On the class of graphs with strong mixing properties
    • Isaev Mikhail
    • Isaeva K.V
    Proceeding of MIPT, 2013, 5 (6), pp.44-54. We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk on the graph. We prove equivalence of this properties (in some sense). We give estimates for the probability for a random graph to satisfy these properties. In addition, we present asymptotic formulas for the numbers of Eulerian orientations and Eulerian circuits in an undirected simple graph.
  • Time reversal in viscoelastic media
    • Ammari Habib
    • Bretin Elie
    • Garnier Josselin
    • Wahab Abdul
    European Journal of Applied Mathematics, Cambridge University Press (CUP), 2013, 24, pp.565-600. In this paper, we consider the problem of reconstructing sources in a homogeneous viscoelastic medium from wavefield measurements using time-reversal algorithms. Our motivation is the recent advances on hybrid methods in biomedical imaging. We first present a modified time-reversal imaging algorithm based on a weighted Helmholtz decomposition and justify mathematically that it provides a better approximation than by simply time reversing the displacement field. Then, we investigate the source inverse problem in an elastic attenuating medium. We provide a regularized time-reversal imaging which corrects the attenuation effect at the first order.
  • Ecologie prédictive & changement planétaire
    • Austerlitz Frédéric
    • Blum Michael
    • Calba Sarah
    • Chave Jérôme
    • Choisy Marc
    • Coreau Audrey
    • Devictor Vincent
    • Doyen Luc
    • Dray Stéphane
    • Duputié Anne
    • Eveillard Damien
    • Faure Denis
    • Favier Charly
    • Gaggiotti Oscar
    • Galtier Nicolas
    • Garnier Éric
    • Gimenez Olivier
    • Guis Helene
    • Herbreteau Vincent
    • Huneman Philippe
    • Jabot Franck
    • Jarne Philippe
    • Joly Dominique
    • Julliard Romain
    • Kéfi Sonia
    • Kergoat Gael
    • Lacroix Gerard
    • Lagadeuc Yvan
    • Lavorel Sandra
    • Le Gaillard Jean-François
    • Le Gall Line
    • Loreau Michel
    • Maris Virginie
    • Morand Serge
    • Morin Xavier
    • Morlon Hélène
    • Mouquet Nicolas
    • Pinay Gilles
    • Pottier Julien
    • Pradel Roger
    • Ronce Ophélie
    • Schurr Frank
    • Simonet Pascal
    • Teplitsky Céline
    • Thuiller Wilfried
    • Tran Anne-Lise
    • Venner Samuel
    , 2013, hors s\'{e}rie, pp.9-44.
  • First and second order optimality conditions for optimal control problems of state constrained integral equations
    • Bonnans J. Frédéric
    • de La Vega Constanza
    • Dupuis Xavier
    Journal of Optimization Theory and Applications, Springer Verlag, 2013, 159 (1), pp.1-40. This paper deals with optimal control problems of integral equations, with initial-final and running state constraints. The order of a running state constraint is defined in the setting of integral dynamics, and we work here with constraints of arbitrary high orders. First and second-order necessary conditions of optimality are obtained, as well as second-order sufficient conditions. (10.1007/s10957-013-0299-3)
    DOI : 10.1007/s10957-013-0299-3
  • Mathématiques: l'explosion continue
    • Anantharaman Nalini
    • de Bouard Anne
    • Lagoutière Frédéric
    • Gegout-Petit Anne
    • Ollivier Yann
    • Santambrogio Filippo
    • Bardet Jean-Marc
    , 2013, pp.1-180.
  • Is the Distance Geometry Problem in NP?
    • Beeker Nathanael
    • Gaubert Stéphane
    • Glusa Christian
    • Liberti Leo
    , 2013, pp.85-93. (10.1007/978-1-4614-5128-0_5)
    DOI : 10.1007/978-1-4614-5128-0_5
  • Méthodes de Monte-Carlo et processus stochastiques
    • Gobet Emmanuel
    , 2013, pp.258. La méthode de Monte-Carlo, qui tire son nom du fameux casino à Monaco, s’est développée de manière spectaculaire depuis 60 ans : elle figure parmi les 10 algorithmes ayant eu le plus d’influence sur le développement et la pratique de la science et de l’ingénierie au xxe siècle. En fait, il n’existe pas une méthode de Monte-Carlo mais des méthodes de Monte-Carlo. La 1re partie de l’ouvrage dresse un panorama de l’existant, puis détaille les outils de base pour la simulation de variables aléatoires, les résultats de convergence les plus courants et les techniques d’accélération des méthodes de Monte-Carlo. Puis, la 2e partie aborde la simulation des équations différentielles stochastiques (processus à évolution linéaire dérivant du mouvement brownien), dont les applications en biologie, chimie, économie, finance, géophysique, mécanique des fluides, neuroscience etc. sont importantes. L’objectif principal est le calcul d’espérance de leurs trajectoires. Cela donne, via les formules de Feynman-Kac, des solutions probabilistes aux équations aux dérivées partielles : ce lien remarquable permet de résoudre, par simulations Monte-Carlo, ces équations en toute dimension. Enfin, la 3e partie, la plus originale, traite des processus stochastiques ayant des évolutions non-linéaires (modélisant des interactions variées), comme les équations du contrôle stochastique, les diffusions branchantes, les équations stochastiques de McKean-Vlasov, avec des applications fondamentales en plein développement. Nous présentons notamment quelques idées importantes d’apprentissage statistique, dont le couplage aux méthodes de Monte-Carlo (via les régressions empiriques) conduit à des algorithmes des plus performants. Dans cet ouvrage, nous mettons en avant les grands principes de simulation efficace, avec une présentation exigeant le moins de préalables mathématiques. Le niveau prérequis à la lecture de ce cours est celui de Master 1, ou 2e année d’école d’ingénieurs. Cet ouvrage intéressera aussi des étudiants plus avancés ou des enseignants-chercheurs, souhaitant dégager l’essentiel des outils sophistiqués pour la simulation de processus stochastiques linéaires et non-linéaires.
  • Minimal external representations of tropical polyhedra
    • Allamigeon Xavier
    • Katz R.D.
    Journal of Combinatorial Theory, Series A, Elsevier, 2013, 120 (4), pp.907-940. (10.1016/j.jcta.2013.01.011)
    DOI : 10.1016/j.jcta.2013.01.011
  • Faddeev eigenfunctions for multipoint potentials
    • Grinevich Piotr
    • Novikov Roman
    Eurasian Journal of Mathematical and Computer Applications, Eurasian National University, Kazakhstan (Nur-Sultan), 2013, 1 (2), pp.76-91. We present explicit formulas for the Faddeev eigenfunctions and related generalized scattering data for multipoint potentials in two and three dimensions. For single point potentials in 3D such formulas were obtained in an old unpublished work of L.D. Faddeev. For single point potentials in 2D such formulas were given recently in [P.G. Grinevich, R.G. Novikov, Physics Letters A,376,(2012),1102-1106].
  • Stochastic Simulation and Monte Carlo Methods. Mathematical Foundations of Stochastic Simulation.
    • Talay Denis
    • Graham Carl
    , 2013, 68, pp.268.
  • Shape dependent controllability of a quantum transistor
    • Méhats Florian
    • Privat Yannick
    • Sigalotti Mario
    , 2013, pp.1253-1258.
  • A decomposition technique for pursuit evasion games with many pursuers
    • Festa Adriano
    • Vinter Richard
    , 2013. Here we present a decomposition technique for a class of differential games. The technique consists in a decomposition of the target set which produces, for geometrical reasons, a decomposition in the dimensionality of the problem. Using some elements of Hamilton-Jacobi equations theory, we find a relation between the regularity of the solution and the possibility to decompose the problem. We use this technique to solve a pursuit evasion game with multiple agents.
  • Tumor Growth Parameters Estimation and Source Localization From a Unique Time Point: Application to Low-grade Gliomas
    • Rekik Islem
    • Allassonnière Stéphanie
    • Clatz Olivier
    • Geremia Ezequiel
    • Stretton Erin
    • Delingette Hervé
    • Ayache Nicholas
    Computer Vision and Image Understanding, Elsevier, 2013, 117 (3), pp.238--249. Coupling time series of MR Images with reaction-di usion-based models has provided interesting ways to better understand the proliferative-invasive as- pect of glial cells in tumors. In this paper, we address a di erent formulation of the inverse problem: from a single time point image of a non-swollen brain tumor, estimate the tumor source location and the di usivity ratio between white and grey matter, while exploring the possibility to predict the further extent of the observed tumor at later time points in low-grade gliomas. The synthetic and clinical results show the stability of the located source and its varying distance from the tumor barycenter and how the estimated ratio controls the spikiness of the tumor. (10.1016/j.cviu.2012.11.001)
    DOI : 10.1016/j.cviu.2012.11.001
  • Lipschitz classification of almost-Riemannian distances on compact oriented surfaces
    • Boscain Ugo
    • Charlot Grégoire
    • Ghezzi Roberta
    • Sigalotti Mario
    The Journal of Geometric Analysis, Springer, 2013, 23, pp.438-455. Two-dimensional almost-Riemannian structures are generalized Riemannian structures on surfaces for which a local orthonormal frame is given by a Lie bracket generating pair of vector fields that can become collinear. We consider the Carnot--Caratheodory distance canonically associated with an almost-Riemannian structure and study the problem of Lipschitz equivalence between two such distances on the same compact oriented surface. We analyse the generic case, allowing in particular for the presence of tangency points, i.e., points where two generators of the distribution and their Lie bracket are linearly dependent. The main result of the paper provides a characterization of the Lipschitz equivalence class of an almost-Riemannian distance in terms of a labelled graph associated with it. (10.1007/s12220-011-9262-4)
    DOI : 10.1007/s12220-011-9262-4
  • An adaptive sparse grid semi-lagrangian scheme for first order Hamilton-Jacobi Bellman equations
    • Bokanowski Olivier
    • Garcke Jochen
    • Griebel Michael
    • Klompmaker Irene
    Journal of Scientific Computing, Springer Verlag, 2013, 55, pp.pp. 575-605. We propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to deal with non-linear time-dependent Hamilton-Jacobi Bellman equations. We focus in particular on front propagation models in higher dimensions which are related to control problems. We test the numerical efficiency of the method on several benchmark problems up to space dimension d = 8, and give evidence of convergence towards the exact viscosity solution. In addition, we study how the complexity and precision scale with the dimension of the problem. (10.1007/s10915-012-9648-x)
    DOI : 10.1007/s10915-012-9648-x
  • Path Planning and Ground Control Station Simulator for UAV
    • Ajami Alain
    • Balmat Jean-François
    • Gauthier Jean-Paul
    • Maillot Thibault
    , 2013, pp.1-13. no abstract
  • Optimally swimming stokesian robots
    • Alouges François
    • Desimone Antonio
    • Heltai Luca
    • Lefebvre-Lepot Aline
    • Merlet Benoît
    Discrete and Continuous Dynamical Systems - Series B, American Institute of Mathematical Sciences, 2013, 18 (5), pp.1189-1215. We study self-propelled stokesian robots composed of assemblies of balls, in dimensions 2 and 3, and prove that they are able to control their position and orientation. This is a result of controllability, and its proof relies on applying Chow's theorem in an analytic framework, similar to what has been done in [3] for an axisymmetric system swimming along the axis of symmetry. We generalize the analyticity result given in [3] to the situation where the swimmers can move either in a plane or in three-dimensional space, hence experiencing also rotations. We then focus our attention on energetically optimal strokes, which we are able to compute numerically. Some examples of computed optimal strokes are discussed in detail. (10.3934/dcdsb.2013.18.1189)
    DOI : 10.3934/dcdsb.2013.18.1189
  • Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties
    • Isaev Mikhail
    Izvestiya RAN. Serya Matematicheskaya, 2013, 77 (6), pp.45-70. We prove an asymptotic formula for the number of Eulerian circuits for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error $O(n^{-1/2+\varepsilon})$, where $n$ is the number of vertices
  • Direct competition results from strong competiton for limited resource
    • Mirrahimi Sepideh
    • Perthame Benoît
    • Wakano Joe Yuichiro
    Journal of Mathematical Biology, Springer, 2013, pp.0303-6812. We study a model of competition for resource through a chemostat-type model where species consume the common resource that is constantly supplied. We assume that the species and resources are characterized by a continuous trait. As already proved, this model, although more complicated than the usual Lotka-Volterra direct competition model, describes competitive interactions leading to concentrated distributions of species in continuous trait space. Here we assume a very fast dynamics for the supply of the resource and a fast dynamics for death and uptake rates. In this regime we show that factors that are independent of the resource competition become as important as the competition efficiency and that the direct competition model is a good approximation of the chemostat. Assuming these two timescales allows us to establish a mathematically rigorous proof showing that our resource-competition model with continuous traits converges to a direct competition model. We also show that the two timescales assumption is required to mathematically justify the corresponding classic result on a model consisting of only finite number of species and resources (MacArthur, R. Theor. Popul. Biol. 1970:1, 1-11). This is performed through asymptotic analysis, introducing different scales for the resource renewal rate and the uptake rate. The mathematical difficulty relies in a possible initial layer for the resource dynamics. The chemostat model comes with a global convex Lyapunov functional. We show that the particular form of the competition kernel derived from the uptake kernel, satisfies a positivity property which is known to be necessary for the direct competition model to enjoy the related Lyapunov functional. (10.1007/s00285-013-0659-5)
    DOI : 10.1007/s00285-013-0659-5
  • Spatiotemporal Dynamic Simulation of Acute Perfusion/Diffusion Ischemic Stroke Lesions Evolution: A Pilot Study Derived from Longitudinal MR Patient Data
    • Rekik Islem
    • Allassonnière Stéphanie
    • Durrleman Stanley
    • Carpenter Trevor
    • Wardlaw Joanna M
    Computational and Mathematical Methods in Medicine, Hindawi Publishing Corporation, 2013. The spatiotemporal evolution of stroke lesions, from acute injury to final tissue damage, is complex. Diffusion-weighted (DWI) and perfusion-weighted (PWI) imaging is commonly used to detect early ischemic changes and attempts to distinguish between permanently damaged and salvageable tissues. To date, 2D and 3D measures of diffusion/perfusion regions at individual timepoints have been widely used but may underestimate the true lesion spatio-temporal dynamics. Currently there is no spatio-temporal 4D dynamic model that simulates the continuous evolution of ischemic stroke from MR images. We determined whether a 4D current-based diffeomorphic model, developed in the field of statistical modeling for measuring the variability of anatomical surfaces, could estimate patient-specific spatio-temporal continuous evolution for MR PWI (measured as mean transit time, (MTT)) and DWI lesions. In our representative pilot sample, the model fitted the data well. Our dynamic analysis of lesion evolution showed different patterns; for example, some DWI/PWI dynamic changes corresponded with DWI lesion expansion into PWI lesions, but other patterns were much more complex and diverse. There was wide variation in the time when the final tissue damage was reached after stroke for DWI and MTT (10.1155/2013/283593)
    DOI : 10.1155/2013/283593
  • Preliminary control variates to improve empirical regression methods
    • Benzineb Tarik
    • Gobet Emmanuel
    Monte Carlo Methods and Applications, De Gruyter, 2013, 19 (4), pp.331--354. We design a variance reduction method to reduce the estimation error in regression problems. It is based on an appropriate use of other known regression functions. Theoretical estimates are supporting this improvement and numerical experiments are illustrating the efficiency of the method.
  • A Formula for Popp’s Volume in Sub-Riemannian Geometry
    • Barilari Davide
    • Rizzi Luca
    Analysis and Geometry in Metric Spaces, Versita, 2013, 1. For an equiregular sub-Riemannian manifold M, Popp's volume is a smooth volume which is canonically associated with the sub-Riemannian structure, and it is a natural generalization of the Riemannian one. In this paper we prove a general formula for Popp's volume, written in terms of a frame adapted to the sub-Riemannian distribution. As a first application of this result, we prove an explicit formula for the canonical sub-Laplacian, namely the one associated with Popp's volume. Finally, we discuss sub-Riemannian isometries, and we prove that they preserve Popp's volume. We also show that, under some hypotheses on the action of the isometry group of M, Popp's volume is essentially the unique volume with such a property. (10.2478/agms-2012-0004)
    DOI : 10.2478/agms-2012-0004
  • Analysis of the factorization method for a general class of boundary conditions
    • Chamaillard Mathieu
    • Chaulet Nicolas
    • Haddar Houssem
    Journal of Inverse and Ill-posed Problems, De Gruyter, 2013. We analyze the factorization method (introduced by Kirsch in 1998 to solve inverse scattering problems at fixed frequency from the farfield operator) for a general class of boundary conditions that generalizes impedance boundary conditions. For instance, when the surface impedance operator is of pseudo-differential type, our main result stipulates that the factorization method works if the order of this operator is different from one and the operator is Fredholm of index zero with non negative imaginary part. We also provide some validating numerical examples for boundary operators of second order with discussion on the choice of the testing function. (10.1515/jip-2013-0013)
    DOI : 10.1515/jip-2013-0013
  • New global stability estimates for monochromatic inverse acoustic scattering
    • Isaev Mikhail
    • Novikov Roman
    SIAM Journal on Mathematical Analysis, Society for Industrial and Applied Mathematics, 2013, 45 (3), pp.1495-1504. We give new global stability estimates for monochromatic inverse acoustic scattering. These estimates essentially improve estimates of [P. Hahner, T. Hohage, SIAM J. Math. Anal., 33(3), 2001, 670-685] and can be considered as a solution of an open problem formulated in the aforementioned work.
  • Extinction probabilities for a distylous plant population modeled by an inhomogeneous random walk on the positive quadrant
    • Lafitte-Godillon Pauline
    • Raschel Kilian
    • Tran Viet Chi
    SIAM Journal on Applied Mathematics, Society for Industrial and Applied Mathematics, 2013, 73 (2), pp.700-722. In this paper, we study a flower population in which self-reproduction is not permitted. Individuals are diploid, {that is, each cell contains two sets of chromosomes}, and {distylous, that is, two alleles, A and a, can be found at the considered locus S}. Pollen and ovules of flowers with the same genotype at locus S cannot mate. This prevents the pollen of a given flower to fecundate its {own} stigmata. Only genotypes AA and Aa can be maintained in the population, so that the latter can be described by a random walk in the positive quadrant whose components are the number of individuals of each genotype. This random walk is not homogeneous and its transitions depend on the location of the process. We are interested in the computation of the extinction probabilities, {as} extinction happens when one of the axis is reached by the process. These extinction probabilities, which depend on the initial condition, satisfy a doubly-indexed recurrence equation that cannot be solved directly. {Our contribution is twofold : on the one hand, we obtain an explicit, though intricate, solution through the study of the PDE solved by the associated generating function. On the other hand, we provide numerical results comparing stochastic and deterministic approximations of the extinction probabilities. (10.1137/120864258)
    DOI : 10.1137/120864258