Energetic Variational Approaches for General Diffusion

Speaker: 

Chun Liu

Institution: 

Pennsylvania State University

Time: 

Monday, April 1, 2013 - 4:00pm to 5:00pm

Host: 

Location: 

RH306

 For the last several years, we had been working on projects related to 
charge transport in solutions and proteins (ion channels). One of the key ingredients 
in these studies is the understanding of diffusion and its relations to other effects, 
such as hydrodynamics, electrostatics and other particle-particle interactions. 
Due to the non-ideal situations in almost all biological environments, such as 
the high concentration of charge densities, those conventional theories have to be modified or re-derived. 

In the talk, I will employ the general framework of energetic variational approaches, 
especially Onsager's Maximum Dissipation Principles to the problems of generalized diffusion. We will discuss the roles of different stochastic integrations, 
and the procedures of optimal transport in the context of general 
linear response theory in statistical physics.

Absolutely continuous spectrum for the Anderson model on certain tree-strips of finite cone type, including the Fibonacci tree-strip

Speaker: 

Christian Sadel

Institution: 

UBC, Vancouver

Time: 

Thursday, February 14, 2013 - 2:00pm

Host: 

Location: 

RH 306

A tree-strip is the product of a finite set (graph) with an infinite
tree. For a tree-strip of finite cone type, the tree is of finite cone
type and constructed starting from a root with certain substitution rules.
For a vertex of such a tree one can consider the cone of descendants and
the term 'finite cone type' refers to the fact that there are only
finitely many different
non-isomorphic cones of descendants.
On a certain class of such trees we obtain absolutely continuous
spectrum for the Anderson model for low disorder. The proof is based in
an Implicit Function Theorem in a very abstract Banach space.

The most recent result considers the Fibonacci tree-strip which is quite
special.
For the original set up, an essential assumption needed is the fact that
each vertex has at least 2 children, i.e. the tree can not have short
line segments. This is the key assumption that excludes quasi-one
dimensional Anderson models on strips for which Anderson localization is
known.
The Fibonacci tree, whose number of vertices in the n-th generation
corresponds to the n-th Fibonacci number, violates this assumption. But
with certain modifications this special case can also be treated.
The Fibonacci tree-strip is the first tree-strip where the tree has
short line segments and absolutely continuous spectrum for random
operators could be established.

Small-bias sets and the subset sum problem

Speaker: 

Jiyou Li

Institution: 

Shanghai Jiaotong University

Time: 

Tuesday, January 22, 2013 - 2:00pm to 3:00pm

Host: 

Location: 

RH306

A subset $X$ in $\{0,1\}^n$ is a called an $\epsilon$-biased set if for any nonempty subset $T\subseteq [n]$ the following condition holds. Randomly choosing an element $x\in X$, the parity of its T-coordinates sum has bias at most $\epsilon$. This concept is essentially equivalent or close to expanders, pseudorandom generators and linear codes of certain parameters. For instance, viewing $X$ as a generator matrix, an $\epsilon$-biased set is equivalent to an $[|X|, n]_2$-linear code of relative distance at least $1/2-\epsilon$. For fixed $n$ and $\epsilon$, it's a challenging problem to construct smallest $\epsilon$-biased sets. In this talk we will first introduce several known constructions of $\epsilon$-bias sets with the methods from number theory and geometrical coding theory. Then we will present a construction with a conjecture, which is closely related to the subset sum problem over prime fields.

Statistics of p-divisible groups over F_p

Speaker: 

Bryden Cais

Institution: 

University of Arizona

Time: 

Thursday, December 13, 2012 - 3:00pm to 4:00pm

Location: 

Rowland Hall 440R

What is the probability that a random abelian variety over F_q is ordinary? Using (semi)linear algebra, we will answer an analogue of this question, and explain how our method can be used to answer similar statistical questions about p-rank and a-number. The answers are perhaps surprising, and deviate from what one might expect via naive reasoning. Using these computations and numerical evidence, we formulate several ``Cohen-Lenstra" heuristics for the structure of the p-torsion on the Jacobian of a random hyperelliptic curve over F_q. These heuristics are the "l=p " analogue of Cohen-Lenstra in the function field setting. This is joint work with Jordan Ellenberg and David Zureick-Brown.

An introduction to the spectral decimation method

Speaker: 

David Damanik

Institution: 

Rice University

Time: 

Tuesday, January 29, 2013 - 1:00pm to 2:00pm

Host: 

Location: 

RH 440R

We survey some results that employ renormalization ideas in the spectral analysis of suitable self-similar Hamiltonians. A guiding example will be given by the Laplacian on the Sierpinsky lattice. We describe results on the spectrum and the eigenfunctions of this operator and also talk about how they generalize to a wider class of models.

Constructing SRB-measures for chaotic attractors

Speaker: 

Yakov Pesin

Institution: 

Penn State University

Time: 

Tuesday, January 8, 2013 - 1:00pm to 2:00pm

Host: 

Location: 

RH 440R

 

I will discuss a general approach for constructing SRB measures for diffeomorphisms possessing chaotic attractors (i.e., attractors with nonzero Lyapunov exponents). I introduce a certain recurrence condition on the iterates of Lebesgue measure called “effective hyperbolicity” and I will show that if the asymptotic rate of effective hyperbolicity is exponential on a set of positive Lebesgue measure, then the system has an SRB measure. Along the way a new notion of hyperbolicity -- "effective hyperbolicity'' will be introduced and a new example of a chaotic attractor will be presented. This is a joint work with V. Climenhaga and D. Dolgopyat.

Pages

Subscribe to UCI Mathematics RSS