Mathematik
Refine
Year of publication
Document Type
- Article (108) (remove)
Has Fulltext
- yes (108)
Is part of the Bibliography
- no (108)
Keywords
- Biographie (2)
- Brownian motion (2)
- Finanzmathematik (2)
- Frankfurt <Main> / Universität (2)
- Krein space (2)
- Mathematik (2)
- Mathematiker (2)
- Perception (2)
- Statistik (2)
- Stochastik (2)
Institute
- Mathematik (108) (remove)
Motivated by the question of the impact of selective advantage in populations with skewed reproduction mechanisms, we study a Moran model with selection. We assume that there are two types of individuals, where the reproductive success of one type is larger than the other. The higher reproductive success may stem from either more frequent reproduction, or from larger numbers of offspring, and is encoded in a measure Λ for each of the two types. Λ-reproduction here means that a whole fraction of the population is replaced at a reproductive event. Our approach consists of constructing a Λ-asymmetric Moran model in which individuals of the two populations compete, rather than considering a Moran model for each population. Provided the measure are ordered stochastically, we can couple them. This allows us to construct the central object of this paper, the Λ−asymmetric ancestral selection graph, leading to a pathwise duality of the forward in time Λ-asymmetric Moran model with its ancestral process. We apply the ancestral selection graph in order to obtain scaling limits of the forward and backward processes, and note that the frequency process converges to the solution of an SDE with discontinuous paths. Finally, we derive a Griffiths representation for the generator of the SDE and use it to find a semi-explicit formula for the probability of fixation of the less beneficial of the two types.
Highlights
• We study dormancy in the ‘rare mutation’ regime of stochastic adaptive dynamics.
• We first derive the polymorphic evolution sequence, based on prior work.
• Our evolutionary branching criterion extends a result by Champagnat and Méléard.
• In a classical model dormancy can favour evolutionary branching.
• Dormancy also affects several more population characteristics.
Abstract
In this paper, we investigate the consequences of dormancy in the ‘rare mutation’ and ‘large population’ regime of stochastic adaptive dynamics. Starting from an individual-based micro-model, we first derive the Polymorphic Evolution Sequence of the population, based on a previous work by Baar and Bovier (2018). After passing to a second ‘small mutations’ limit, we arrive at the Canonical Equation of Adaptive Dynamics, and state a corresponding criterion for evolutionary branching, extending a previous result of Champagnat and Méléard (2011).
The criterion allows a quantitative and qualitative analysis of the effects of dormancy in the well-known model of Dieckmann and Doebeli (1999) for sympatric speciation. In fact, quite an intuitive picture emerges: Dormancy enlarges the parameter range for evolutionary branching, increases the carrying capacity and niche width of the post-branching sub-populations, and, depending on the model parameters, can either increase or decrease the ‘speed of adaptation’ of populations. Finally, dormancy increases diversity by increasing the genetic distance between subpopulations.
For genus g=2i≥4 and the length g−1 partition μ=(4,2,…,2,−2,…,−2) of 0, we compute the first coefficients of the class of D¯¯¯¯(μ) in PicQ(R¯¯¯¯g), where D(μ) is the divisor consisting of pairs [C,η]∈Rg with η≅OC(2x1+x2+⋯+xi−1−xi−⋯−x2i−1) for some points x1,…,x2i−1 on C. We further provide several enumerative results that will be used for this computation.
For genus g=2i≥4 and the length g−1 partition μ=(4,2,…,2,−2,…,−2) of 0, we compute the first coefficients of the class of D¯¯¯¯(μ) in PicQ(R¯¯¯¯g), where D(μ) is the divisor consisting of pairs [C,η]∈Rg with η≅OC(2x1+x2+⋯+xi−1−xi−⋯−x2i−1) for some points x1,…,x2i−1 on C. We further provide several enumerative results that will be used for this computation.
Affine Bruhat--Tits buildings are geometric spaces extracting the combinatorics of algebraic groups. The building of PGL parametrizes flags of subspaces/lattices in or, equivalently, norms on a fixed finite-dimensional vector space, up to homothety. It has first been studied by Goldman and Iwahori as a piecewise-linear analogue of symmetric spaces. The space of seminorms compactifies the space of norms and admits a natural surjective restriction map from the Berkovich analytification of projective space that factors the natural tropicalization map. Inspired by Payne's result that the analytification is the limit of all tropicalizations, we show that the space of seminorms is the limit of all tropicalized linear embeddings ι:Pr↪Pn and prove a faithful tropicalization result for compactified linear spaces. The space of seminorms is in fact the tropical linear space associated to the universal realizable valuated matroid.
We use recent results by Bainbridge–Chen–Gendron–Grushevsky–Möller on compactifications of strata of abelian differentials to give a comprehensive solution to the realizability problem for effective tropical canonical divisors in equicharacteristic zero. Given a pair (Γ,D) consisting of a stable tropical curve Γ and a divisor D in the canonical linear system on Γ, we give a purely combinatorial condition to decide whether there is a smooth curve X over a non-Archimedean field whose stable reduction has Γ as its dual tropical curve together with an effective canonical divisor KX that specializes to D.
We show that the non-Archimedean skeleton of the d-th symmetric power of a smooth projective algebraic curve X is naturally isomorphic to the d-th symmetric power of the tropical curve that arises as the non-Archimedean skeleton of X. The retraction to the skeleton is precisely the specialization map for divisors. Moreover, we show that the process of tropicalization naturally commutes with the diagonal morphisms and the Abel-Jacobi map and we exhibit a faithful tropicalization for symmetric powers of curves. Finally, we prove a version of the Bieri-Groves Theorem that allows us, under certain tropical genericity assumptions, to deduce a new tropical Riemann-Roch-Theorem for the tropicalization of linear systems.
In 1999, Merino and Welsh conjectured that evaluations of the Tutte polynomial of a graph satisfy an inequality. In this short article, we show that the conjecture generalized to matroids holds for the large class of all split matroids by exploiting the structure of their lattice of cyclic flats. This class of matroids strictly contains all paving and copaving matroids.
We present a massively parallel framework for computing tropicalizations of algebraic varieties which can make use of symmetries using the workflow management system GPI-Space and the computer algebra system Singular. We determine the tropical Grassmannian TGr0(3,8). Our implementation works efficiently on up to 840 cores, computing the 14763 orbits of maximal cones under the canonical S8-action in about 20 minutes. Relying on our result, we show that the Gröbner structure of TGr0(3,8) refines the 16-dimensional skeleton of the coarsest fan structure of the Dressian Dr(3,8), except for 23 orbits of special cones, for which we construct explicit obstructions to the realizability of their tropical linear spaces. Moreover, we propose algorithms for identifying maximal-dimensional cones which belong to positive tropicalizations of algebraic varieties. We compute the positive Grassmannian TGr+(3,8) and compare it to the cluster complex of the classical Grassmannian Gr(3,8).
Thought structures of modelling task solutions and their connection to the level of difficulty
(2015)
Although efforts have been made to integrate the concept of mathematical modelling in school, among others PISA and TIMSS revealed weaknesses of not only German students in the field of mathematical modelling. There may be various reasons starting from educational policy via curricular issues to practical instructional concerns. Studies show that mathematical modelling has not been arrived yet in everyday school class (Blum &BorromeoFerri, 2009, p. 47). Thus, the proportion of mathematical modelling in everyday school classes is low (Jordan et al., 2006). When focusing on the teachers’ point of view there are difficulties which may contribute to avoid modelling tasks in class. The development of reasonable modelling tasks, estimating the task space, valuating the task difficulty and assessing the student solutions are difficulties which occur to an increasing degree compared to ordinary mathematics tasks.The project MokiMaS (transl.: modeling competency in math classes of secondary education) aims at providing inter-year modelling tasks, whose task space and level of difficulty is known, together with an evaluation scheme. In particular a theory based method has been developed to determine the level of difficulty of modelling tasks on the basis of thought structures, representing the cognitive load of solution approaches. The current question is whether this method leads to a realistic rating. To go further into that question an evaluation scheme has been developed which is guided by the daily assessment work of teachers, to investigate the relation of task difficulty and student performance.
Mathematical arguments are central components of mathematics and play a role in certain types of modelling of potential mathematical giftedness. However, particular characteristics of arguments are interpreted differently in the context of mathematical giftedness. Some models of giftedness see no connection, whereas other models consider the formulation of complete and plausible arguments as a partial aspect of giftedness. Furthermore, longitudinal changes in argumentation characteristics remain open. This leads to the research focus of this article, which is to identify and describe the changes of argumentation products in potentially mathematically gifted children over a longer period. For this purpose, the argumentation products of children from third to sixth grade are collected throughout a longitudinal study and examined with respect to the use of examples and generalizations. The analysis of all products results in six different types of changes in the characteristics of the argumentation products identified over the survey period and case studies are used to illustrate student use of examples and generalizations of these types. This not only reveals the general importance of the use of examples in arguments. For one type, an increase in generalized arguments can be observed over the survey period. The article will conclude with a discussion of the role of argument characteristics in describing potential mathematical giftedness.
We deal with the shape reconstruction of inclusions in elastic bodies. For solving this inverse problem in practice, data fitting functionals are used. Those work better than the rigorous monotonicity methods from Eberle and Harrach (Inverse Probl 37(4):045006, 2021), but have no rigorously proven convergence theory. Therefore we show how the monotonicity methods can be converted into a regularization method for a data-fitting functional without losing the convergence properties of the monotonicity methods. This is a great advantage and a significant improvement over standard regularization techniques. In more detail, we introduce constraints on the minimization problem of the residual based on the monotonicity methods and prove the existence and uniqueness of a minimizer as well as the convergence of the method for noisy data. In addition, we compare numerical reconstructions of inclusions based on the monotonicity-based regularization with a standard approach (one-step linearization with Tikhonov-like regularization), which also shows the robustness of our method regarding noise in practice.
Uniqueness and Lipschitz stability in electrical impedance tomography with finitely many electrodes
(2019)
For the linearized reconstruction problem in electrical impedance tomography with the complete electrode model, Lechleiter and Rieder (2008 Inverse Problems 24 065009) have shown that a piecewise polynomial conductivity on a fixed partition is uniquely determined if enough electrodes are being used. We extend their result to the full non-linear case and show that measurements on a sufficiently high number of electrodes uniquely determine a conductivity in any finite-dimensional subset of piecewise-analytic functions. We also prove Lipschitz stability, and derive analogue results for the continuum model, where finitely many measurements determine a finite-dimensional Galerkin projection of the Neumann-to-Dirichlet operator on a boundary part.
In this short note, we investigate simultaneous recovery inverse problems for semilinear elliptic equations with partial data. The main technique is based on higher order linearization and monotonicity approaches. With these methods at hand, we can determine the diffusion, cavity and coefficients simultaneously by knowing the corresponding localized Dirichlet-Neumann operators.
We derive a simple criterion that ensures uniqueness, Lipschitz stability and global convergence of Newton’s method for the finite dimensional zero-finding problem of a continuously differentiable, pointwise convex and monotonic function. Our criterion merely requires to evaluate the directional derivative of the forward function at finitely many evaluation points and for finitely many directions. We then demonstrate that this result can be used to prove uniqueness, stability and global convergence for an inverse coefficient problem with finitely many measurements. We consider the problem of determining an unknown inverse Robin transmission coefficient in an elliptic PDE. Using a relation to monotonicity and localized potentials techniques, we show that a piecewise-constant coefficient on an a-priori known partition with a-priori known bounds is uniquely determined by finitely many boundary measurements and that it can be uniquely and stably reconstructed by a globally convergent Newton iteration. We derive a constructive method to identify these boundary measurements, calculate the stability constant and give a numerical example.
Several novel imaging and non-destructive testing technologies are based on reconstructing the spatially dependent coefficient in an elliptic partial differential equation from measurements of its solution(s). In practical applications, the unknown coefficient is often assumed to be piecewise constant on a given pixel partition (corresponding to the desired resolution), and only finitely many measurement can be made. This leads to the problem of inverting a finite-dimensional non-linear forward operator F: D(F)⊆Rn→Rm , where evaluating ℱ requires one or several PDE solutions.
Numerical inversion methods require the implementation of this forward operator and its Jacobian. We show how to efficiently implement both using a standard FEM package and prove convergence of the FEM approximations against their true-solution counterparts. We present simple example codes for Comsol with the Matlab Livelink package, and numerically demonstrate the challenges that arise from non-uniqueness, non-linearity and instability issues. We also discuss monotonicity and convexity properties of the forward operator that arise for symmetric measurement settings.
This text assumes the reader to have a basic knowledge on Finite Element Methods, including the variational formulation of elliptic PDEs, the Lax-Milgram-theorem, and the Céa-Lemma. Section 3 also assumes that the reader is familiar with the concept of Fréchet differentiability.
We show that the metrisability of an oriented projective surface is equivalent to the existence of pseudo-holomorphic curves. A projective structure p and a volume form σ on an oriented surface M equip the total space of a certain disk bundle Z→M with a pair (Jp,Jp,σ) of almost complex structures. A conformal structure on M corresponds to a section of Z→M and p is metrisable by the metric g if and only if [g]:M→Z is a pseudo-holomorphic curve with respect to Jp and Jp,dAg.
In this article we use techniques from tropical and logarithmic geometry to construct a non-Archimedean analogue of Teichmüller space T¯g whose points are pairs consisting of a stable projective curve over a non-Archimedean field and a Teichmüller marking of the topological fundamental group of its Berkovich analytification. This construction is closely related to and inspired by the classical construction of a non-Archimedean Schottky space for Mumford curves by Gerritzen and Herrlich. We argue that the skeleton of non-Archimedean Teichmüller space is precisely the tropical Teichmüller space introduced by Chan–Melo–Viviani as a simplicial completion of Culler–Vogtmann Outer space. As a consequence, Outer space turns out to be a strong deformation retract of the locus of smooth Mumford curves in T¯g.
We study the asymptotics of Dirichlet eigenvalues and eigenfunctions of the fractional Laplacian (−Δ)s in bounded open Lipschitz sets in the small order limit s→0+. While it is easy to see that all eigenvalues converge to 1 as s→0+, we show that the first order correction in these asymptotics is given by the eigenvalues of the logarithmic Laplacian operator, i.e., the singular integral operator with Fourier symbol 2log|ξ|. By this we generalize a result of Chen and the third author which was restricted to the principal eigenvalue. Moreover, we show that L2-normalized Dirichlet eigenfunctions of (−Δ)s corresponding to the k-th eigenvalue are uniformly bounded and converge to the set of L2-normalized eigenfunctions of the logarithmic Laplacian. In order to derive these spectral asymptotics, we establish new uniform regularity and boundary decay estimates for Dirichlet eigenfunctions for the fractional Laplacian. As a byproduct, we also obtain corresponding regularity properties of eigenfunctions of the logarithmic Laplacian.
In the model of randomly perturbed graphs we consider the union of a deterministic graph G with minimum degree αn and the binomial random graph G(n, p). This model was introduced by Bohman, Frieze, and Martin and for Hamilton cycles their result bridges the gap between Dirac’s theorem and the results by Pósa and Korshunov on the threshold in G(n, p). In this note we extend this result in G ∪G(n, p) to sparser graphs with α = o(1). More precisely, for any ε > 0 and α: N ↦→ (0, 1) we show that a.a.s. G ∪ G(n, β/n) is Hamiltonian, where β = −(6 + ε) log(α). If α > 0 is a fixed constant this gives the aforementioned result by Bohman, Frieze, and Martin and if α = O(1/n) the random part G(n, p) is sufficient for a Hamilton cycle. We also discuss embeddings of bounded degree trees and other spanning structures in this model, which lead to interesting questions on almost spanning embeddings into G(n, p).