511 results
Search Results
Now showing 1 - 10 of 511
- ItemDifferentialgeometrie im Grossen (hybrid meeting)(Zürich : EMS Publ. House, 2021) Hamenstädt, Ursula; Lang, Urs; Weinkove, BenThe field of classical differential geometry has expanded enormously over the last several decades, helped by the development of tools from neighboring fields such as partial differential equations, complex analysis and geometric topology. In the spirit of the previous meetings in the series, this meeting will bring together researchers from apparently separate subfields of differential geometry, but whose work is linked by common themes. In particular, this meeting will emphasize intrinsic geometric questions motivated by the classification and rigidity of global geometric structures and the interaction of curvature with the underlying geometry and topology.
- ItemSharp phase transition for Cox percolation(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2022) Hirsch, Christian; Jahnel, Benedikt; Muirhead, StephenWe prove the sharpness of the percolation phase transition for a class of Cox percolation models, i.e., models of continuum percolation in a random environment. The key requirements are that the environment has a finite range of dependence and satisfies a local boundedness condition, however the FKG inequality need not hold. The proof combines the OSSS inequality with a coarse-graining construction.
- ItemThe transition of zbMATH towards an open information platform for mathematics (II): A two-year progress report(Berlin : EMS Press, an imprint of the European Mathematical Society (EMS), 2022) Hulek, Klaus; Teschke, Olaf[no abstract available]
- ItemGradient methods for problems with inexact model of the objective(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Stonyakin, Fedor; Dvinskikh, Darina; Dvurechensky, Pavel; Kroshnin, Alexey; Kuznetsova, Olesya; Agafonov, Artem; Gasnikov, Alexander; Tyurin, Alexander; Uribe, Cesar A.; Pasechnyuk, Dmitry; Artamonov, SergeiWe consider optimization methods for convex minimization problems under inexact information on the objective function. We introduce inexact model of the objective, which as a particular cases includes inexact oracle [19] and relative smoothness condition [43]. We analyze gradient method which uses this inexact model and obtain convergence rates for convex and strongly convex problems. To show potential applications of our general framework we consider three particular problems. The first one is clustering by electorial model introduced in [49]. The second one is approximating optimal transport distance, for which we propose a Proximal Sinkhorn algorithm. The third one is devoted to approximating optimal transport barycenter and we propose a Proximal Iterative Bregman Projections algorithm. We also illustrate the practical performance of our algorithms by numerical experiments.
- ItemOptimality conditions for convex stochastic optimization problems in Banach spaces with almost sure state constraint(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Geiersbach, Caroline; Wollner, WinnifriedWe analyze a convex stochastic optimization problem where the state is assumed to belong to the Bochner space of essentially bounded random variables with images in a reflexive and separable Banach space. For this problem, we obtain optimality conditions that are, with an appropriate model, necessary and sufficient. Additionally, the Lagrange multipliers associated with optimality conditions are integrable vector-valued functions and not only measures. A model problem is given demonstrating the application to PDE-constrained optimization under uncertainty.
- ItemConvergence bounds for empirical nonlinear least-squares(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Eigel, Martin; Trunschke, Philipp; Schneider, ReinholdWe consider best approximation problems in a nonlinear subset of a Banach space of functions. The norm is assumed to be a generalization of the L2 norm for which only a weighted Monte Carlo estimate can be computed. The objective is to obtain an approximation of an unknown target function by minimizing the empirical norm. In the case of linear subspaces it is well-known that such least squares approximations can become inaccurate and unstable when the number of samples is too close to the number of parameters. We review this statement for general nonlinear subsets and establish error bounds for the empirical best approximation error. Our results are based on a restricted isometry property (RIP) which holds in probability and we show sufficient conditions for the RIP to be satisfied with high probability. Several model classes are examined where analytical statements can be made about the RIP. Numerical experiments illustrate some of the obtained stability bounds.
- ItemUnderstanding the transgression of global and regional freshwater planetary boundaries(London : Royal Society, 2022) Pastor, A.V.; Biemans, H.; Franssen, W.; Gerten, D.; Hoff, H.; Ludwig, F.; Kabat, P.Freshwater ecosystems have been degraded due to intensive freshwater abstraction. Therefore, environmental flow requirements (EFRs) methods have been proposed to maintain healthy rivers and/or restore river flows. In this study, we used the Variable Monthly Flow (VMF) method to calculate the transgression of freshwater planetary boundaries: (1) natural deficits in which flow does not meet EFRs due to climate variability, and (2) anthropogenic deficits caused by water abstractions. The novelty is that we calculated spatially and cumulative monthly water deficits by river types including the frequency, magnitude and causes of environmental flow (EF) deficits (climatic and/or anthropogenic). Water deficit was found to be a regional rather than a global concern (less than 5% of total discharge). The results show that, from 1960 to 2000, perennial rivers with low flow alteration, such as the Amazon, had an EF deficit of 2–12% of the total discharge, and that the climate deficit was responsible for up to 75% of the total deficit. In rivers with high seasonality and high water abstractions such as the Indus, the total deficit represents up to 130% of its total discharge, 85% of which is due to withdrawals. We highlight the need to allocate water to humans and ecosystems sustainably. This article is part of the Royal Society Science+ meeting issue ‘Drought risk in the Anthropocene’.
- ItemOn the structure of continuum thermodynamical diffusion fluxes -- A novel closure scheme and its relation to the Maxwell--Stefan and the Fick--Onsager approach(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Bothe, Dieter; Druet, Pierre-ÉtienneThis paper revisits the modeling of multicomponent diffusion within the framework of thermodynamics of irreversible processes. We briefly review the two well-known main approaches, leading to the generalized Fick--Onsager multicomponent diffusion fluxes or to the generalized Maxwell--Stefan equations. The latter approach has the advantage that the resulting fluxes are consistent with non-negativity of the partial mass densities for non-singular and non-degenerate Maxwell--Stefan diffusivities. On the other hand, this approach requires computationally expensive matrix inversions since the fluxes are only implicitly given. We propose and discuss a novel and more direct closure which avoids the inversion of the Maxwell--Stefan equations. It is shown that all three closures are actually equivalent under the natural requirement of positivity for the concentrations, thus revealing the general structure of continuum thermodynamical diffusion fluxes.
- ItemWeak error rates for option pricing under linear rough volatility(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2022) Bayer, Christian; Hall, Eric; Tempone, Raúl F.In quantitative finance, modeling the volatility structure of underlying assets is vital to pricing options. Rough stochastic volatility models, such as the rough Bergomi model [Bayer, Friz, Gatheral, Quantitative Finance 16(6), 887-904, 2016], seek to fit observed market data based on the observation that the log-realized variance behaves like a fractional Brownian motion with small Hurst parameter, H < 1/2, over reasonable timescales. Both time series of asset prices and option-derived price data indicate that H often takes values close to 0.1 or less, i.e., rougher than Brownian motion. This change improves the fit to both option prices and time series of underlying asset prices while maintaining parsimoniousness. However, the non-Markovian nature of the driving fractional Brownian motion in rough volatility models poses severe challenges for theoretical and numerical analyses and for computational practice. While the explicit Euler method is known to converge to the solution of the rough Bergomi and similar models, its strong rate of convergence is only H. We prove rate H + 1/2 for the weak convergence of the Euler method for the rough Stein--Stein model, which treats the volatility as a linear function of the driving fractional Brownian motion, and, surprisingly, we prove rate one for the case of quadratic payoff functions. Indeed, the problem of weak convergence for rough volatility models is very subtle; we provide examples demonstrating the rate of convergence for payoff functions that are well approximated by second-order polynomials, as weighted by the law of the fractional Brownian motion, may be hard to distinguish from rate one empirically. Our proof uses Talay--Tubaro expansions and an affine Markovian representation of the underlying and is further supported by numerical experiments. These convergence results provide a first step toward deriving weak rates for the rough Bergomi model, which treats the volatility as a nonlinear function of the driving fractional Brownian motion.
- ItemData-driven confidence bands for distributed nonparametric regression(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Avanesov, ValeriyGaussian Process Regression and Kernel Ridge Regression are popular nonparametric regression approaches. Unfortunately, they suffer from high computational complexity rendering them inapplicable to the modern massive datasets. To that end a number of approximations have been suggested, some of them allowing for a distributed implementation. One of them is the divide and conquer approach, splitting the data into a number of partitions, obtaining the local estimates and finally averaging them. In this paper we suggest a novel computationally efficient fully data-driven algorithm, quantifying uncertainty of this method, yielding frequentist $L_2$-confidence bands. We rigorously demonstrate validity of the algorithm. Another contribution of the paper is a minimax-optimal high-probability bound for the averaged estimator, complementing and generalizing the known risk bounds.