Fast Multiscale Clustering and Manifold Identification

Speaker: 

Professor Dan Kushnir

Institution: 

Weizmann Institute of Science

Time: 

Tuesday, February 19, 2008 - 3:00pm

Location: 

MSTB 254

I will present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling
data points according to local similarities. It uses an aggregation process to obtain reliable scale-dependent global properties, which arise from the local similarities. As the aggregation process proceeds, these global properties influence the formation of coherent clusters. The
global features that can be utilized are for example density, shape, intrinsic dimensionality and orientation. The last three features are a
part of the manifold identification process which is performed in parallel to the clustering process. The algorithm detects clusters that
are distinguished by their multiscale nature, separates between clusters with different densities, and identifies and resolves intersections between clusters. The algorithm is tested on synthetic and real data sets, its running time complexity is linear in the size of the data set.

Joint work with: Meirav Galun and Achi Brandt.

Fast Multiscale Clustering and Manifold Identification.

Speaker: 

Dan Kushnir

Institution: 

Weizmann Institute of Science

Time: 

Tuesday, February 19, 2008 - 3:00pm

Location: 

MSTB 254

I will present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling
data points according to local similarities. It uses an aggregation process to obtain reliable scale-dependent global properties, which arise from the local similarities. As the aggregation process proceeds, these global properties influence the formation of coherent clusters. The
global features that can be utilized are for example density, shape, intrinsic dimensionality and orientation. The last three features are a
part of the manifold identification process which is performed in parallel to the clustering process. The algorithm detects clusters that
are distinguished by their multiscale nature, separates between clusters with different densities, and identifies and resolves intersections between clusters. The algorithm is tested on synthetic and real data sets, its running time complexity is linear in the size of the data set.

Joint work with: Meirav Galun and Achi Brandt.

Principal eigenvalue of an elliptic operator with large advection and its applications to evolution of dispersal

Speaker: 

Associate Professor Yuan Lou

Institution: 

The Ohio State University

Time: 

Thursday, February 7, 2008 - 11:00am

Location: 

MSTB 254

We investigate the asymptotic behavior of the principal eigenvalue of an elliptic operator as the coefficient of the advection term approaches infinity. As a biological application, a Lotka-Volterra reaction-diffusion-advection model for two competing species in a heterogeneous environment is studied. The two species are assumed to be identical except their dispersal strategies: both species disperse by random movement and advection along environmental gradients, but one species has stronger biased movement than the other one. It is shown that at least two scenarios can occur: if only one species has a strong tendency to move upward the environmental gradients, the two species will coexist; if both species have such strong biased movements, the species with the stronger biased movement will go to extinct. These results provide a new mechanism for the coexistence of competing species, and they also suggest that an intermediate biased movement rate may be evolutionary stable.

Algebras of operators with the closure property (Joint work with V. Troitsky)

Speaker: 

Professor Haskell Rosenthal

Institution: 

UT Austin

Time: 

Tuesday, April 29, 2008 - 3:00pm

Location: 

MSTB 254

Let $A$ denote a unital algebra of bounded linear operators on an infinite
dimensional real or complex Banach space $X$.
$A$ is said to have the closure property if every densely defined
linear operator on $X$ which commutes with
the closure of A in the weak operator topology
(WOT) is closeable.
$T \in L(X)$ is said to have the closure property if $A_T$ does, where
$A_T$ denotes the algebra of polynomials in $T$.
This new concept is motivated by deep classical work of W.B.~Arveson.
I shall discuss how some of his results may be formulated in terms of the
closure property, give some structural results we have obtained, and present
some examples of operators with the closure property.
The following conjecture, if true, would yield a very broad generalization
of Arveson's main result.

Conjecture.
Let $A$ have the closure property.
Then either $A$ has a non-trivial closed invariant linear subspace, or the WOT closure of $A$ coincides with L(X)$.

The Primitive Equations in Two Space Dimensions With Multiplicative Noise

Speaker: 

Nathan Glatt-Holtz

Institution: 

University of Southern California

Time: 

Tuesday, February 5, 2008 - 3:00pm

Location: 

MSTB 254

The Primitive Equations are a fundamental model describing large scale oceanic and atmospheric processes. They are derived from the fully compressible Navier-Stokes equations on a combined basis of scale analysis and meteorological data. While an extensive body of mathematical literature exists in the study of these systems, very little is known in the stochastic setting. In this talk we discuss recent joint work with M. Ziane concerning existence and uniqueness of solutions for the 2-D equations in the presence of multiplicative noise terms.

Pages

Subscribe to UCI Mathematics RSS