arXiv subjects

Stefan Müller

Publications and source records attributed to Stefan Müller.

At least 37 records · Page 2Linked to original sources

arXiv2022

Scaling of the elastic energy of small balls for maps between manifolds with different curvature tensors

Motivated by experiments and formal asymptotic expansions in the physics literature, Maor and Shachar (J. Elasticity 134 (2019), 149-173) studied the behaviour of a model elastic energy of maps between manifolds with incompatible metrics. For thin objects they analysed the scaling of the minimal elastic energy as a function of the thickness. In particular they showed that for maps from a ball of radius h in an oriented Riemannian manifold to Euclidean space, the infimum of a model elastic energy per unit volume scales like the fourth power of h and after rescaling one gets convergence to a quadratic expression in the curvature tensor R(p), where p denotes the centre of the ball. In this paper we show the same result for general compact oriented Riemannian targets with R(p) replaced by a suitable difference of the curvature tensors in the target and the domain, thus answering Open Question 1 in the paper by Maor and Shachar. The result extends noncompact targets provided they satisfy a uniform regularity condition. A key idea in the proof is to use Lipschitz approximations to define a suitable notion of convergence.

math.AP↗

arXiv2022

Journal Impact Factor and Peer Review Thoroughness and Helpfulness: A Supervised Machine Learning Study

The journal impact factor (JIF) is often equated with journal quality and the quality of the peer review of the papers submitted to the journal. We examined the association between the content of peer review and JIF by analysing 10,000 peer review reports submitted to 1,644 medical and life sciences journals. Two researchers hand-coded a random sample of 2,000 sentences. We then trained machine learning models to classify all 187,240 sentences as contributing or not contributing to content categories. We examined the association between ten groups of journals defined by JIF deciles and the content of peer reviews using linear mixed-effects models, adjusting for the length of the review. The JIF ranged from 0.21 to 74.70. The length of peer reviews increased from the lowest (median number of words 185) to the JIF group (387 words). The proportion of sentences allocated to different content categories varied widely, even within JIF groups. For thoroughness, sentences on 'Materials and Methods' were more common in the highest JIF journals than in the lowest JIF group (difference of 7.8 percentage points; 95% CI 4.9 to 10.7%). The trend for 'Presentation and Reporting' went in the opposite direction, with the highest JIF journals giving less emphasis to such content (difference -8.9%; 95% CI -11.3 to -6.5%). For helpfulness, reviews for higher JIF journals devoted less attention to 'Suggestion and Solution' and provided fewer Examples than lower impact factor journals. No, or only small differences were evident for other content categories. In conclusion, peer review in journals with higher JIF tends to be more thorough in discussing the methods used but less helpful in terms of suggesting solutions and providing examples. Differences were modest and variability high, indicating that the JIF is a bad predictor for the quality of peer review of an individual manuscript.

cs.DL↗

arXiv2022

What makes a reaction network "chemical"?

Reaction networks (RNs) comprise a set $X$ of species and a set $\mathscr{R}$ of reactions $Y\to Y'$, each converting a multiset of educts $Y\subseteq X$ into a multiset $Y'\subseteq X$ of products. RNs are equivalent to directed hypergraphs. However, not all RNs necessarily admit a chemical interpretation. Instead, they might contradict fundamental principles of physics such as the conservation of energy and mass or the reversibility of chemical reactions. The consequences of these necessary conditions for the stoichiometric matrix $\mathbf{S} \in \mathbb{R}^{X\times\mathscr{R}}$ have been discussed extensively in the literature. Here, we provide sufficient conditions for $\mathbf{S}$ that guarantee the interpretation of RNs in terms of balanced sum formulas and structural formulas, respectively. Chemically plausible RNs allow neither a perpetuum mobile, i.e., a "futile cycle" of reactions with non-vanishing energy production, nor the creation or annihilation of mass. Such RNs are said to be thermodynamically sound and conservative. For finite RNs, both conditions can be expressed equivalently as properties of $\mathbf{S}$. The first condition is vacuous for reversible networks, but it excludes irreversible futile cycles and - in a stricter sense - futile cycles that even contain an irreversible reaction. The second condition is equivalent to the existence of a strictly positive reaction invariant. Furthermore, it is sufficient for the existence of a realization in terms of sum formulas, obeying conservation of "atoms". In particular, these realizations can be chosen such that any two species have distinct sum formulas, unless $\mathbf{S}$ implies that they are "obligatory isomers". In terms of structural formulas, every compound is a labeled multigraph, in essence a Lewis formula, and reactions comprise only a rearrangement of bonds such that the total bond order is preserved.

q-bio.MN↗

arXiv2021

Korn inequalities for incompatible tensor fields in three space dimensions with conformally invariant dislocation energy

Let $Ω\subset \mathbb{R}^3$ be an open and bounded set with Lipschitz boundary and outward unit normal $ν$. For $1 1 \quad \text{if $p = \frac32$.}$$ Specifically, there exists a constant $c=c(p,Ω,r)>0$ such that the inequality \[ \|P \|_{L^p}\leq c\,\left(\|\operatorname{sym} P \|_{L^p} + \|\operatorname{dev}\operatorname{sym} \operatorname{Curl} P \|_{L^{r}}\right) \] holds for all tensor fields $P\in W^{1,\,p, \, r}_0(\operatorname{dev}\operatorname{sym}\operatorname{Curl})$. Here, $\operatorname{dev} X := X -\frac13 \operatorname{tr}(X)\,\mathbb{1}$ denotes the deviatoric (trace-free) part of a $3 \times 3$ matrix $X$ and the boundary condition is understood in a suitable weak sense.

math.AP↗

arXiv2021

Domain Adaptation with Joint Learning for Generic, Optical Car Part Recognition and Detection Systems (Go-CaRD)

Systems for the automatic recognition and detection of automotive parts are crucial in several emerging research areas in the development of intelligent vehicles. They enable, for example, the detection and modelling of interactions between human and the vehicle. In this paper, we quantitatively and qualitatively explore the efficacy of deep learning architectures for the classification and localisation of 29 interior and exterior vehicle regions on three novel datasets. Furthermore, we experiment with joint and transfer learning approaches across datasets and point out potential applications of our systems. Our best network architecture achieves an F1 score of 93.67 % for recognition, while our best localisation approach utilising state-of-the-art backbone networks achieve a mAP of 63.01 % for detection. The MuSe-CAR-Part dataset, which is based on a large variety of human-car interactions in videos, the weights of the best models, and the code is publicly available to academic parties for benchmarking and future research.

cs.CV↗

arXiv2020

Detailed balance = complex balance + cycle balance. A graph-theoretic proof for reaction networks and Markov chains

We further clarify the relation between detailed-balanced and complex-balanced equilibria of reversible chemical reaction networks. Our results hold for arbitrary kinetics and also for boundary equilibria. Detailed balance, complex balance, "formal balance", and the new notion of "cycle balance" are all defined in terms of the underlying graph. This fact allows elementary graph-theoretic (non-algebraic) proofs of a previous result (detailed balance = complex balance + formal balance), our main result (detailed balance = complex balance + cycle balance), and a corresponding result in the setting of continuous-time Markov chains.

math.DS↗

arXiv2020

Data-Driven Finite Elasticity

We extend to finite elasticity the Data-Driven formulation of geometrically linear elasticity presented in Conti, Müller, Ortiz, Arch.\ Ration.\ Mech.\ Anal.\ 229, 79-123, 2018. The main focus of this paper concerns the formulation of a suitable framework in which the Data-Driven problem of finite elasticity is well-posed in the sense of existence of solutions. We confine attention to deformation gradients $F \in L^p(Ω;\mathbb{R}^{n\times n})$ and first Piola-Kirchhoff stresses $P \in L^q(Ω;\mathbb{R}^{n\times n})$, with $(p,q)\in(1,\infty)$ and $1/p+1/q=1$. We assume that the material behavior is described by means of a material data set containing all the states $(F,P)$ that can be attained by the material, and develop germane notions of coercivity and closedness of the material data set. Within this framework, we put forth conditions ensuring the existence of solutions. We exhibit specific examples of two- and three-dimensional material data sets that fit the present setting and are compatible with material frame indifference.

math.AP↗

arXiv2019

Local strong solutions to a quasilinear degenerate fourth-order thin-film equation

We study the problem of existence and uniqueness of strong solutions to a degenerate quasilinear parabolic non-Newtonian thin-film equation. Originating from a non-Newtonian Navier--Stokes system the equation is derived by lubrication theory and under the assumption that capillarity is the only driving force. The fluid's shear-thinning rheology is described by the so-called Ellis constitutive law. For flow behaviour exponents $α\geq 2$ the corresponding initial boundary value problem fits into the abstract setting of [4,Thm. 12.1]. Due to a lack of regularity this is not true for flow behaviour exponents $α\in (1,2)$. For this reason we prove an existence theorem for abstract quasilinear parabolic evolution problems with Hölder continuous dependence. This result provides existence of strong solutions to the non-Newtonian thin-film problem in the setting of fractional Sobolev spaces and (little) Hölder spaces. Uniqueness of strong solutions is derived by energy methods and by using the particular structure of the equation.

math.AP↗

arXiv2019

Symmetric div-quasiconvexity and the relaxation of static problems

We consider problems of static equilibrium in which the primary unknown is the stress field and the solutions maximize a complementary energy subject to equilibrium constraints. A necessary and sufficient condition for the sequential lower-semicontinuity of such functionals is symmetric ${\rm div}$-quasiconvexity, a special case of Fonseca and Müller's $A$-quasiconvexity with $A = {\rm div}$ acting on $R^{n\times n}_{sym}$. We specifically consider the example of the static problem of plastic limit analysis and seek to characterize its relaxation in the non-standard case of a non-convex elastic domain. We show that the symmetric ${\rm div}$-quasiconvex envelope of the elastic domain can be characterized explicitly for isotropic materials whose elastic domain depends on pressure $p$ and Mises effective shear stress $q$. The envelope then follows from a rank-$2$ hull construction in the $(p,q)$-plane. Remarkably, owing to the equilibrium constraint the relaxed elastic domain can still be strongly non-convex, which shows that convexity of the elastic domain is not a requirement for existence in plasticity.

math.AP↗

arXiv2019

Complex-balanced equilibria of generalized mass-action systems: Necessary conditions for linear stability

It is well known that, for mass-action systems, complex-balanced equilibria are asymptotically stable. For generalized mass-action systems, even if there exists a unique complex-balanced equilibrium (in every stoichiometric class and for all rate constants), it need not be stable. We first discuss several notions of matrix stability (on a linear subspace) such as D-stability and diagonal stability, and then we apply our abstract results to complex-balanced equilibria of generalized mass-action systems. In particular, we show that linear stability (on the stoichiometric subspace and for all rate constants) implies uniqueness. For cyclic networks, we characterize linear stability (in terms of D-stability of the Jacobian matrix); and for weakly reversible networks, we give necessary conditions for linear stability (in terms of D-semistability of the Jacobian matrices of all cycles in the network). Moreover, we show that, for classical mass-action systems, complex-balanced equilibria are not just asymptotically stable, but even diagonally stable (and hence linearly stable). Finally, we recall and extend characterizations of D-stability and diagonal stability for matrices of dimension up to three, and we illustrate our results by examples of irreversible cycles (of dimension up to three) and of reversible chains and S-systems (of arbitrary dimension).

math.DS↗

arXiv2019

On the bijectivity of families of exponential/generalized polynomial maps

We start from a parametrized system of $d$ generalized polynomial equations (with real exponents) for $d$ positive variables, involving $n$ generalized monomials with $n$ positive parameters. Existence and uniqueness of a solution for all parameters and for all right-hand sides is equivalent to the bijectivity of (every element of) a family of generalized polynomial/exponential maps. We characterize the bijectivity of the family of exponential maps in terms of two linear subspaces arising from the coefficient and exponent matrices, respectively. In particular, we obtain conditions in terms of sign vectors of the two subspaces and a nondegeneracy condition involving the exponent subspace itself. Thereby, all criteria can be checked effectively. Moreover, we characterize when the existence of a unique solution is robust with respect to small perturbations of the exponents or/and the coefficients. In particular, we obtain conditions in terms of sign vectors of the linear subspaces or, alternatively, in terms of maximal minors of the coefficient and exponent matrices. Finally, we present applications to chemical reaction networks with (generalized) mass-action kinetics.

math.AG↗

arXiv2019

Optimal order finite difference approximation of generalized solutions to the biharmonic equation in a cube

We prove an optimal order error bound in the discrete $H^2(Ω)$ norm for finite difference approximations of the first boundary-value problem for the biharmonic equation in $n$ space dimensions, with $n \in \{2,\dots,7\}$, whose generalized solution belongs to the Sobolev space $H^s(Ω) \cap H^2_0(Ω)$, for $\frac{1}{2} \max(5,n) < s \leq 4$, where $Ω= (0,1)^n$. The result extends the range of the Sobolev index $s$ in the best convergence results currently available in the literature to the maximal range admitted by the Sobolev embedding of $H^s(Ω)$ into $C(\overlineΩ)$ in $n$ space dimensions.

math.NA↗

arXiv2019

Characterizing injectivity of classes of maps via classes of matrices

We present a framework for characterizing injectivity of classes of maps (on cosets of a linear subspace) by injectivity of classes of matrices. Using our formalism, we characterize injectivity of several classes of maps, including generalized monomial and monotonic (not necessarily continuous) maps. In fact, monotonic maps are special cases of {\em component-wise affine} maps. Further, we study compositions of maps with a matrix and other composed maps, in particular, rational functions. Our framework covers classical injectivity criteria based on mean value theorems for vector-valued maps and recent results obtained in the study of chemical reaction networks.

math.AG↗

arXiv2018

A deficiency-based approach to parametrizing positive equilibria of biochemical reaction systems

We present conditions which guarantee a parametrization of the set of positive equilibria of a generalized mass-action system. Our main results state that (i) if the underlying generalized chemical reaction network has an effective deficiency of zero, then the set of positive equilibria coincides with the parametrized set of complex-balanced equilibria and (ii) if the network is weakly reversible and has a kinetic deficiency of zero, then the equilibrium set is nonempty and has a positive, typically rational, parametrization. Via the method of network translation, we apply our results to classical mass-action systems studied in the biochemical literature, including the EnvZ-OmpR and shuttled WNT signaling pathways. A parametrization of the set of positive equilibria of a (generalized) mass-action system is often a prerequisite for the study of multistationarity and allows an easy check for the occurrence of absolute concentration robustness (ACR), as we demonstrate for the EnvZ-OmpR pathway.

math.DS↗

arXiv2018

Planar S-systems: Global stability and the center problem

S-systems are simple examples of power-law dynamical systems (polynomial systems with real exponents). For planar S-systems, we study global stability of the unique positive equilibrium and solve the center problem. Further, we construct a planar S-system with two limit cycles.

math.DS↗

arXiv2018

Epsilon-non-squeezing and $C^0$-rigidity of epsilon-symplectic embeddings

An embedding $φ\colon (M_1, ω_1) \to (M_2, ω_2)$ (of symplectic manifolds of the same dimension) is called $ε$-symplectic if the difference $φ^* ω_2 - ω_1$ is $ε$-small with respect to a fixed Riemannian metric on $M_1$. We prove that if a sequence of $ε$-symplectic embeddings converges uniformly (on compact subsets) to another embedding, then the limit is $E$-symplectic, where the number $E$ depends only on $ε$ and $E (ε) \to 0$ as $ε\to 0$. This generalizes $C^0$-rigidity of symplectic embeddings, and answers a question in topological quantum computing by Michael Freedman. As in the symplectic case, this rigidity theorem can be deduced from the existence and properties of symplectic capacities. An $ε$-symplectic embedding preserves capacity up to an $ε$-small error, and linear $ε$-symplectic maps can be characterized by the property that they preserve the symplectic spectrum of ellipsoids (centered at the origin) up to an error that is $ε$-small. We sketch an alternative proof using the shape invariant, which gives rise to an analogous characterization and rigidity theorem for $ε$-contact embeddings.

math.SG↗

arXiv2017

Estimates for the Green's function of the discrete bilaplacian in dimensions 2 and 3

We prove estimates for the Green's function of the discrete bilaplacian in squares and cubes in two and three dimensions which are optimal except possibly near the corners of the square and the edges and corners of the cube. The main idea is to transfer estimates for the continuous bilaplacian using a new discrete compactness argument and a discrete version of the Cacciopoli (or reverse Poincaré) inequality. One application that we have in mind is the study of entropic repulsion for the membrane model from statistical physics.

math-ph↗

arXiv2017

A computational study of hafnia-based ferroelectric memories: from ab initio via physical modeling to circuit models of ferroelectric device

The discovery of ferroelectric properties of binary oxides revitalized the interest in ferroelectrics and bridged the scaling gap between the state-of-the-art semiconductor technology and ferroelectric memories. However, before hitting the markets, the origin of ferroelectricity and in-depth studies of device characteristics are needed. Establishing a correlation between the performance of the device and underlying physical mechanisms is the first step toward understanding the device and engineering guidelines for a novel, superior device. Therefore, in this paper a holistic modeling approaches which lead to a better understanding of ferroelectric memories based on hafnium and zirconium oxide is addressed. Starting from describing the stabilization of the ferroelectric phase within the binary oxides via physical modeling the physical mechanisms of the ferroelectric devices are reviewed. Besides, limitations and modeling of the multilevel operation and switching kinetics of ultimately scaled devices as well as the necessity for Landau-Khalatnikov approach are discussed. Furthermore, a device-level model of ferroelectric memory devices that can be used to study the array implementation and their operational schemes are addressed. Finally, a circuit model of the ferroelectric memory device is presented and potential further applications of ferroelectric devices are outlined.

cond-mat.mtrl-sci↗