15:00
15:00
17:00
A variational model for dislocations in the line tension limit
17:00
Subdirect products of hyperbolic groups, logic, Kaehler geometry and profinite groups
15:45
Fractals and conformal invariance
Abstract
It became apparent during the last decade that in several questions in classical complex analysis extremal configurations are fractal, making them very difficult to attack: it is not even clear how to construct or describe extremal objects. We will argue that the most promising approach is to consider conformally self-similar random configurations, which should be extremal almost surely.
14:15
14:15
The genealogy of self-similar fragmentations with a negative index as a continuum random tree
Abstract
Fragmentation processes model the evolution of a particle that split as time goes on. When small particles split fast enough, the fragmentation is intensive and the initial mass is reduced to dust in finite time. We encode such fragmentation into a continuum random tree (CRT) in the sense of Aldous. When the splitting times are dense near 0, the fragmentation CRT is in turn encoded into a continuous (height) function. Under some mild hypotheses, we calculate the Hausdorff dimension of the CRT, as well as the maximal H
14:00
Forced synchronization in cardiovascular system
16:00
14:30
Kaplansky's conjecture on the Frobenius property of cosemisimple Hopf algebras
14:00
17:00
17:00
Nonlinear magnetoelasticity of magneto-sensitive solids
Abstract
/notices/events/abstracts/applied-analysis/ht05/ogden.shtml
17:00
Branched covers and large groups
Abstract
/notices/events/abstracts/topology/lackenby.shtml
15:45
Long Range Exclusion Process
Abstract
Given a countable set of sites S an a transition matrix p(x,y) on that set, we consider a process of particles evolving on S according to the following rule: each particle waits an exponential time and then jumps following a Markov chain governed by p(x,y); the particle keeps jumping until it reaches an empty site where it remains for another exponential time. Unlike most interacting particle systems, this process fails to
have the Feller property. This causes several technical difficulties to study it. We present a method to prove that certain measures are invariant for the process and exploit the Kolmogorov zero or one law to study some of its unusual path properties.
14:15
Coagulation of Brownian particles
Abstract
According to the Stokes-Einstein law, microscopic particles subject to intense bombardment by (much smaller) gas molecules perform Brownian motion with a diffusivity inversely proportion to their radius. Smoluchowski, shortly after Einstein's account of Brownian motion, used this model to explain the behaviour of a cloud of such particles when, in addition their diffusive motion, they coagulate on collision. He wrote down a system of evolution equations for the densities of particles of each size, in particular identifying the collision rate as a function of particle size.
We give a rigorous derivation of (a spatially inhomogeneous generalization of) Smoluchowski's equations, as the limit of a sequence of Brownian particle systems with coagulation on collision. The equations are shown to have a unique, mass-preserving solution. A detailed limiting picture emerges describing the ancestral spatial tree of particles making up each particle in the current population. The limit is established at the level of these trees.
Resolution of Gibbs' phenomenon from global to semi-global
Abstract
Spectral projections enjoy high order convergence for globally smooth functions. However, a single discontinuity introduces O(1) spurious oscillations near the discontinuity and reduces the high order convergence rate to first order, Gibbs' Phenomena. Although a direct expansion of the function in terms of its global moments yields this low order approximation, high resolution information is retained in the global moments. Two techniques for the resolution of the Gibbs' phenomenon are discussed, filtering and reprojection methods. An adaptive filter with optimal joint time-frequency localization is presented, which recovers a function from its N term Fourier projection within the error bound \exp(-Nd(x)), where d(x) is the distance from the point being recovered to the nearest discontinuity. Symmetric filtering, however, must sacrifice accuracy when approaching a discontinuity. To overcome this limitation, Gegenbauer postprocessing was introduced by Gottlieb, Shu, et al, which recovers a function from its N term Fourier projection within the error bound \exp(-N). An extension of Gegenbauer postprocessing with improved convergence and robustness properties is presented, the robust Gibbs complements. Filtering and reprojection methods will be put in a unifying framework, and their properties such as robustness and computational cost contrasted. This research was conducted jointly with Eitan Tadmor and Anne Gelb.
17:00
14:15