Publications

2020

• Parametric inference for diffusions observed at stopping times
  
  • Gobet Emmanuel
  • Stazhynski Uladzislau
  Electronic Journal of Statistics, Shaker Heights, OH : Institute of Mathematical Statistics, 2020, 14 (1). In this paper we study the problem of parametric inference for multidimensional diffusions based on observations at random stopping times. We work in the asymptotic framework of high frequency data over a fixed horizon. Previous works on the subject (such as [Doh87, GJ93, Gob01, AM04] among others) consider only deterministic, strongly predictable or random, independent of the process, observation times, and do not cover our setting. Under mild assumptions we construct a consistent sequence of estimators, for a large class of stopping time observation grids (studied in [GL14, GS18]). Further we carry out the asymptotic analysis of the estimation error and establish a Central Limit Theorem (CLT) with a mixed Gaussian limit. In addition, in the case of a 1-dimensional parameter, for any sequence of estimators verifying CLT conditions without bias, we prove a uniform a.s. lower bound on the asymptotic variance, and show that this bound is sharp. (10.1214/20-EJS1708)
  DOI : 10.1214/20-EJS1708
• On Invariance and Linear Convergence of Evolution Strategies with Augmented Lagrangian Constraint Handling
  
  • Atamna Asma
  • Auger Anne
  • Hansen Nikolaus
  Theoretical Computer Science, Elsevier, 2020, 832, pp.68-97. In the context of numerical constrained optimization, we investigate stochastic algorithms, in particular evolution strategies, handling constraints via augmented Lagrangian approaches. In those approaches, the original constrained problem is turned into an unconstrained one and the function optimized is an augmented Lagrangian whose parameters are adapted during the optimization. The use of an augmented Lagrangian however breaks a central invariance property of evolution strategies, namely invariance to strictly increasing transformations of the objective function. We formalize nevertheless that an evolution strategy with augmented Lagrangian constraint handling should preserve invariance to strictly increasing affine transformations of the objective function and the scaling of the constraints—a subclass of strictly increasing transformations. We show that this invariance property is important for the linear convergence of these algorithms and show how both properties are connected. (10.1016/j.tcs.2018.10.006)
  DOI : 10.1016/j.tcs.2018.10.006
• Error estimates for phase recovering from phaseless scattering data
  
  • Novikov Roman
  • Sivkin Vladimir
  Eurasian Journal of Mathematical and Computer Applications, Eurasian National University, Kazakhstan (Nur-Sultan), 2020, 8 (1), pp.44-61. We study the simplest explicit formulas for approximate finding the complex scattering amplitude from modulus of the scattering wave function. We obtain detailed error estimates for these formulas in dimensions d = 3 and d = 2.
• State-constrained control-affine parabolic problems I: First and Second order necessary optimality conditions
  
  • Aronna M Soledad
  • Bonnans J. Frederic
  • Kröner Axel
  Set-Valued and Variational Analysis, Springer, 2020. In this paper we consider an optimal control problem governed by a semilinear heat equation with bilinear control-state terms and subject to control and state constraints. The state constraints are of integral type, the integral being with respect to the space variable. The control is multidimen-sional. The cost functional is of a tracking type and contains a linear term in the control variables. We derive second order necessary conditions relying on the concept of alternative costates and quasi-radial critical directions. The appendix provides an example illustrating the applicability of our results.
• An Eco-Routing Algorithm for HEVs Under Traffic Conditions
  
  • Rhun Arthur Le
  • Bonnans Frédéric
  • Nunzio Giovanni De
  • Leroy Thomas
  • Martinon Pierre
  IFAC-PapersOnLine, Elsevier, 2020, 53 (2), pp.14242 - 14247. In a previous work, a bi-level optimization approach was presented for the energy management of Hybrid Electric Vehicles (HEVs), using a statistical model for traffic conditions. The present work is an extension of this framework to the eco-routing problem. The optimal trajectory is computed as the shortest path on a weighted graph whose nodes are (position, state of charge) pairs for the vehicle. The edge costs are provided by cost maps from an offline optimization at the lower level of small road segments. The error due to the discretization of the state of charge is proven to be linear if the cost maps are Lipschitz. The classical A * algorithm is used to solve the problem, with a heuristic based on a lower bound of the energy needed to complete the travel. The eco-routing method is compared to the fastest-path strategy by numerical simulations on a simple synthetic road network. (10.1016/j.ifacol.2020.12.1158)
  DOI : 10.1016/j.ifacol.2020.12.1158
• Ergodic behavior of non-conservative semigroups via generalized Doeblin's conditions
  
  • Bansaye Vincent
  • Cloez Bertrand
  • Gabriel Pierre
  Acta Applicandae Mathematicae, Springer Verlag, 2020, 166 (1), pp.29-72. We provide quantitative estimates in total variation distance for positive semi-groups, which can be non-conservative and non-homogeneous. The techniques relies on a family of conservative semigroups that describes a typical particle and Doeblin's type conditions for coupling the associated process. Our aim is to provide quantitative estimates for linear partial differential equations and we develop several applications for population dynamics in varying environment. We start with the asymptotic profile for a growth diffusion model with time and space non-homogeneity. Moreover we provide general estimates for semigroups which become asymptotically homogeneous, which are applied to an age-structured population model. Finally, we obtain a speed of convergence for periodic semi-groups and new bounds in the homogeneous setting. They are are illustrated on the renewal equation. (10.1007/s10440-019-00253-5)
  DOI : 10.1007/s10440-019-00253-5
• SCALPEL3: a scalable open-source library for healthcare claims databases
  
  • Bacry Emmanuel
  • Gaiffas Stéphane
  • Leroy Fanny
  • Morel Maryan
  • Nguyen D.P.
  • Sebiat Youcef
  • Sun Dian
  International Journal of Medical Informatics, Elsevier, 2020.
• Variance Reduction Methods and Multilevel Monte Carlo Strategy for Estimating Densities of Solutions to Random Second-Order Linear Differential Equations
  
  • Jornet Marc
  • Calatayud Julia
  • Le Maitre Olivier
  • Cortés Juan Carlos
  International Journal for Uncertainty Quantification, Begell House Publishers, 2020, 10 (5), pp.467-497. This paper concerns the estimation of the density function of the solution to a random nonautonomous second-order linear differential equation with analytic data processes. In a recent contribution, we proposed to express the density function as an expectation, and we used a standard Monte Carlo algorithm to approximate the expectation. Although the algorithms worked satisfactorily for most test problems, some numerical challenges emerged for others, due to large statistical errors. In these situations, the convergence of the Monte Carlo simulation slows down severely, and noisy features plague the estimates. In this paper, we focus on computational aspects and propose several variance reduction methods to remedy these issues and speed up the convergence. First, we introduce a pathwise selection of the approximating processes which aims at controlling the variance of the estimator. Second, we propose a hybrid method, combining Monte Carlo and deterministic quadrature rules, to estimate the expectation. Third, we exploit the series expansions of the solutions to design a multilevel Monte Carlo estimator. The proposed methods are implemented and tested on several numerical examples to highlight the theoretical discussions and demonstrate the significant improvements achieved.
• ADDITIVE MANUFACTURING SCANNING PATHS OPTIMIZATION USING SHAPE OPTIMIZATION TOOLS
  
  • Boissier M
  • Allaire G.
  • Tournier Christophe
  Structural and Multidisciplinary Optimization, Springer Verlag, 2020, 61, pp.2437–2466. This paper investigates path planning strategies for additive manufacturing processes such as powder bed fusion. The state of the art mainly studies trajectories based on existing patterns. Parametric optimization on these patterns or allocating them to the object areas are the main strategies. We propose in this work a more systematic optimization approach without any a priori restriction on the trajectories. The typical optimization problem is to melt the desired structure, without overheating (to avoid thermally induced residual stresses) and possibly with a minimal path length. The state equation is the heat equation with a source term depending on the scanning path. First, in a steady-state context, shape optimization tools are applied to trajec-tories. Second, for time-dependent problems, an optimal control method is considered instead. In both cases, gradient type algorithms are deduced and tested on 2-d examples. Numerical results are discussed, leading to a better understanding of the problem and thus to short-and long-term perspectives. (10.1007/s00158-020-02614-3)
  DOI : 10.1007/s00158-020-02614-3
• Hölder-logarithmic stability in Fourier synthesis
  
  • Isaev Mikhail
  • Novikov Roman G
  Inverse Problems, IOP Publishing, 2020, 36 (12), pp.125003(17 pp.). We prove a Hölder-logarithmic stability estimate for the problem of finding a sufficiently regular compactly supported function v on R^d from its Fourier transform Fv given on [−r, r]^d. This estimate relies on a Hölder stable continuation of Fv from [−r, r]^d to a larger domain. The related reconstruction procedures are based on truncated series of Chebyshev polynomials. We also give an explicit example showing optimality of our stability estimates. (10.1088/1361-6420/abb5df)
  DOI : 10.1088/1361-6420/abb5df
• Quality Gain Analysis of the Weighted Recombination Evolution Strategy on General Convex Quadratic Functions
  
  • Akimoto Youhei
  • Auger Anne
  • Hansen Nikolaus
  Theoretical Computer Science, Elsevier, 2020, 832, pp.42-67. Quality gain is the expected relative improvement of the function value in a single step of a search algorithm. Quality gain analysis reveals the dependencies of the quality gain on the parameters of a search algorithm, based on which one can derive the optimal values for the parameters. In this paper, we investigate evolution strategies with weighted recombination on general convex quadratic functions. We derive a bound for the quality gain and two limit expressions of the quality gain. From the limit expressions, we derive the optimal recombination weights and the optimal step-size, and find that the optimal recombination weights are independent of the Hessian of the objective function. Moreover, the dependencies of the optimal parameters on the dimension and the population size are revealed. Differently from previous works where the population size is implicitly assumed to be smaller than the dimension, our results cover the population size proportional to or greater than the dimension. Simulation results show the optimal parameters derived in the limit approximates the optimal values in non-asymptotic scenarios. (10.1016/j.tcs.2018.05.015)
  DOI : 10.1016/j.tcs.2018.05.015
• Medical innovations to maintain the function in patients with chronic PJI for whom explantation is not desirable: a pathophysiology-, multidisciplinary-, and experience-based approach
  
  • Ferry Tristan
  • Batailler Cécile
  • Brosset Sophie
  • Kolenda Camille
  • Goutelle Sylvain
  • Sappey-Marinier Elliot
  • Josse Jérôme
  • Laurent Frédéric
  • Lustig Sébastien
  SICOT-J, EDP Open, 2020, 6, pp.26. Introduction: PJI is the most dramatic complication after joint arthroplasty. In patients with chronic infection, prosthesis exchange is in theory the rule. However, this surgical approach is sometimes not desirable especially in elderly patients with multiple comorbidities, as it could be associated with a dramatic loss of function, reduction of the bone stock, fracture, or peroperative death. We propose here to report different approaches that can help to maintain the function in such patients based on a pathophysiology-, multidisciplinary-, and an experience-based approach. Methods: We describe the different points that are needed to treat such patients: (i) the multidisciplinary care management; (ii) understanding the mechanism of bacterial persistence; (iii) optimization of the conservative surgical approach; (iv) use of suppressive antimicrobial therapy (SAT); (v) implementation of innovative agents that could be used locally to target the biofilm. Results: In France, a nation-wide network called CRIOAc has been created and funded by the French Health ministry to manage complex bone and joint infection. Based on the understanding of the complex pathophysiology of PJI, it seems to be feasible to propose conservative surgical treatment such as “debridement antibiotics and implant retention” (with or without soft-tissue coverage) followed by SAT to control the disease progression. Finally, there is a rational for the use of particular agents that have the ability to target the bacteria embedded in biofilm such as bacteriophages and phage lysins. Discussion: This multistep approach is probably a key determinant to propose innovative management in patients with complex PJI, to improve the outcome. Conclusion: Conservative treatment has a high potential in patients with chronic PJI for whom explantation is not desirable. The next step will be to evaluate such practices in nation-wide clinical trials. (10.1051/sicotj/2020021)
  DOI : 10.1051/sicotj/2020021
• Model Reduction for Large-Scale Earthquake Simulation in an Uncertain 3D Medium
  
  • Sochala Pierre
  • de Martin Florent
  • Le Maitre Olivier
  International Journal for Uncertainty Quantification, Begell House Publishers, 2020, 10 (2), pp.101-127. In this paper, we are interested in the seismic wave propagation into an uncertain medium. To this end, we performed an ensemble of 400 large-scale simulations that requires 4 million core-hours of CPU time. In addition to the large computational load of these simulations, solving the uncertainty propagation problem requires dedicated procedures to handle the complexities inherent to large data set size and the low number of samples. We focus on the peak ground motion at the free surface of the 3D domain, and our analysis utilizes a surrogate model combining two key ingredients for complexity mitigation: i) a dimension reduction technique using empirical orthogonal basis functions and ii) a functional approximation of the uncertain reduced coordinates by polynomial chaos expansions. We carefully validate the resulting surrogate model by estimating its predictive error using bootstrap, truncation, and cross-validation procedures. The surrogate model allows us to compute various statistical information of the uncertain prediction, including marginal and joint probability distributions, interval probability maps, and 2D fields of global sensitivity indices. (10.1615/Int.J.UncertaintyQuantification.2020031165)
  DOI : 10.1615/Int.J.UncertaintyQuantification.2020031165
• How a moving passive observer can perceive its environment ? The Unruh effect revisited
  
  • Fink Mathias
  • Garnier Josselin
  Wave Motion, Elsevier, 2020, 93, pp.102462. (10.1016/j.wavemoti.2019.102462)
  DOI : 10.1016/j.wavemoti.2019.102462
• Multipoint formulas for scattered far field in multidimensions
  
  • Novikov Roman
  Inverse Problems, IOP Publishing, 2020, 36 (9), pp.095001(12 pp.). We give asymptotic formulas for finding the scattering amplitude at fixed frequency and angles (scattered far field) from the scattering wave function given at $n$ points in dimension $d\geq 2$. These formulas are explicit and their precision is proportional to $n$. To our knowledge these formulas are new already for $n\geq 2$. (10.1088/1361-6420/aba891)
  DOI : 10.1088/1361-6420/aba891
• A convergent hierarchy of non-linear eigenproblems to compute the joint spectral radius of nonnegative matrices
  
  • Gaubert Stéphane
  • Stott Nikolas
  Mathematical Control and Related Fields, AIMS, 2020, 10 (3), pp.573-590. We show that the joint spectral radius of a finite collection of nonnegative matrices can be bounded by the eigenvalue of a non-linear operator. This eigenvalue coincides with the ergodic constant of a risk-sensitive control problem, or of an entropy game, in which the state space consists of all switching sequences of a given length. We show that, by increasing this length, we arrive at a convergent approximation scheme to compute the joint spectral radius. The complexity of this method is exponential in the length of the switching sequences, but it is quite insensitive to the size of the matrices, allowing us to solve very large scale instances (several matrices in dimensions of order 1000 within a minute). An idea of this method is to replace a hierarchy of optimization problems, introduced by Ahmadi, Jungers, Parrilo and Roozbehani, by a hierarchy of nonlinear eigenproblems. To solve the latter eigenproblems, we introduce a projective version of Krasnoselskii-Mann iteration. This method is of independent interest as it applies more generally to the nonlinear eigenproblem for a monotone positively homogeneous map. Here, this method allows for scalability by avoiding the recourse to linear or semidefinite programming techniques. (10.3934/mcrf.2020011)
  DOI : 10.3934/mcrf.2020011
• Intensity fluctuations in random waveguides
  
  • Garnier Josselin
  Communications in Mathematical Sciences, International Press, 2020, 18 (4), pp.947-971. (10.4310/CMS.2020.v18.n4.a3)
  DOI : 10.4310/CMS.2020.v18.n4.a3
• Wave Propagation in Randomly Perturbed Weakly Coupled Waveguides
  
  • Borcea Liliana
  • Garnier Josselin
  Multiscale Modeling and Simulation: A SIAM Interdisciplinary Journal, Society for Industrial and Applied Mathematics, 2020, 18 (1), pp.44-78. We present an analysis of wave propagation in a two step-index, parallel waveguide system. The goal is to quantify the effect of scattering at randomly perturbed interfaces between the guiding layers of high index of refraction and the host medium. The analysis is based on the expansion of the solution of the wave equation in a complete set of guided, radiation and evanescent modes with amplitudes that are random fields, due to scattering. We obtain a detailed characterization of these amplitudes and thus quantify the transfer of power between the two waveguides in terms of their separation distance. The results show that, no matter how small the fluctuations of the interfacesare, they have significant effect at sufficiently large distance of propagation, which manifests in two ways: The first effect is well known and consists of power leakage from the guided modes to the radiation ones. The second effect consists of blurring of the periodic transfer of power between the waveguides and the eventual equipartition of power. Its quantification is the main practical result ofthe paper. (10.1137/18M1230591)
  DOI : 10.1137/18M1230591
• High-Resolution Interferometric Synthetic Aperture Imaging in Scattering Media
  
  • Borcea Liliana
  • Garnier Josselin
  SIAM Journal on Imaging Sciences, Society for Industrial and Applied Mathematics, 2020, 13 (1), pp.291-316. The goal of synthetic aperture imaging is to estimate the reflectivity of a remoteregion of interest by processing data gathered with a moving sensor which emits periodically a signaland records the backscattered wave. We introduce and analyze a high-resolution interferometric method for synthetic aperture imaging through an unknown scattering medium which distorts thewave. The method builds on the coherent interferometric (CINT) approach which uses empiricalcross-correlations of the measurements to mitigate the distortion, at the expense of a loss of resolutionof the image. The new method shows that, while mitigating the wave distortion, it is possible toobtain a robust and sharp estimate of the modulus of the Fourier transform of the reflectivity function.A high-resolution image can then be obtained by a phase retrieval algorithm. (10.1137/19M1272470)
  DOI : 10.1137/19M1272470
• Support optimization in additive manufacturing for geometric and thermo-mechanical constraints
  
  • Allaire Grégoire
  • Bihr Martin
  • Bogosel Beniamin
  Structural and Multidisciplinary Optimization, Springer Verlag, 2020, 61, pp.2377-2399. Supports are often required to safely complete the building of complicated structures by additive manufacturing technologies. In particular, supports are used as scaffoldings to reinforce overhanging regions of the structure and/or are necessary to mitigate the thermal deformations and residual stresses created by the intense heat flux produced by the source term (typically a laser beam). However, including supports increase the fabrication cost and their removal is not an easy matter. Therefore, it is crucial to minimize their volume while maintaining their efficiency. Based on earlier works, we propose here some new optimization criteria. First, simple geometric criteria are considered like the projected area and the volume of supports required for overhangs: they are minimized by varying the structure orientation with respect to the baseplate. In addition, an accessibility criterion is suggested for the removal of supports, which can be used to forbid some parts of the structure to be supported. Second, shape and topology optimization of supports for compliance minimization is performed. The novelty comes from the applied surface loads which are coming either from pseudo gravity loads on overhanging parts or from equivalent thermal loads arising from the layer by layer building process. Here, only the supports are optimized, with a given non-optimizable structure, but of course many generalizations are possible, including optimizing both the structure and its supports. Our optimization algorithm relies on the level set method and shape derivatives computed by the Hadamard method. Numerical examples are given in 2-d and 3-d.
• Sparse recovery for inverse potential problems in divergence form
  
  • Baratchart Laurent
  • Villalobos Guillén Cristóbal
  • Hardin Douglas
  • Leblond Juliette
  , 2020, 1476, pp.012009. We discuss recent results on sparse recovery for inverse potential problem with source term in divergence form. The notion of sparsity which is set forth is measure-theoretic, namely pure 1-unrectifiability of the support. The theory applies when a superset of the support is known to be slender, meaning it has measure zero and all connected components of its complement has infinite measure in R^3. We also discuss open issues in the non-slender case. (10.1088/1742-6596/1476/1/012009)
  DOI : 10.1088/1742-6596/1476/1/012009
• The tropicalization of the entropic barrier
  
  • Allamigeon Xavier
  • Aznag Abdellah
  • Gaubert Stéphane
  • Hamdi Yassine
  , 2020. The entropic barrier, studied by Bubeck and Eldan (Proc. Mach. Learn. Research, 2015), is a self-concordant barrier with asymptotically optimal self-concordance parameter. In this paper, we study the tropicalization of the central path associated with the entropic barrier, i.e., the logarithmic limit of this central path for a parametric family of linear programs defined over the field of Puiseux series. Our main result is that the tropicalization of the entropic central path is a piecewise linear curve which coincides with the tropicalization of the logarithmic central path studied by Allamigeon et al. (SIAM J. Applied Alg. Geom., 2018). One consequence is that the number of linear pieces in the tropical entropic central path can be exponential in the dimension and the number of inequalities defining the linear program.
• Uncertainty Quantification for Stochastic Approximation Limits Using Chaos Expansion
  
  • Crépey Stéphane
  • Fort Gersende
  • Gobet Emmanuel
  • Stazhynski Uladzislau
  SIAM/ASA Journal on Uncertainty Quantification, ASA, American Statistical Association, 2020, 8 (3), pp.1061–1089. The uncertainty quantification for the limit of a Stochastic Approximation (SA) algorithm is analyzed. In our setup, this limit $f^*$ is defined as a zero of an intractable function and is modeled as uncertain through a parameter $\theta$. We aim at deriving the function $f^*$, as well as the probabilistic distribution of $f^*(\theta)$ given a probability distribution $\pi$ for $\theta$. We introduce the so-called Uncertainty Quantification for SA (UQSA) algorithm, an SA algorithm in increasing dimension for computing the basis coefficients of a chaos expansion of $\theta \mapsto f^*(\theta)$ on an orthogonal basis of a suitable Hilbert space. UQSA, run with a finite number of iterations $K$, returns a finite set of coefficients, providing an approximation $\widehat{f^*_K}(\cdot)$ of $f^*$. We establish the almost-sure and $L^p$-convergences in the Hilbert space of the sequence of functions $\widehat{f^*_K}(\cdot)$ when the number of iterations $K$ tends to infinity. This is done under mild, tractable conditions, uncovered by the existing literature for convergence analysis of infinite dimensional SA algorithms. For a suitable choice of the Hilbert basis, the algorithm also provides an approximation of the expectation, of the variance-covariance matrix and of higher order moments of the quantity $\widehat{f^*_K}(\theta)$ when $\theta$ is random with distribution $\pi$. UQSA is illustrated and the role of its design parameters is discussed numerically. (10.1137/18M1178517)
  DOI : 10.1137/18M1178517
• A MOMENT CLOSURE BASED ON A PROJECTION ON THE BOUNDARY OF THE REALIZABILITY DOMAIN: 1D CASE
  
  • Pichard Teddy
  Kinetic and Related Models, AIMS, 2020, 13 (6), pp.1243-1280. This work aims to develop and test a projection technique for the construction of closing equations of moment systems. One possibility to define such a closure consists in reconstructing an underlying kinetic distribution from a vector of moments, then expressing the closure based on this reconstructed function. Exploiting the geometry of the realizability domain, i.e. the set of moments of positive distribution function, we decompose any realizable vectors into two parts, one corresponding to the moments of a chosen equilibrium function, and one obtain by a projection onto the boundary of the realizability domain in the direction of equilibrium function. A realizable closure of both of these parts are computed with standard techniques providing a realizable closure for the full system. This technique is tested for the reduction of a radiative transfer equation in slab geometry. (10.3934/xx.xx.xx.xx)
  DOI : 10.3934/xx.xx.xx.xx
• Problem and Non-Problem Gamblers: A Cross-Sectional Clustering Study by Gambling Characteristics
  
  • Guillou-Landréat Morgane
  • Chereau Boudet Isabelle
  • Perrot Bastien
  • Romo Lucia
  • Codina Irene
  • Magalon David
  • Fatseas Melina
  • Luquiens Amandine
  • Brousse Georges
  • Challet-Bouju Gaëlle
  • Grall-Bronnec Marie
  BMJ Open, BMJ Publishing Group, 2020, 10 (2), pp.e030424. OBJECTIVES: Gambling characteristics are factors that could influence problem gambling development. The aim of this study was to identify a typology of gamblers to frame risky behaviour based on gambling characteristics (age of initiation/of problem gambling, type of gambling: pure chance/chance with pseudoskills/chance with elements of skill, gambling online/offline, amount wagered monthly) and to investigate clinical factors associated with these different profiles in a large representative sample of gamblers. DESIGN AND SETTING: The study is a cross-sectional analysis to the baseline data of the french JEU cohort study (study protocol : Challet-Bouju et al, 2014). Recruitment (April 2009 to September 2011) involved clinicians and researchers from seven institutions that offer care for or conduct research on problem gamblers (PG). Participants were recruited in gambling places, and in care centres. Only participants who reported gambling in the previous year between 18 and 65 years old were included.Participants gave their written informed consent, it was approved by the French Research Ethics Committee. PARTICIPANTS: The participants were 628 gamblers : 256 non-problem gamblers (NPG), 169 problem gamblers without treatment (PGWT) and 203 problem gamblers seeking treatment (PGST). RESULTS: Six clustering models were tested, the one with three clusters displayed a lower classification error rate (7.92%) and was better suited to clinical interpretation : 'Early Onset and Short Course' (47.5%), 'Early Onset and Long Course' (35%) and 'Late Onset and Short Course' (17.5%). Gambling characteristics differed significantly between the three clusters. CONCLUSIONS: We defined clusters through the analysis of gambling variables, easy to identify, by psychiatrists or by physicians in primary care. Simple screening concerning these gambling characteristics could be constructed to prevent and to help PG identification. It is important to consider gambling characteristics : policy measures targeting gambling characteristics may reduce the risk of PG or minimise harm from gambling. TRIAL REGISTRATION NUMBER: NCT01207674 (ClinicalTrials.gov); Results. (10.1136/bmjopen-2019-030424)
  DOI : 10.1136/bmjopen-2019-030424