Search Results
Sharp phase transition for Cox percolation
We 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.
Topology optimization subject to additive manufacturing constraints
In Topology Optimization the goal is to find the ideal material distribution in a domain subject to external forces. The structure is optimal if it has the highest possible stiffness. A volume constraint ensures filigree structures, which are regulated via a Ginzburg-Landau term. During 3D Printing overhangs lead to instabilities, which have only been tackled unsatisfactorily. The novel idea is to incorporate an Additive Manufacturing Constraint into the phase field method. A rigorous analysis proves the existence of a solution and leads to first order necessary optimality conditions. With an Allen-Cahn interface propagation the optimization problem is solved iteratively. At a low computational cost the Additive Manufacturing Constraint brings about support structures, which can be fine tuned according to engineering demands. Stability during 3D Printing is assured, which solves a common Additive Manufacturing problem.
Computational modelling and simulation of cancer growth and migration within a 3D heterogeneous tissue: The effects of fibre and vascular structure
The term cancer covers a multitude of bodily diseases, broadly categorised by having cells which do not behave normally. Since cancer cells can arise from any type of cell in the body, cancers can grow in or around any tissue or organ making the disease highly complex. Our research is focused on understanding the specific mechanisms that occur in the tumour microenvironment via mathematical and computational modeling. We present a 3D individual-based model which allows one to simulate the behaviour of, and spatio-temporal interactions between, cells, extracellular matrix fibres and blood vessels. Each agent (a single cell, for example) is fully realised within the model and interactions are primarily governed by mechanical forces between elements. However, as well as the mechanical interactions we also consider chemical interactions, for example, by coupling the code to a finite element solver to model the diffusion of oxygen from blood vessels to cells. The current state of the art of the model allows us to simulate tumour growth around an arbitrary blood-vessel network or along the striations of fibrous tissue.
Data-driven confidence bands for distributed nonparametric regression
Gaussian 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.
Gradient methods for problems with inexact model of the objective
We 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.
Convergence bounds for empirical nonlinear least-squares
We 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.
On the structure of continuum thermodynamical diffusion fluxes -- A novel closure scheme and its relation to the Maxwell--Stefan and the Fick--Onsager approach
This 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.
Optimality conditions for convex stochastic optimization problems in Banach spaces with almost sure state constraint
We 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.
Mass transport in multicomponent compressible fluids: Local and global well-posedness in classes of strong solutions for general class-one models
We consider a system of partial differential equations describing mass transport in a multicomponent isothermal compressible fluid. The diffusion fluxes obey the Fick-Onsager or Maxwell- Stefan closure approach. Mechanical forces result into one single convective mixture velocity, the barycentric one, which obeys the Navier-Stokes equations. The thermodynamic pressure is defined by the Gibbs-Duhem equation. Chemical potentials and pressure are derived from a thermodynamic potential, the Helmholtz free energy, with a bulk density allowed to be a general convex function of the mass densities of the constituents. The resulting PDEs are of mixed parabolic-hyperbolic type. We prove two theoretical results concerning the well-posedness of the model in classes of strong solutions: 1. The solution always exists and is unique for short-times and 2. If the initial data are sufficiently near to an equilibrium solution, the well-posedness is valid on arbitrary large, but finite time intervals. Both results rely on a contraction principle valid for systems of mixed type that behave like the compressible Navier- Stokes equations. The linearised parabolic part of the operator possesses the self map property with respect to some closed ball in the state space, while being contractive in a lower order norm only. In this paper, we implement these ideas by means of precise a priori estimates in spaces of exact regularity.
Weak error rates for option pricing under linear rough volatility
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.