Seminars and Colloquia by Series

Fluctuation in weighted random ball model

Series
Stochastics Seminar
Time
Thursday, May 12, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Jean-Christophe BretonUniversite de Rennes
We consider weighted random ball model driven by a Poisson random measure on \Bbb{R}^d\times \Bbb{R}^+\times \Bbb{R} with product heavy tailed intensity and we are interested in the functional describing the contribution of the model in some configurations of \Bbb{R}^d. The fluctuations of such functionals are investigated under different types of scaling and the talk will discuss the possible limits. Such models arise in communication network to represent the transmission of information emitted by stations distributed according to the Poisson measure.

Clustering in Discrete Models of Colloids

Series
Combinatorics Seminar
Time
Friday, May 6, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Amanda Pascoe StreibGeorgia Tech
Colloids are mixtures of molecules  well-studied in material science that are not well-understood mathematically.  Physicists model colloids as a system of two types of tiles (type A and type B) embedded on a region of the plane, where no two tiles can overlap.  It is conjectured that at high density, the type A tiles tend to separate out and form large "clusters".   To verify this conjecture, we need methods for counting these configurations directly or efficient algorithms for sampling.  Local sampling algorithms are known to be inefficient. However, we provide the first rigorous analysis of a global "DK Algorithm" introduced by Dress and Krauth.  We also examine the clustering effect directly via a combinatorial argument. We prove for a certain class of colloid models that at high density the configurations are likely to exhibit clustering, whereas at low density the tiles are all well-distributed. Joint work with Sarah Miracle and Dana Randall.

A functional analytic approach to LSI and the hydrodynamic limit

Series
Math Physics Seminar
Time
Wednesday, May 4, 2011 - 16:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Maria WestdickenbergSchool of Math, Georgia Tech
The logarithmic Sobolev inequality (LSI) is a powerful tool for studying convergence to equilibrium in spin systems. The Bakry-Emery criterion implies LSI in the case of a convex Hamiltonian. What can be said in the nonconvex case? We present two recent sufficient conditions for LSI. The first is a Bakry-Emery-type criterion that requires only LSI (not convexity) for the single-site conditional measures. The second is a two-scale condition: An LSI on the microscopic scale (conditional measures) and an LSI on the macroscopic scale (marginal measure) are combined to prove a global LSI. We extend the two-scale method to derive an abstract theorem for convergence to the hydrodynamic limit which we then apply to the example of Guo-Papanicolaou-Varadhan. We also survey some new results.This work is joint with Grunewald, Otto, and Villani.

The Bohman-Frieze Process

Series
Combinatorics Seminar
Time
Friday, April 29, 2011 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Will PerkinsCourant Institute, NYU
The Bohman-Frieze process is a simple modification of the Erdős-Rényi random graph that adds dependence between the edges biased in favor of joining isolated vertices. We present new results on the phase transition of the Bohman-Frieze process and show that qualitatively it belongs to the same class as the Erdős-Rényi process. The results include the size and structure of small components in the barely sub- and supercritical time periods. We will also mention a class of random graph processes that seems to exhibit markedly different critical behavior.

A characterization of 4-ordered cycle in planar graphs

Series
SIAM Student Seminar
Time
Friday, April 29, 2011 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 246
Speaker
Jie MaSchool of Mathematics, Georgia Tech
Fix k vertices in a graph G, say a_1,...,a_k, if there exists a cycle that visits these vertices with this specified order, we say such a cycle is (a_1,a_2,...,a_k)-ordered. It is shown by Thomas and Wollan that any 10k-connected graph is k-linked, therefore any 10k-connected graph has an (a_1,a_2,...,a_k)-ordered for any a_1,...,a_k. However, it is possible that we can improve this bound when k is small. It is shown by W. Goddard that any 4-connected maximal planar graph has an (a_1,...,a_4)-ordered cycle for any choice of 4 vertices. We will present a complete characterization of 4-ordered cycle in planar graphs. Namely, for any four vertices a,b,c,d in planar graph G, if there is no (a,b,c,d)-ordered cycle in G, then one of the follows holds: (1) there is a cut S separating {a,c} from {b,d} with |S|\leq 3; (2) roughly speaking, a,b,d,c "stay" in a face of G with this order.

Graduate Student Probability Conference 2011

Series
Other Talks
Time
Friday, April 29, 2011 - 09:00 for 8 hours (full day)
Location
Klaus 1116
Speaker
Graduate Students Probability ConferenceSchool of Mathematics, Georgia Tech

Please Note: Other organizers include: Ruoting Gong, Huy Huynh, Jinyong Ma, Ruodu Wang, and Linwei Xin.

Georgia Tech School of Mathematics will host the 5th Annual Graduate Student Probability Conference (GSPC) from April 29 - May 1, 2011. The conference is open to all graduate students and post-doctoral fellows interested in probability. We will host two keynote speakers: Professor Nathalie Eisenbaum (Université Pierre et Marie Curie) and Professor Philip Protter (Columbia University). The conference will begin at 9:00 AM Friday, April 29 and end at noon on Sunday May 1.

Roman domination on 2-connected graphs

Series
Graph Theory Seminar
Time
Thursday, April 28, 2011 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Chun-Hung LiuMath, GT
A Roman dominating function of a graph G is a function f which maps V(G) to {0, 1, 2} such that whenever f(v)=0, there exists a vertex u adjacent to v such that f(u)=2. The weight of f is w(f) = \sum_{v \in V(G)} f(v). The Roman domination number \gamma_R(G) of G is the minimum weight of a Roman dominating function of G. Chambers, Kinnersley, Prince and West conjectured that \gamma_R(G) is at most the ceiling 2n/3 for any 2-connected graph G of n vertices. In this talk, we will give counter-examples to the conjecture, and proves that \gamma_R(G) is at most the maximum among the ceiling of 2n/3 and 23n/34 for any 2-connected graph G of n vertices. This is joint work with Gerard Jennhwa Chang.

Dynamical localization in the disordered xy-spin chain

Series
Math Physics Seminar
Time
Wednesday, April 27, 2011 - 16:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Günter StolzDept. of Math. University of Alabama at Birmingham
We will show that a quantum xy-spin chain which is exposed to a randomexterior magnetic field satisfies a zero-velocity Lieb-Robinson bound. Thiscan be interpreted as dynamical localization for the spin chain or asabsence of information transport. We will also discuss a general result,which says that zero velocity LR-bounds in a quantum spin system implyexponential decay of ground state correlations. This is joint work withRobert Sims and Eman Hamza and motivated by recent works of Burrell-Osborneas well as Hastings.

Judicious Partitions of Graphs and Hypergraphs

Series
Dissertation Defense
Time
Tuesday, April 26, 2011 - 12:30 for 2 hours
Location
Skiles 005
Speaker
Jie MaSchool of Mathematics, Georgia Tech
Classical partitioning problems, like the Max-Cut problem, ask for partitions that optimize one quantity, which are important to such fields as VLSI design, combinatorial optimization, and computer science. Judicious partitioning problems on graphs or hypergraphs ask for partitions that optimize several quantities simultaneously. In this dissertation, we work on judicious partitions of graphs and hypergraphs, and solve or asymptotically solve several open problems of Bollobas and Scott on judicious partitions, using the probabilistic method and extremal techniques.

Pages