Publications

2019

• The asymptotic geometry of the Teichmüller metric
  
  • Walsh Cormac
  Geometriae Dedicata, Springer Verlag, 2019, 200 (1), pp.115-152. We determine the asymptotic behaviour of extremal length along arbitrary Teichmüller rays. This allows us to calculate the endpoint in the Gardiner-Masur boundary of any Teichmüller ray. We give a proof that this compactification is the same as the horofunction compactification. An important subset of the latter is the set of Busemann points. We show that the Busemann points are exactly the limits of the Teichmüller rays, and we give a necessary and sufficient condition for a sequence of Busemann points to converge to a Busemann point. Finally, we determine the detour metric on the boundary. (10.1007/s10711-018-0364-z)
  DOI : 10.1007/s10711-018-0364-z
• C-mix: a high dimensional mixture model for censored durations, with applications to genetic data
  
  • Bussy Simon
  • Guilloux Agathe
  • Gaïffas Stéphane
  • Jannot Anne-Sophie
  Statistical Methods in Medical Research, SAGE Publications, 2019, 28 (5), pp.1523--1539. We introduce a supervised learning mixture model for censored durations (C-mix) to simultaneously detect subgroups of patients with different prognosis and order them based on their risk. Our method is applicable in a high-dimensional setting, i.e. with a large number of biomedical covariates. Indeed, we penalize the negative log-likelihood by the Elastic-Net, which leads to a sparse parameterization of the model and automatically pinpoints the relevant covariates for the survival prediction. Inference is achieved using an efficient Quasi-Newton Expectation Maximization (QNEM) algorithm, for which we provide convergence properties. The statistical performance of the method is examined on an extensive Monte Carlo simulation study, and finally illustrated on three publicly available genetic cancer datasets with high-dimensional co-variates. We show that our approach outperforms the state-of-the-art survival models in this context, namely both the CURE and Cox proportional hazards models penalized by the Elastic-Net, in terms of C-index, AUC(t) and survival prediction. Thus, we propose a powerfull tool for personalized medicine in cancerology. (10.1177/0962280218766389)
  DOI : 10.1177/0962280218766389
• A Scaling Analysis of a Star Network with Logarithmic Weights
  
  • Robert Philippe
  • Véber Amandine
  Stochastic Processes and their Applications, Elsevier, 2019. The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has L requests to transmit and is idle, it tries to access the channel at a rate proportional to log(1+L). A stochastic model of such an algorithm is investigated in the case of the star network, in which J nodes can transmit simultaneously, but interfere with a central node 0 in such a way that node 0 cannot transmit while one of the other nodes does. One studies the impact of the log policy on these J+1 interacting communication nodes. A fluid scaling analysis of the network is derived with the scaling parameter N being the norm of the initial state. It is shown that the asymptotic fluid behavior of the system is a consequence of the evolution of the state of the network on a specific time scale $(N t , t∈(0, 1))$. The main result is that, on this time scale and under appropriate conditions, the state of a node with index $j≥1$ is of the order of $N^{a_j(t)}$ , with $0≤a_j(t)<1$, where $t →a_j(t)$ is a piecewise linear function. Convergence results on the fluid time scale and a stability property are derived as a consequence of this study. (10.1016/j.spa.2018.06.002)
  DOI : 10.1016/j.spa.2018.06.002
• The operator approach to entropy games
  
  • Akian Marianne
  • Gaubert Stéphane
  • Grand-Clément Julien
  • Guillaud Jérémie
  Theory of Computing Systems, Springer Verlag, 2019, 63, pp.1089-1130. Entropy games and matrix multiplication games have been recently introduced by Asarin et al. They model the situation in which one player (Despot) wishes to minimize the growth rate of a matrix product, whereas the other player (Tribune) wishes to maximize it. We develop an operator approach to entropy games. This allows us to show that entropy games can be cast as stochastic mean payoff games in which some action spaces are simplices and payments are given by a relative entropy (Kullback-Leibler divergence). In this way, we show that entropy games with a fixed number of states belonging to Despot can be solved in polynomial time. This approach also allows us to solve these games by a policy iteration algorithm, which we compare with the spectral simplex algorithm developed by Protasov. (10.1007/s00224-019-09925-z)
  DOI : 10.1007/s00224-019-09925-z
• Statistical estimation in a randomly structured branching population
  
  • Hoffmann Marc
  • Marguet Aline
  Stochastic Processes and their Applications, Elsevier, 2019, 129 (12), pp.5236-5277. We consider a binary branching process structured by a stochastic trait that evolves according to a diffusion process that triggers the branching events, in the spirit of Kimmel's model of cell division with parasite infection. Based on the observation of the trait at birth of the first n generations of the process, we construct nonparametric estimator of the transition of the associated bifurcating chain and study the parametric estimation of the branching rate. In the limit $n → ∞$, we obtain asymptotic efficiency in the parametric case and minimax optimality in the nonparametric case. (10.1016/j.spa.2019.02.015)
  DOI : 10.1016/j.spa.2019.02.015
• Longest increasing paths with gaps
  
  • Basdevant Anne-Laure
  • Gerin Lucas
  ALEA : Latin American Journal of Probability and Mathematical Statistics, Instituto Nacional de Matemática Pura e Aplicada (Rio de Janeiro, Brasil) [2006-....], 2019, 16 (2), pp.1141--1163. We consider a variant of the continuous and discrete Ulam-Hammersley problems: we study the maximal length of an increasing path through a Poisson point process (or a Bernoulli point process) with the restriction that there must be minimal gaps between abscissae and ordinates of successive points of the path. For both cases (continuous and discrete) our approach rely on couplings with well-studied models: respectively the classical Ulam-Hammersley problem and last-passage percolation with geometric weights. Thanks to these couplings we obtain explicit limiting shapes in both settings. We also establish that, as in the classical Ulam-Hammersley problem, the fluctuations around the mean are given by the Tracy-Widom distribution.
• New preconditioners for Laplace and Helmholtz integral equations on open curves
  
  • Alouges François
  • Averseng Martin
  , 2019. The numerical resolution of wave scattering problems by open curves leads to ill-conditioned linear systems which are difficult to precondition due to the geometrical singularities at the edges. We introduce two new preconditioners to tackle this problem respectively for Dirichlet or Neu-mann boundary data, that take the form of square roots of local operators. We describe an adapted analytical setting to analyze them and demonstrate the efficiency of this method on several numerical examples. A complete new pseudo-differential calculus suited to the study of such operators is postponed to the second part of this work.
• A stochastic data-based traffic model applied to vehicles energy consumption estimation
  
  • Le Rhun Arthur
  • Bonnans Frédéric
  • de Nunzio Giovanni
  • Leroy Thomas
  • Martinon Pierre
  IEEE Transactions on Intelligent Transportation Systems, IEEE, 2019. A new approach to estimate traffic energy consumption via traffic data aggregation in (speed,acceleration) probability distributions is proposed. The aggregation is done on each segment composing the road network. In order to reduce data occupancy, clustering techniques are used to obtain meaningful classes of traffic conditions. Different times of the day with similar speed patterns and traffic behavior are thus grouped together in a single cluster. Different energy consumption models based on the aggregated data are proposed to estimate the energy consumption of the vehicles in the road network. For validation purposes, a microscopic traffic simulator is used to generate the data and compare the estimated energy consumption to the reference one. A thorough sensitivity analysis with respect to the parameters of the proposed method (i.e. number of clusters, size of the distributions support, etc.) is also conducted in simulation. Finally, a real-life scenario using floating car data is analyzed to evaluate the applicability and the robustness of the proposed method. (10.1109/TITS.2019.2923292)
  DOI : 10.1109/TITS.2019.2923292
• Avis en réponse à la saisine HCB - dossier RX-015. Paris, le 26 février 2019
  
  • Comité Scientifique Du Haut Conseil Des Biotechnologies .
  • Angevin Frédérique
  • Bagnis Claude
  • Bar-Hen Avner
  • Barny Marie-Anne
  • Boireau Pascal
  • Brévault Thierry
  • Chauvel Bruno B.
  • Collonnier Cécile
  • Couvet Denis
  • Dassa Elie
  • de Verneuil Hubert
  • Demeneix Barbara
  • Franche Claudine
  • Guerche Philippe
  • Guillemain Joël
  • Hernandez Raquet Guillermina
  • Khalife Jamal
  • Klonjkowski Bernard
  • Lavielle Marc
  • Le Corre Valérie
  • Lefèvre François
  • Lemaire Olivier
  • Lereclus Didier D.
  • Maximilien Rémy
  • Meurs Eliane
  • Naffakh Nadia
  • Négre Didier
  • Noyer Jean-Louis
  • Ochatt Sergio
  • Pages Jean-Christophe
  • Raynaud Xavier
  • Regnault-Roger Catherine
  • Renard Michel M.
  • Renault Tristan
  • Saindrenan Patrick
  • Simonet Pascal
  • Troadec Marie-Bérengère
  • Vaissière Bernard
  • Vilotte Jean-Luc
  , 2019.
• Avis en réponse à la saisine HCB - dossier 2018-151. Paris, le 10 janvier 2019
  
  • Comité Scientifique Du Haut Conseil Des Biotechnologies .
  • Angevin Frédérique
  • Bagnis Claude
  • Bar-Hen Avner
  • Barny Marie-Anne
  • Boireau Pascal
  • Brévault Thierry
  • Chauvel Bruno B.
  • Collonnier Cécile
  • Couvet Denis
  • Dassa Elie
  • de Verneuil Hubert
  • Demeneix Barbara
  • Franche Claudine
  • Guerche Philippe
  • Guillemain Joël
  • Hernandez Raquet Guillermina
  • Khalife Jamal
  • Klonjkowski Bernard
  • Lavielle Marc
  • Le Corre Valérie
  • Lefèvre François
  • Lemaire Olivier
  • Lereclus Didier D.
  • Maximilien Rémy
  • Meurs Eliane
  • Naffakh Nadia
  • Négre Didier
  • Noyer Jean-Louis
  • Ochatt Sergio
  • Pages Jean-Christophe
  • Raynaud Xavier
  • Regnault-Roger Catherine
  • Renard Michel M.
  • Renault Tristan
  • Saindrenan Patrick
  • Simonet Pascal
  • Troadec Marie-Bérengère
  • Vaissière Bernard
  • Vilotte Jean-Luc
  , 2019.
• Imputation of mixed data with multilevel singular value decomposition
  
  • Husson François
  • Josse Julie
  • Narasimhan Balasubramanian
  • Robin Geneviève
  Journal of Computational and Graphical Statistics, Taylor & Francis, 2019, 28 (3), pp.552-566. Statistical analysis of large data sets offers new opportunities to better understand many processes. Yet, data accumulation often implies relaxing acquisition procedures or compounding diverse sources. As a consequence, such data sets often contain mixed data, i.e. both quantitative and qualitative and many missing values. Furthermore, aggregated data present a natural \textit{multilevel} structure, where individuals or samples are nested within different sites, such as countries or hospitals. Imputation of multilevel data has therefore drawn some attention recently, but current solutions are not designed to handle mixed data, and suffer from important drawbacks such as their computational cost. In this article, we propose a single imputation method for multilevel data, which can be used to complete either quantitative, categorical or mixed data. The method is based on multilevel singular value decomposition (SVD), which consists in decomposing the variability of the data into two components, the between and within groups variability, and performing SVD on both parts. We show on a simulation study that in comparison to competitors, the method has the great advantages of handling data sets of various size, and being computationally faster. Furthermore, it is the first so far to handle mixed data. We apply the method to impute a medical data set resulting from the aggregation of several data sets coming from different hospitals. This application falls in the framework of a larger project on Trauma patients. To overcome obstacles associated to the aggregation of medical data, we turn to distributed computation. The method is implemented in an R package. (10.1080/10618600.2019.1585261)
  DOI : 10.1080/10618600.2019.1585261
• On the Essential Self-Adjointness of Singular Sub-Laplacians
  
  • Franceschi Valentina
  • Prandi Dario
  • Rizzi Luca
  Potential Analysis, Springer Verlag, 2019, 53, pp.89-112. (10.1007/s11118-018-09760-w)
  DOI : 10.1007/s11118-018-09760-w
• Local decay for weak interactions with massless particles
  
  • Barbaroux Jean-Marie
  • Faupin Jérémy
  • Guillot Jean-Claude
  Journal of Spectral Theory, European Mathematical Society, 2019, 9 (2), pp.453–512. We consider a mathematical model for the weak decay of the intermediate boson $Z^0$ into neutrinos and antineutrinos. We prove that the total Hamiltonian has a unique ground state in Fock space and we establish a limiting absorption principle, local decay and a property of relaxation to the ground state for initial states and observables suitably localized in energy and position. Our proofs rest, in particular, on Mourre's theory and a low-energy decomposition. (10.4171/JST/253)
  DOI : 10.4171/JST/253
• A kinetic model of reactive crystal surfaces A Kinetic Model of Reactive Crystal Surfaces
  
  • Aoki Kazuo
  • Giovangigli Vincent
  AIP Conference Proceedings, American Institute of Physics, 2019, 2132. A kinetic model describing chemical reactions on a crystal surface is introduced. The Boltzmann equations involve particles interacting with potentials generated by fixed crystal particles and interacting with a phonon gas describing the fluctuating part of the potentials. Chemical reactions between gas/physisorbed, chemisorbed and crystal species are taken into account. The phonons are assumed to be at equilibrium for the sake of simplicity. A modified kinetic entropy is introduced for the coupled system and the H theorem is established. Using a fluid scaling and the Chapman-Enskog asymptotic method, species fluid boundary conditions involving heterogeneous reactions are recovered at the surface. (10.1063/1.5119623)
  DOI : 10.1063/1.5119623
• Spreading and vanishing for a monostable reaction-diffusion equation with forced speed
  
  • Bouhours Juliette
  • Giletti Thomas
  Journal of Dynamics and Differential Equations, Springer Verlag, 2019, 35, pp.92 - 117. Invasion phenomena for heterogeneous reaction-diffusion equations are contemporary and challenging questions in applied mathematics. In this paper we are interested in the question of spreading for a reaction-diffusion equation when the subdomain where the reaction term is positive is shifting/contracting at a given speed c. This problem arises in particular in the modelling of the impact of climate change on population dynamics. By placing ourselves in the appropriate moving frame, this leads us to consider a reaction-diffusion-advection equation with a heterogeneous in space reaction term, in dimension N ≥ 1. We investigate the behaviour of the solution u depending on the value of the advection constant c, which typically stands for the velocity of climate change. We find that, when the initial datum is compactly supported, there exists precisely three ranges for c leading to drastically different situations. In the lower speed range the solution always spreads, while in the upper range it always vanishes. More surprisingly, we find that that both spreading and vanishing may occur in an intermediate speed range. The threshold between those two outcomes is always sharp, both with respect to c and to the initial condition. We also briefly consider the case of an exponentially decreasing initial condition, where we relate the decreasing rate of the initial condition with the range of values of c such that spreading occurs. (10.1007/s10884-018-9643-5)
  DOI : 10.1007/s10884-018-9643-5
• Optimal control problem for viscous systems of conservation laws, with geometric parameter, and application to the Shallow-Water equations
  
  • Court Sébastien
  • Kunisch Karl
  • Pfeiffer Laurent
  Interfaces and Free Boundaries : Mathematical Analysis, Computation and Applications, European Mathematical Society, 2019, 21 (3), pp.273-311. A theoretical framework and numerical techniques to solve optimal control problems with a spatial trace term in the terminal cost and governed by regularized nonlinear hyperbolic conservation laws are provided. Depending on the spatial dimension, the set at which the optimum of the trace term is reached under the action of the control function can be a point, a curve or a hypersurface. The set is determined by geometric parameters. Theoretically the lack of a convenient functional framework in the context of optimal control for hyperbolic systems leads us to consider a parabolic regularization for the state equation, in order to derive optimality conditions. For deriving these conditions, we use a change of variables encoding the sensitivity with respect to the geometric parameters. As illustration, we consider the shallow-water equations with the objective of maximizing the height of the wave at the final time, a wave whose location and shape are optimized via the geometric parameters. Numerical results are obtained in 1D and 2D, using finite difference schemes, combined with an immersed boundary method for iterating the geometric parameters. (10.4171/IFB/424)
  DOI : 10.4171/IFB/424
• Uniform sampling in a structured branching population
  
  • Marguet Aline
  Bernoulli, Bernoulli Society for Mathematical Statistics and Probability, 2019, 25 (4A), pp.2649-2695. We are interested in the dynamic of a structured branching population where the trait of each individual moves according to a Markov process. The rate of division of each individual is a function of its trait and when a branching event occurs, the trait of the descendants at birth depends on the trait of the mother and on the number of descendants. In this article, we explicitly describe the penalized Markov process, named auxiliary process, corresponding to the dynamic of the trait along the spine by giving its associated infinitesimal generator. We prove a Many-to-One formula and a Many-to-One formula for forks. Furthermore, we prove that this auxiliary process characterizes exactly the process of the trait of a uniformly sampled individual in the large population approximation. We detail three examples of growth-fragmentation models: the linear growth model, the exponential growth model and the parasite infection model. (10.3150/18-BEJ1066)
  DOI : 10.3150/18-BEJ1066
• Morphological organization of point-to-point transport in complex networks
  
  • Kang Min-Yeong
  • Berthelot Geoffroy C.B.
  • Nicolaides Christos
  • Colonna Jean-François
  • Sapoval Bernard
  • Grebenkov Denis S
  • Tupikina Liubov
  Scientific Reports, Nature Publishing Group, 2019, 9, pp.8322. We investigate the structural organization of the point-to-point electric, diffusive or hydraulic transport in complex scale-free networks. the random choice of two nodes, a source and a drain, to which a potential difference is applied, selects two tree-like structures, one emerging from the source and the other converging to the drain. these trees merge into a large cluster of the remaining nodes that is found to be quasi-equipotential and thus presents almost no resistance to transport. such a global "tree-cluster-tree" structure is universal and leads to a power law decay of the currents distribution. Its exponent, −2, is determined by the multiplicative decrease of currents at successive branching points of a tree and is found to be independent of the network connectivity degree and resistance distribution. (10.1038/s41598-019-44701-6)
  DOI : 10.1038/s41598-019-44701-6
• Approximating the Volume of Tropical Polytopes is Difficult
  
  • Gaubert Stéphane
  • Maccaig Marie
  International Journal of Algebra and Computation, World Scientific Publishing, 2019, 29 (02), pp.357--389. We investigate the complexity of counting the number of integer points in tropical polytopes, and the complexity of calculating their volume. We study the tropical analogue of the outer parallel body and establish bounds for its volume. We deduce that there is no approximation algorithm of factor $\alpha=2^{\text{poly}(m,n)}$ for the volume of a tropical polytope given by $n$ vertices in a space of dimension $m$, unless P$=$NP. Neither is there such an approximation algorithm for counting the number of integer points in tropical polytopes described by vertices. If follows that approximating these values for tropical polytopes is more difficult than for classical polytopes. Our proofs use a reduction from the problem of calculating the tropical rank. For tropical polytopes described by inequalities we prove that counting the number of integer points and calculating the volume are $\#$P-hard. (10.1142/S0218196718500686)
  DOI : 10.1142/S0218196718500686
• Avis en réponse à la saisine HCB sur le dossier EFSA-GMO-ES-2018-154. Paris, le 5 avril 2019
  
  • Comité Scientifique Du Haut Conseil Des Biotechnologies .
  • Angevin Frédérique
  • Bagnis Claude
  • Bar-Hen Avner
  • Barny Marie-Anne
  • Boireau Pascal
  • Brévault Thierry
  • Chauvel Bruno B.
  • Collonnier Cécile
  • Couvet Denis
  • Dassa Elie
  • de Verneuil Hubert
  • Demeneix Barbara
  • Franche Claudine
  • Guerche Philippe
  • Guillemain Joël
  • Hernandez Raquet Guillermina
  • Khalife Jamal
  • Klonjkowski Bernard
  • Lavielle Marc
  • Le Corre Valérie
  • Lefèvre François
  • Lemaire Olivier
  • Lereclus Didier D.
  • Maximilien Rémy
  • Meurs Eliane
  • Naffakh Nadia
  • Négre Didier
  • Noyer Jean-Louis
  • Ochatt Sergio
  • Pages Jean-Christophe
  • Raynaud Xavier
  • Regnault-Roger Catherine
  • Renard Michel M.
  • Renault Tristan
  • Saindrenan Patrick
  • Simonet Pascal
  • Troadec Marie-Bérengère
  • Vaissière Bernard
  • Vilotte Jean-Luc
  , 2019, pp.14 p..
• Uniform propagation of chaos and creation of chaos for a class of nonlinear diffusions
  
  • del Moral Pierre
  • Tugaut Julian
  Stochastic Analysis and Applications, Taylor & Francis: STM, Behavioural Science and Public Health Titles, 2019, 37 (6), pp.909-935. We are interested in nonlinear diffusions in which the own law intervenes in the drift. This kind of diffusions corresponds to the hydrodynamical limit of some particle system. One also talks about propagation of chaos. It is well known, for McKean-Vlasov diffusions, that such a propagation of chaos holds on finite-time interval. We here aim to establish a uniform propagation of chaos even if the external force is not convex, with a diffusion coefficient sufficiently large. The idea consists in combining the propagation of chaos on a finite-time interval with a functional inequality, already used by Bolley, Gentil and Guillin. Here, we also deal with a case in which the system at time t = 0 is not chaotic and we show under easily checked assumptions that the system becomes chaotic as the number of particles goes to infinity together with the time. This yields the first result of this type for mean field particle diffusion models as far as we know. (10.1080/07362994.2019.1622426)
  DOI : 10.1080/07362994.2019.1622426
• A two-phase two-fluxes degenerate Cahn-Hilliard model as constrained Wasserstein gradient flow
  
  • Cancès Clément
  • Matthes Daniel
  • Nabet Flore
  Archive for Rational Mechanics and Analysis, Springer Verlag, 2019, 233 (2), pp.837–866. We study a non-local version of the Cahn-Hilliard dynamics for phase separation in a two-component incompressible and immiscible mixture with linear mobilities. In difference to the celebrated local model with nonlinear mobility, it is only assumed that the divergences of the two fluxes --- but not necessarily the fluxes themselves --- annihilate each other. Our main result is a rigorous proof of existence of weak solutions. The starting point is the formal representation of the dynamics as a constrained gradient flow in the Wasserstein metric. We then show that time-discrete approximations by means of the incremental minimizing movement scheme converge to a weak solution in the limit. Further, we compare the non-local model to the classical Cahn-Hilliard model in numerical experiments. Our results illustrate the significant speed-up in the decay of the free energy due to the higher degree of freedom for the velocity fields. (10.1007/s00205-019-01369-6)
  DOI : 10.1007/s00205-019-01369-6
• Analysis of Langevin Monte Carlo via convex optimization
  
  • Durmus Alain
  • Majewski Szymon
  • Miasojedow Błażej
  Journal of Machine Learning Research, Microtome Publishing, 2019. In this paper, we provide new insights on the Unadjusted Langevin Algorithm. We show that this method can be formulated as a first order optimization algorithm of an objective functional defined on the Wasserstein space of order $2$. Using this interpretation and techniques borrowed from convex optimization, we give a non-asymptotic analysis of this method to sample from logconcave smooth target distribution on $\mathbb{R}^d$. Based on this interpretation, we propose two new methods for sampling from a non-smooth target distribution, which we analyze as well. Besides, these new algorithms are natural extensions of the Stochastic Gradient Langevin Dynamics (SGLD) algorithm, which is a popular extension of the Unadjusted Langevin Algorithm. Similar to SGLD, they only rely on approximations of the gradient of the target log density and can be used for large-scale Bayesian inference.
• The Homogenization Method for Topology Optimization of Structures: Old and New
  
  • Allaire Grégoire
  • Cavallina Lorenzo
  • Miyake Nobuhito
  • Oka Tomoyuki
  • Yachimura Toshiaki
  Interdisciplinary Information Sciences, Editorial Committee of the Interdisciplinary Information Sciences, 2019, 25 (2), pp.75-146. (10.4036/iis.2019.B.01)
  DOI : 10.4036/iis.2019.B.01
• Kinetic model of adsorption on crystal surfaces
  
  • Aoki Kazuo
  • Giovangigli Vincent
  Physical Review E, American Physical Society (APS), 2019, 99. A kinetic theory model describing physisorption and chemisorption of gas particles on a crystal surface is introduced. A single kinetic equation is used to model gas and physisorbed particles interacting with a crystal potential and colliding with phonons. The phonons are assumed to be at equilibrium and the physisorbate-gas equation is coupled to similar kinetic equations describing chemisorbed particles and crystal atoms on the surface. A kinetic entropy is introduced for the coupled system and the H theorem is established. Using the Chapman-Enskog method with a fluid scaling, the asymptotic structure of the adsorbate is investigated and fluid boundary conditions are derived from the kinetic model. (10.1103/PhysRevE.99.052137)
  DOI : 10.1103/PhysRevE.99.052137