510 Mathematik
Refine
Year of publication
Document Type
- Article (263)
- Preprint (93)
- Doctoral Thesis (76)
- Postprint (29)
- Monograph/Edited Volume (10)
- Other (10)
- Master's Thesis (7)
- Conference Proceeding (6)
- Part of a Book (5)
- Review (3)
Is part of the Bibliography
- yes (506) (remove)
Keywords
- Bayesian inference (8)
- data assimilation (8)
- regularization (8)
- Navier-Stokes equations (7)
- Dirac operator (6)
- cluster expansion (6)
- discrepancy principle (6)
- ensemble Kalman filter (6)
- index (6)
- Cauchy problem (5)
Institute
- Institut für Mathematik (440)
- Institut für Physik und Astronomie (15)
- Mathematisch-Naturwissenschaftliche Fakultät (14)
- Extern (9)
- Hasso-Plattner-Institut für Digital Engineering gGmbH (7)
- Institut für Biochemie und Biologie (6)
- Institut für Informatik und Computational Science (5)
- Department Psychologie (4)
- Hasso-Plattner-Institut für Digital Engineering GmbH (4)
- Department Grundschulpädagogik (3)
- Institut für Philosophie (3)
- Strukturbereich Kognitionswissenschaften (3)
- Historisches Institut (2)
- Institut für Geowissenschaften (2)
- Präsident | Vizepräsidenten (2)
- Fachgruppe Politik- & Verwaltungswissenschaft (1)
- Fachgruppe Volkswirtschaftslehre (1)
- Institut für Slavistik (1)
- Interdisziplinäres Zentrum für Dynamik komplexer Systeme (1)
- Juristische Fakultät (1)
- Wirtschaftswissenschaften (1)
We study the asymptotics of solutions to the Dirichlet problem in a domain X subset of R3 whose boundary contains a singular point O. In a small neighborhood of this point, the domain has the form {z > root x(2) + y(4)}, i.e., the origin is a nonsymmetric conical point at the boundary. So far, the behavior of solutions to elliptic boundary-value problems has not been studied sufficiently in the case of nonsymmetric singular points. This problem was posed by V.A. Kondrat'ev in 2000. We establish a complete asymptotic expansion of solutions near the singular point.
Matching dependencies (MDs) are data profiling results that are often used for data integration, data cleaning, and entity matching. They are a generalization of functional dependencies (FDs) matching similar rather than same elements. As their discovery is very difficult, existing profiling algorithms find either only small subsets of all MDs or their scope is limited to only small datasets.
We focus on the efficient discovery of all interesting MDs in real-world datasets. For this purpose, we propose HyMD, a novel MD discovery algorithm that finds all minimal, non-trivial MDs within given similarity boundaries. The algorithm extracts the exact similarity thresholds for the individual MDs from the data instead of using predefined similarity thresholds. For this reason, it is the first approach to solve the MD discovery problem in an exact and truly complete way. If needed, the algorithm can, however, enforce certain properties on the reported MDs, such as disjointness and minimum support, to focus the discovery on such results that are actually required by downstream use cases. HyMD is technically a hybrid approach that combines the two most popular dependency discovery strategies in related work: lattice traversal and inference from record pairs. Despite the additional effort of finding exact similarity thresholds for all MD candidates, the algorithm is still able to efficiently process large datasets, e.g., datasets larger than 3 GB.
Partial clones
(2020)
A set C of operations defined on a nonempty set A is said to be a clone if C is closed under composition of operations and contains all projection mappings. The concept of a clone belongs to the algebraic main concepts and has important applications in Computer Science. A clone can also be regarded as a many-sorted algebra where the sorts are the n-ary operations defined on set A for all natural numbers n >= 1 and the operations are the so-called superposition operations S-m(n) for natural numbers m, n >= 1 and the projection operations as nullary operations. Clones generalize monoids of transformations defined on set A and satisfy three clone axioms. The most important axiom is the superassociative law, a generalization of the associative law. If the superposition operations are partial, i.e. not everywhere defined, instead of the many-sorted clone algebra, one obtains partial many-sorted algebras, the partial clones. Linear terms, linear tree languages or linear formulas form partial clones. In this paper, we give a survey on partial clones and their properties.
Synthetic Aperture Radar (SAR) amplitude measurements from spaceborne sensors are sensitive to surface roughness conditions near their radar wavelength. These backscatter signals are often exploited to assess the roughness of plowed agricultural fields and water surfaces, and less so to complex, heterogeneous geological surfaces. The bedload of mixed sand- and gravel-bed rivers can be considered a mixture of smooth (compacted sand) and rough (gravel) surfaces. Here, we assess backscatter gradients over a large high-mountain alluvial river in the eastern Central Andes with aerially exposed sand and gravel bedload using X-band TerraSAR-X/TanDEM-X, C-band Sentinel-1, and L-band ALOS-2 PALSAR-2 radar scenes. In a first step, we present theory and hypotheses regarding radar response to an alluvial channel bed. We test our hypotheses by comparing backscatter responses over vegetation-free endmember surfaces from inside and outside of the active channel-bed area. We then develop methods to extract smoothed backscatter gradients downstream along the channel using kernel density estimates. In a final step, the local variability of sand-dominated patches is analyzed using Fourier frequency analysis, by fitting stretched-exponential and power-law regression models to the 2-D power spectrum of backscatter amplitude. We find a large range in backscatter depending on the heterogeneity of contiguous smooth- and rough-patches of bedload material. The SAR amplitude signal responds primarily to the fraction of smooth-sand bedload, but is further modified by gravel elements. The sensitivity to gravel is more apparent in longer wavelength L-band radar, whereas C- and X-band is sensitive only to sand variability. Because the spatial extent of smooth sand patches in our study area is typically< 50 m, only higher resolution sensors (e.g., TerraSAR-X/TanDEM-X) are useful for power spectrum analysis. Our results show the potential for mapping sand-gravel transitions and local geomorphic complexity in alluvial rivers with aerially exposed bedload using SAR amplitude.
Sequential data assimilation of the stochastic SEIR epidemic model for regional COVID-19 dynamics
(2021)
Newly emerging pandemics like COVID-19 call for predictive models to implement precisely tuned responses to limit their deep impact on society. Standard epidemic models provide a theoretically well-founded dynamical description of disease incidence. For COVID-19 with infectiousness peaking before and at symptom onset, the SEIR model explains the hidden build-up of exposed individuals which creates challenges for containment strategies. However, spatial heterogeneity raises questions about the adequacy of modeling epidemic outbreaks on the level of a whole country. Here, we show that by applying sequential data assimilation to the stochastic SEIR epidemic model, we can capture the dynamic behavior of outbreaks on a regional level. Regional modeling, with relatively low numbers of infected and demographic noise, accounts for both spatial heterogeneity and stochasticity. Based on adapted models, short-term predictions can be achieved. Thus, with the help of these sequential data assimilation methods, more realistic epidemic models are within reach.
Tikhonov regularization with oversmoothing penalty for nonlinear statistical inverse problems
(2020)
In this paper, we consider the nonlinear ill-posed inverse problem with noisy data in the statistical learning setting. The Tikhonov regularization scheme in Hilbert scales is considered to reconstruct the estimator from the random noisy data. In this statistical learning setting, we derive the rates of convergence for the regularized solution under certain assumptions on the nonlinear forward operator and the prior assumptions. We discuss estimates of the reconstruction error using the approach of reproducing kernel Hilbert spaces.
Large real-world networks typically follow a power-law degree distribution. To study such networks, numerous random graph models have been proposed. However, real-world networks are not drawn at random. Therefore, Brach et al. (27th symposium on discrete algorithms (SODA), pp 1306-1325, 2016) introduced two natural deterministic conditions: (1) a power-law upper bound on the degree distribution (PLB-U) and (2) power-law neighborhoods, that is, the degree distribution of neighbors of each vertex is also upper bounded by a power law (PLB-N). They showed that many real-world networks satisfy both properties and exploit them to design faster algorithms for a number of classical graph problems. We complement their work by showing that some well-studied random graph models exhibit both of the mentioned PLB properties. PLB-U and PLB-N hold with high probability for Chung-Lu Random Graphs and Geometric Inhomogeneous Random Graphs and almost surely for Hyperbolic Random Graphs. As a consequence, all results of Brach et al. also hold with high probability or almost surely for those random graph classes. In the second part we study three classical NP-hard optimization problems on PLB networks. It is known that on general graphs with maximum degree Delta, a greedy algorithm, which chooses nodes in the order of their degree, only achieves a Omega (ln Delta)-approximation forMinimum Vertex Cover and Minimum Dominating Set, and a Omega(Delta)-approximation forMaximum Independent Set. We prove that the PLB-U property with beta>2 suffices for the greedy approach to achieve a constant-factor approximation for all three problems. We also show that these problems are APX-hard even if PLB-U, PLB-N, and an additional power-law lower bound on the degree distribution hold. Hence, a PTAS cannot be expected unless P = NP. Furthermore, we prove that all three problems are in MAX SNP if the PLB-U property holds.
Let D be a division ring of fractions of a crossed product F[G, eta, alpha], where F is a skew field and G is a group with Conradian left-order <=. For D we introduce the notion of freeness with respect to <= and show that D is free in this sense if and only if D can canonically be embedded into the endomorphism ring of the right F-vector space F((G)) of all formal power series in G over F with respect to <=. From this we obtain that all division rings of fractions of F[G, eta, alpha] which are free with respect to at least one Conradian left-order of G are isomorphic and that they are free with respect to any Conradian left-order of G. Moreover, F[G, eta, alpha] possesses a division ring of fraction which is free in this sense if and only if the rational closure of F[G, eta, alpha] in the endomorphism ring of the corresponding right F-vector space F((G)) is a skew field.
In dynamic decision problems, it is challenging to find the right balance between maximizing expected rewards and minimizing risks. In this paper, we consider NP-hard mean-variance (MV) optimization problems in Markov decision processes with a finite time horizon. We present a heuristic approach to solve MV problems, which is based on state-dependent risk aversion and efficient dynamic programming techniques. Our approach can also be applied to mean-semivariance (MSV) problems, which particularly focus on the downside risk. We demonstrate the applicability and the effectiveness of our heuristic for dynamic pricing applications. Using reproducible examples, we show that our approach outperforms existing state-of-the-art benchmark models for MV and MSV problems while also providing competitive runtimes. Further, compared to models based on constant risk levels, we find that state-dependent risk aversion allows to more effectively intervene in case sales processes deviate from their planned paths. Our concepts are domain independent, easy to implement and of low computational complexity.
In the semiclassical limit (h) over bar -> 0, we analyze a class of self-adjoint Schrodinger operators H-(h) over bar = (h) over bar L-2 + (h) over barW + V center dot id(E) acting on sections of a vector bundle E over an oriented Riemannian manifold M where L is a Laplace type operator, W is an endomorphism field and the potential energy V has non-degenerate minima at a finite number of points m(1),... m(r) is an element of M, called potential wells. Using quasimodes of WKB-type near m(j) for eigenfunctions associated with the low lying eigenvalues of H-(h) over bar, we analyze the tunneling effect, i.e. the splitting between low lying eigenvalues, which e.g. arises in certain symmetric configurations. Technically, we treat the coupling between different potential wells by an interaction matrix and we consider the case of a single minimal geodesic (with respect to the associated Agmon metric) connecting two potential wells and the case of a submanifold of minimal geodesics of dimension l + 1. This dimension l determines the polynomial prefactor for exponentially small eigenvalue splitting.
We consider a perturbation of the de Rham complex on a compact manifold with boundary. This perturbation goes beyond the framework of complexes, and so cohomology does not apply to it. On the other hand, its curvature is "small", hence there is a natural way to introduce an Euler characteristic and develop a Lefschetz theory for the perturbation. This work is intended as an attempt to develop a cohomology theory for arbitrary sequences of linear mappings.
We study the Cauchy problem for a nonlinear elliptic equation with data on a piece S of the boundary surface partial derivative X. By the Cauchy problem is meant any boundary value problem for an unknown function u in a domain X with the property that the data on S, if combined with the differential equations in X, allows one to determine all derivatives of u on S by means of functional equations. In the case of real analytic data of the Cauchy problem, the existence of a local solution near S is guaranteed by the Cauchy-Kovalevskaya theorem. We discuss a variational setting of the Cauchy problem which always possesses a generalized solution.
In this short survey article, we showcase a number of non-trivial geometric problems that have recently been resolved by marrying methods from functional calculus and real-variable harmonic analysis. We give a brief description of these methods as well as their interplay. This is a succinct survey that hopes to inspire geometers and analysts alike to study these methods so that they can be further developed to be potentially applied to a broader range of questions.
Classic inversion methods adjust a model with a predefined number of parameters to the observed data. With transdimensional inversion algorithms such as the reversible-jump Markov chain Monte Carlo (rjMCMC), it is possible to vary this number during the inversion and to interpret the observations in a more flexible way. Geoscience imaging applications use this behaviour to automatically adjust model resolution to the inhomogeneities of the investigated system, while keeping the model parameters on an optimal level. The rjMCMC algorithm produces an ensemble as result, a set of model realizations, which together represent the posterior probability distribution of the investigated problem. The realizations are evolved via sequential updates from a randomly chosen initial solution and converge toward the target posterior distribution of the inverse problem. Up to a point in the chain, the realizations may be strongly biased by the initial model, and must be discarded from the final ensemble. With convergence assessment techniques, this point in the chain can be identified. Transdimensional MCMC methods produce ensembles that are not suitable for classic convergence assessment techniques because of the changes in parameter numbers. To overcome this hurdle, three solutions are introduced to convert model realizations to a common dimensionality while maintaining the statistical characteristics of the ensemble. A scalar, a vector and a matrix representation for models is presented, inferred from tomographic subsurface investigations, and three classic convergence assessment techniques are applied on them. It is shown that appropriately chosen scalar conversions of the models could retain similar statistical ensemble properties as geologic projections created by rasterization.
Biological invasions may result from multiple introductions, which might compensate for reduced gene pools caused by bottleneck events, but could also dilute adaptive processes. A previous common-garden experiment showed heritable latitudinal clines in fitness-related traits in the invasive goldenrod Solidago canadensis in Central Europe. These latitudinal clines remained stable even in plants chemically treated with zebularine to reduce epigenetic variation. However, despite the heritability of traits investigated, genetic isolation-by-distance was non-significant. Utilizing the same specimens, we applied a molecular analysis of (epi)genetic differentiation with standard and methylation-sensitive (MSAP) AFLPs. We tested whether this variation was spatially structured among populations and whether zebularine had altered epigenetic variation. Additionally, we used genome scans to mine for putative outlier loci susceptible to selection processes in the invaded range. Despite the absence of isolation-by-distance, we found spatial genetic neighborhoods among populations and two AFLP clusters differentiating northern and southern Solidago populations. Genetic and epigenetic diversity were significantly correlated, but not linked to phenotypic variation. Hence, no spatial epigenetic patterns were detected along the latitudinal gradient sampled. Applying genome-scan approaches (BAYESCAN, BAYESCENV, RDA, and LFMM), we found 51 genetic and epigenetic loci putatively responding to selection. One of these genetic loci was significantly more frequent in populations at the northern range. Also, one epigenetic locus was more frequent in populations in the southern range, but this pattern was lost under zebularine treatment. Our results point to some genetic, but not epigenetic adaptation processes along a large-scale latitudinal gradient of S. canadensis in its invasive range.
Aim Quantitative and kinetic insights into the drug exposure-disease response relationship might enhance our knowledge on loss of response and support more effective monitoring of inflammatory activity by biomarkers in patients with inflammatory bowel disease (IBD) treated with infliximab (IFX). This study aimed to derive recommendations for dose adjustment and treatment optimisation based on mechanistic characterisation of the relationship between IFX serum concentration and C-reactive protein (CRP) concentration. <br /> Methods Data from an investigator-initiated trial included 121 patients with IBD during IFX maintenance treatment. Serum concentrations of IFX, antidrug antibodies (ADA), CRP, and disease-related covariates were determined at the mid-term and end of a dosing interval. Data were analysed using a pharmacometric nonlinear mixed-effects modelling approach. An IFX exposure-CRP model was generated and applied to evaluate dosing regimens to achieve CRP remission. <br /> Results The generated quantitative model showed that IFX has the potential to inhibit up to 72% (9% relative standard error [RSE]) of CRP synthesis in a patient. IFX concentration leading to 90% of the maximum CRP synthesis inhibition was 18.4 mu g/mL (43% RSE). Presence of ADA was the most influential factor on IFX exposure. With standard dosing strategy, >= 55% of ADA+ patients experienced CRP nonremission. Shortening the dosing interval and co-therapy with immunomodulators were found to be the most beneficial strategies to maintain CRP remission. <br /> Conclusions With the generated model we could for the first time establish a robust relationship between IFX exposure and CRP synthesis inhibition, which could be utilised for treatment optimisation in IBD patients.
Thermophysical modelling and parameter estimation of small solar system bodies via data assimilation
(2020)
Deriving thermophysical properties such as thermal inertia from thermal infrared observations provides useful insights into the structure of the surface material on planetary bodies. The estimation of these properties is usually done by fitting temperature variations calculated by thermophysical models to infrared observations. For multiple free model parameters, traditional methods such as least-squares fitting or Markov chain Monte Carlo methods become computationally too expensive. Consequently, the simultaneous estimation of several thermophysical parameters, together with their corresponding uncertainties and correlations, is often not computationally feasible and the analysis is usually reduced to fitting one or two parameters. Data assimilation (DA) methods have been shown to be robust while sufficiently accurate and computationally affordable even for a large number of parameters. This paper will introduce a standard sequential DA method, the ensemble square root filter, for thermophysical modelling of asteroid surfaces. This method is used to re-analyse infrared observations of the MARA instrument, which measured the diurnal temperature variation of a single boulder on the surface of near-Earth asteroid (162173) Ryugu. The thermal inertia is estimated to be 295 +/- 18 Jm(-2) K-1 s(-1/2), while all five free parameters of the initial analysis are varied and estimated simultaneously. Based on this thermal inertia estimate the thermal conductivity of the boulder is estimated to be between 0.07 and 0.12,Wm(-1) K-1 and the porosity to be between 0.30 and 0.52. For the first time in thermophysical parameter derivation, correlations and uncertainties of all free model parameters are incorporated in the estimation procedure that is more than 5000 times more efficient than a comparable parameter sweep.
In this paper, using an algorithm based on the retrospective rejection sampling scheme introduced in [A. Beskos, O. Papaspiliopoulos, and G. O. Roberts,Methodol. Comput. Appl. Probab., 10 (2008), pp. 85-104] and [P. Etore and M. Martinez, ESAIM Probab.Stat., 18 (2014), pp. 686-702], we propose an exact simulation of a Brownian di ff usion whose drift admits several jumps. We treat explicitly and extensively the case of two jumps, providing numerical simulations. Our main contribution is to manage the technical di ffi culty due to the presence of t w o jumps thanks to a new explicit expression of the transition density of the skew Brownian motion with two semipermeable barriers and a constant drift.
Die Erweiterung des natürlichen Zahlbereichs um die positiven Bruchzahlen und die negativen ganzen Zahlen geht für Schülerinnen und Schüler mit großen gedanklichen Hürden und einem Umbruch bis dahin aufgebauter Grundvorstellungen einher. Diese Masterarbeit trägt wesentliche Veränderungen auf der Vorstellungs- und Darstellungsebene für beide Zahlbereiche zusammen und setzt sich mit den kognitiven Herausforderungen für Lernende auseinander. Auf der Grundlage einer Diskussion traditioneller sowie alternativer Lehrgänge der Zahlbereichserweiterung wird eine Unterrichtskonzeption für den Mathematikunterricht entwickelt, die eine parallele Einführung der Bruchzahlen und der negativen Zahlen vorschlägt. Die Empfehlungen der Unterrichtkonzeption erstrecken sich über den Zeitraum von der ersten bis zur siebten Klassenstufe, was der behutsamen Weiterentwicklung und Modifikation des Zahlbegriffs viel Zeit einräumt, und enthalten auch didaktische Überlegungen sowie konkrete Hinweise zu möglichen Aufgabenformaten.