Refine
Year of publication
- 2013 (63) (remove)
Document Type
- Article (36)
- Preprint (21)
- Doctoral Thesis (5)
- Conference Proceeding (1)
Language
- English (63)
Keywords
- Dyson-Schwinger equations (3)
- equi-singular connections (3)
- Markov chain (2)
- Picard-Fuchs equations (2)
- cluster expansion (2)
- molecular motor (2)
- (2+1)-dimensional gravity (1)
- Averaging principle (1)
- BTZ black hole (1)
- Bayesian inference (1)
Institute
- Institut für Mathematik (63) (remove)
In a recent paper with N. Tarkhanov, the Lefschetz number for endomorphisms (modulo trace class operators) of sequences of trace class curvature was introduced. We show that this is a well defined, canonical extension of the classical Lefschetz number and establish the homotopy invariance of this number. Moreover, we apply the results to show that the Lefschetz fixed point formula holds for geometric quasiendomorphisms of elliptic quasicomplexes.
Many applications, such as intermittent data assimilation, lead to a recursive application of Bayesian inference within a Monte Carlo context. Popular data assimilation algorithms include sequential Monte Carlo methods and ensemble Kalman filters (EnKFs). These methods differ in the way Bayesian inference is implemented. Sequential Monte Carlo methods rely on importance sampling combined with a resampling step, while EnKFs utilize a linear transformation of Monte Carlo samples based on the classic Kalman filter. While EnKFs have proven to be quite robust even for small ensemble sizes, they are not consistent since their derivation relies on a linear regression ansatz. In this paper, we propose another transform method, which does not rely on any a priori assumptions on the underlying prior and posterior distributions. The new method is based on solving an optimal transportation problem for discrete random variables.
Transport Molecules play a crucial role for cell viability. Amongst others, linear motors transport cargos along rope-like structures from one location of the cell to another in a stochastic fashion. Thereby each step of the motor, either forwards or backwards, bridges a fixed distance. While moving along the rope the motor can also detach and is lost. We give here a mathematical formalization of such dynamics as a random process which is an extension of Random Walks, to which we add an absorbing state to model the detachment of the motor from the rope. We derive particular properties of such processes that have not been available before. Our results include description of the maximal distance reached from the starting point and the position from which detachment takes place. Finally, we apply our theoretical results to a concrete established model of the transport molecule Kinesin V.
Asymptotic exit times
(2013)
Asymptotic transition times
(2013)
We consider an SDE driven by a Lévy noise on a foliated manifold, whose trajectories stay on compact leaves. We determine the effective behavior of the system subject to a small smooth transversal perturbation of positive order epsilon. More precisely, we show that the average of the transversal component of the SDE converges to the solution of a deterministic ODE, according to the average of the perturbing vector field with respect to the invariant measures on the leaves (of the unpertubed system) as epsilon goes to 0. In particular we give upper bounds for the rates of convergence. The main results which are proved for pure jump Lévy processes complement the result by Gargate and Ruffino for Stratonovich SDEs to Lévy driven SDEs of Marcus type.
Any clones on arbitrary set A can be written of the form Pol (A)Q for some set Q of relations on A. We consider clones of the form Pal (A)Q where Q is a set of unary relations on a finite set A. A clone Pol (A)Q is said to be a clone on a set of the smallest cardinality with respect to category equivalence if vertical bar A vertical bar <= vertical bar S vertical bar for all finite sets S and all clones C on S that category equivalent to Pol (A)Q. We characterize the clones on a set of the smallest cardinality with respect to category equivalent and show how we can find a clone on a set of the smallest cardinality that category equivalent to a given clone.