No abstract uploaded!

The diffusive transport of passive tracers or particles can be enhanced by incompressible, turbulent flow fields. Analyzing the effective behavior is a challenging problem with theoretical and practical importance in many areas of science and engineering, ranging from the transport of mass, heat, and pollutants in geophysical flows to sea ice dynamics and turbulent combustion. The long time, large scale behavior of such systems is equivalent to an enhanced diffusion process with an effective diffusivity tensor D*. Two different formulations of integral representations for D* were developed for the case of time-independent fluid velocity fields, involving spectral measures of bounded self-adjoint operators acting on vector fields and scalar fields, respectively. Here, we extend both of these approaches to the case of space-time periodic velocity fields, allowing for chaotic dynamics, providing rigorous integral representations for D* involving spectral measures of unbounded self-adjoint operators.We prove the different formulations are equivalent. Their correspondence follows from a one-to-one isometry between the underlying Hilbert spaces. We also develop a Fourier method for computing D*, which captures the phenomenon of residual diffusion related to Lagrangian chaos of a model flow. This is reflected in the spectral measure by a concentration of mass near the spectral origin.

This paper presents a method of obtaining geometric registrations between high-genus (g≥1) surfaces. Surface registration between simple surfaces, such as simply connected open surfaces, has been well studied. However, very few works have been carried out for the registration of high-genus surfaces. The high-genus topology of the surface poses a great challenge for surface registration. A possible approach is to partition surfaces into simply connected patches and registration can be done in a patch-by-patch manner. Consistent cuts are required, which are usually difficult to obtain and prone to error. In this work, we propose an effective way to obtain geometric registration between high-genus surfaces without introducing consistent cuts. The key idea is to conformally parameterize the surface into its universal covering space, which is either the Euclidean plane or the hyperbolic disk embedded in R2. Registration can then be done on the universal covering space by iteratively minimizing a shape mismatching energy measuring the geometric dissimilarity between the two surfaces. The Beltrami coefficient of the mapping is considered and adjusted in order to control the bijectivity of the mappings in each iteration. Our proposed algorithm effectively computes a smooth registration between high-genus surfaces that matches geometric information as much as possible. The algorithm can also be applied to find a smooth registration minimizing any general energy functionals. Numerical experiments on high-genus surface data show that our proposed method is effective for registering high-genus surfaces with geometric matching. We also applied the method to register anatomical structures for medical imaging, which demonstrates the usefulness of the proposed algorithm.

We study the CalabiYau equation on symplectic manifolds. We show that Donaldson's conjecture on estimates for this equation in terms of a taming symplectic form can be reduced to an integral estimate of a scalar potential function. Under a positive curvature condition, we show that the conjecture holds.

Herein, we use hybrid resampling to address (a) the long-standing problem of inference on change times and changed parameters in change-point ARX-GARCH models, and (b) the challenging problem of valid confidence intervals, after variable selection under sparsity assumptions, for the parameters in linear regression models with high-dimensional stochastic regressors and asymptotically stationary noise. For the latter problem, we introduce consistent estimators of the selected parameters and a resampling approach to overcome the inherent difficulties of post-selection confidence intervals. For the former problem, we use a sequential Monte Carlo for the latent states (representing the change times and changed parameters) of a hidden Markov model. Asymptotic efficiency theory and simulation and empirical studies demonstrate the advantages of the proposed methods.