15:30
15:30
14:00
17:00
15:45
Random walk on the incipient infinite cluster for oriented percolation
Abstract
\\Common\dfs\htdocs\www\maintainers\reception\enb\abstracts\stochastic-analysis\mt06\barlow
14:15
Discrete fragmentation trees and their continuum asymptotics
Abstract
\\Common\dfs\htdocs\www\maintainers\reception\enb\abstracts\stochastic-analysis\mt06\miermont
14:15
The surprising structure of Gaussian point clouds and its implications for signal processing
Abstract
We will explore connections between the structure of high-dimensional convex polytopes and information acquisition for compressible signals. A classical result in the field of convex polytopes is that if N points are distributed Gaussian iid at random in dimension n<<N, then only order (log N)^n of the points are vertices of their convex hull. Recent results show that provided n grows slowly with N, then with high probability all of the points are vertices of its convex hull. More surprisingly, a rich "neighborliness" structure emerges in the faces of the convex hull. One implication of this phenomenon is that an N-vector with k non-zeros can be recovered computationally efficiently from only n random projections with n=2e k log(N/n). Alternatively, the best k-term approximation of a signal in any basis can be recovered from 2e k log(N/n) non-adaptive measurements, which is within a log factor of the optimal rate achievable for adaptive sampling. Additional implications for randomized error correcting codes will be presented.
This work was joint with David L. Donoho.
14:00
15:45
Tropical Implicitization
Abstract
14:00
Metrics on the space of simple closed plane curves
Abstract
Spitalfields Day: Aspects of Geometry
14:15
16:45
Bihermitian Geometry : the poor man's twistor theory
Abstract
Meeting to mark Sir Roger Penrose's 75th Birthday
15:00
On the classical simulation of quantum computations
Abstract
Meeting to mark Sir Roger Penrose's 75th Birthday
14:00
Generalized Skyrmions and Hopf Solutions
Abstract
Meeting to mark Sir Roger Penrose's 75th Birthday
11:00
Global performance of the Newton method
Abstract
In this talk we present different strategies for regularization of the pure Newton method
(minimization problems)and of the Gauss-Newton method (systems of nonlinear equations).
For these schemes, we prove general convergence results. We establish also the global and
local worst-case complexity bounds. It is shown that the corresponding search directions can
be computed by a standard linear algebra technique.
Petrov-Galerkin Enriched Methods for Porous Media Applications
Abstract
We present a novel enhanced finite element method for the Darcy problem starting from the non stable
continuous $P_1 / P_0$ finite element spaces enriched with multiscale functions. The method is a departure
from the standard mixed method framework used in these applications. The methods are derived in a Petrov-Galerkin
framework where both velocity and pressure trial spaces are enriched with functions based on residuals of strong
equations in each element and edge partition. The strategy leads to enhanced velocity space with an element of
the lowest order Raviart-Thomas space and to a stable weak formulation preserving local mass conservation.
Numerical tests validate the method.
Jointly with Gabriel R Barrenechea, Universidad de Concepcion &
Frederic G C Valentin, LNCC
14:15