Day 1: Statement of Monge-Kantorovich problem, Multidimensional Kantorovich Theorem, kantorovich-Rubinstein Theorem and minimal norms in probability theory
Creator:
Rachev, Svetlozar (Zari) (State University of New York, Stony Brook (SUNY))
Created:
2014-06-09
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Day 5: The following topics will be covered:Stability of QueueingSystems; Stochastic Dominance Revisited, Almost Stochastic Orders andDegree of Violations.
Creator:
Rachev, Svetlozar (Zari) (State University of New York, Stony Brook (SUNY))
Created:
2014-06-13
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Day 4: Primary, Simple, andCompound Probability Distances and Minimal and Maximal Distances andNorms; Structural Classification of Probability Distances - HausdoerffLambda- and Dzeta- Structures of Probability semidistances
Creator:
Rachev, Svetlozar (Zari) (State University of New York, Stony Brook (SUNY))
Created:
2014-06-12
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Allen Tannenbaum will be speaking on the theme of Optimal Mass Transport for Problems in Systems, Control, and Signal Processing. The lectures will be based on a number of published papers as well as lecture notes. He will lead participants through basic methods in the calculus of variations for the classical solution of the Monge-Kantorovich pr...
Creator:
Rachev, Svetlozar (Zari) (State University of New York, Stony Brook (SUNY)); Tannenbaum, Allen (State University of New York, Stony Brook (SUNY))
Created:
2014-06-09
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
We consider the asymptotic interaction laws of pulses and fronts in the so-called semi-strong regime of strongly differing diffusion lengths for reaction-diffusion systems. An asymptotic expansion and matching approach is applied in a model independent unifying framework. In contrast to the universal laws of motion arising in weak interaction, s...
Creator:
Rademacher, Jens (Universität Bremen)
Created:
2013-06-04
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
I will discuss recent algorithmic developments for the classical problem of approximating a given matrix by a low-rank matrix. This is motivated by the need of faster algorithms for very large data and certain applications that want the approximating matrix to have rows living in the span of only a few rows of the original matrix, which adds a c...
Creator:
Rademacher, Luis (The Ohio State University)
Created:
2011-09-28
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.