For a general class of linear collisional kinetic models in the torus, including in particular the linearized Boltzmann equation for hard spheres, the linearized Landau equation with hard and moderately soft potentials and the semi-classical linearized fermionic and bosonic relaxation models, we prove explicit coercivity estimates on the associated integro-differential operator for some modified Sobolev norms. We deduce existence of classical solutions near equilibrium for the full non-linear models associated, with explicit regularity bounds, and we obtain explicit estimates on the rate of exponential convergence towards equilibrium in this perturbative setting. The proof are based on a linear energy method which combines the coercivity property of the collision operator in the velocity space with transport effects, in order to deduce coercivity estimates in the whole phase space.
Cardiolipin (CL) is a phospholipid specific for mitochondrial membranes and crucial for many core tasks of this organelle. Its acyl chain configurations are tissue specific, functionally important, and generated via post-biosynthetic remodeling. However, this process lacks the necessary specificity to explain CL diversity, which is especially evident for highly specific CL compositions in mammalian tissues. To investigate the so far elusive regulatory origin of CL homeostasis in mice, we combine lipidomics, integrative transcriptomics, and data-driven machine learning. We demonstrate that not transcriptional regulation, but cellular phospholipid compositions are closely linked to the tissue specificity of CL patterns allowing artificial neural networks to precisely predict cross-tissue CL compositions in a consistent mechanistic specificity rationale. This is especially relevant for the interpretation of disease-related perturbations of CL homeostasis, by allowing differentiation between specific aberrations in CL metabolism and changes caused by global alterations in cellular (phospho-)lipid metabolism.
Block coordinate descent (BCD) methods approach optimization problems by performing gradient steps along alternating subgroups of coordinates. This is in contrast to full gradient descent, where a ...