Seminars and Colloquia by Series

Flame-pressure interactions and stretched laminar flame velocities: implicit simulation methods with realistic chemistry

Series
Math Physics Seminar
Time
Monday, March 26, 2012 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Nadeem MalikKing Fahd University of Petroleum and Minerals
An implicit method [1, 2], TARDIS (Transient Advection Reaction Diffusion Implicit Simulations), has been developed that successfully couples the compressible flow to the comprehensive chemistry and multi-component transport properties. TARDIS has been demonstrated in application to two fundamental combustion problems of great interest. First, TARDIS was used to investigate stretched laminar flame velocities in eight flame configurations: outwardly and inwardly propagating H2/air and CH4/air in cylindrical and spherical geometries. Fractional power laws are observed between the velocity deficit and the flame curvature Second, the response of transient outwardly propagating premixed H2/air and CH4/air flames subjected to joint pressure and equivalence ratio oscillations were investigated. A fuller version of the abstract can be obtained from http://www.math.gatech.edu/~rll6/malik_abstract-Apr-2012.docx [1] Malik, N.A. and Lindstedt, R.P. The response of transient inhomogeneous flames to pressure fluctuations and stretch: planar and outwardly propagating hydrogen/air flames. Combust. Sci. Tech. 82(9), 2010. [2] Malik, N. A. “Fractional powers laws in stretched flame velocities in finite thickness flames: a numerical study using realistic chemistry”. Under review, (2012). [3] Markstein, G.H. Non-steady Flame Propagation. Pergamon Press, 1964. [4] Weis,M., Zarzalis, N., and Suntz, R. Experimental study of markstein number effects on laminar flamelet velocity in turbulent premixed flames. Combust. Flame, 154:671--691, 2008.

Discrete Mathematical Biology Working Seminar

Series
Other Talks
Time
Monday, March 26, 2012 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 114
Speaker
Will PerkinsGeorgia Tech
A discussion of the paper "Complete suboptimal folding of RNA and the stability of secondary structures" by Wuchty et al (1999).

Got symmetry? Here is how you slice it

Series
CDSNS Colloquium
Time
Monday, March 26, 2012 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Predrag CvitanovicGeorgia Tech, Physics
With recent advances in experimental imaging, computational methods, and dynamics insights it is now possible to start charting out the terra incognita explored by turbulence in strongly nonlinear classical field theories, such as fluid flows. In presence of continuous symmetries these solutions sweep out 2- and higher-dimensional manifolds (group orbits) of physically equivalent states, interconnected by a web of still higher-dimensional stable/unstable manifolds, all embedded in the PDE infinite-dimensional state spaces. In order to chart such invariant manifolds, one must first quotient the symmetries, i.e. replace the dynamics on M by an equivalent, symmetry reduced flow on M/G, in which each group orbit of symmetry-related states is replaced by a single representative.Happy news: The problem has been solved often, first by Jacobi (1846), then by Hilbert and Weyl (1921), then by Cartan (1924), then by [...], then in this week's arXiv [...]. Turns out, it's not as easy as it looks.Still, every unhappy family is unhappy in its own way: The Hilbert's solution (invariant polynomial bases) is useless. The way we do this in quantum field theory (gauge fixing) is not right either. Currently only the "method of slices" does the job: it slices the state space by a set of hyperplanes in such a way that each group orbit manifold of symmetry-equivalent points is represented by a single point, but as slices are only local, tangent charts, an atlas comprised from a set of charts is needed to capture the flow globally. Lots of work and not a pretty sight (Nature does not like symmetries), but one is rewarded by much deeper insights into turbulent dynamics; without this atlas you will not get anywhere.This is not a fluid dynamics talk. If you care about atomic, nuclear or celestial physics, general relativity or quantum field theory you might be interested and perhaps help us do this better.You can take part in this seminar from wherever you are by clicking onevo.caltech.edu/evoNext/koala.jnlp?meeting=M2MvMB2M2IDsDs9I9lDM92

Local circular law for non-Hermitian random matrices

Series
Math Physics Seminar
Time
Thursday, March 22, 2012 - 11:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Anna MaltsevHausdorff Center, University of Bonn

Please Note: Note nonstandard day and time.

Consider an N by N matrix X of complex entries with iid real and imaginary parts with probability distribution h where h has Gaussian decay. We show that the local density of eigenvalues of X converges to the circular law with probability 1. More precisely, if we let a function f (z) have compact support in C and f_{\delta,z_0} (x) = f ( z-z^0 / \delta ) then the sequence of densities (1/N\delta^2) \int f_\delta d\mu_N converges to the circular law density (1/N\delta^2) \int f_\delta d\mu with probability 1. Here we show this convergence for \delta = N^{-1/8}, which is an improvement on the previously known results with \delta = 1. As a corollary, we also deduce that for square covariance matrices the number of eigenvalues in intervals of size in the intervals [a/N^2 , b/N^2] is smaller than log N with probability tending to 1.

Modern Aspects of Submodularity

Series
Other Talks
Time
Monday, March 19, 2012 - 09:20 for 8 hours (full day)
Location
Klaus 1116
Speaker
Tutorial lectures by Andreas Krause, Kazuo Murota and Jan VondrakETH, University of Tokyo, and IBM
Workshop Theme: Submodular functions are discrete analogues of convex functions, arising in various fields of computer science and operations research. Since the seminal work of Jack Edmonds (1970), submodularity has long been recognized as a common structure of many efficiently solvable combinatorial optimization problems. Recent algorithmic developments in the past decade include combinatorial strongly polynomial algorithm for minimization, constant factor approximation algorithms for maximization, and efficient methods for learning submodular functions. In addition, submodular functions find novel applications in combinatorial auctions, machine learning, and social networks. This workshop aims at providing a forum for researchers from a variety of backgrounds for exchanging results, ideas, and problems on submodular optimization and its applications. The workshop will be held from March 19-22, 2012. For complete details and workshop program, please see the website.

The interaction of diagonal defect clusters in a dimer system on the square lattice

Series
Combinatorics Seminar
Time
Friday, March 16, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Mihai CiucuMathematics, Indiana University, Bloomington, IN
The correlation of gaps in dimer systems was introduced in 1963 by Fisher and Stephenson, who looked at the interaction of two monomers generated by the rigid exclusion of dimers on the closely packed square lattice. In previous work we considered the analogous problem on the hexagonal lattice, and we extended the set-up to include the correlation of any finite number of monomer clusters. For fairly general classes of monomer clusters we proved that the asymptotics of their correlation is given, for large separations between the clusters, by a multiplicative version of Coulomb's law for 2D electrostatics. However, our previous results required that the monomer clusters consist (with possibly one exception) of an even number of monomers. In this talk we determine the asymptotics of general defect clusters along a lattice diagonal in the square lattice (involving an arbitrary, even or odd number of monomers), and find that it is given by the same Coulomb law. Of special interest is that one obtains a conceptual interpretation for the multiplicative constant, as the product of the correlations of the individual clusters. In addition, we present several applications of the explicit correlation formulas that we obtain.

LP-based Covering Games with Low Price of Anarchy

Series
ACO Student Seminar
Time
Friday, March 16, 2012 - 13:00 for 1 hour (actually 50 minutes)
Location
Executive classroom, ISyE Main Building
Speaker
László VeghCoC, Georgia Tech
I present a new class of vertex cover and set cover games, with the price of anarchy bounds matching the best known constant factor approximation guarantees for the centralized optimization problems for linear and also for submodular costs. In particular, the price of anarchy is 2 for vertex cover. The basic intuition is that the members of the vertex cover form a Mafia that has to "protect" the graph, and may ask ransoms from their neighbors in exchange for the protection. These ransoms turn out to capture a good dual solution to the linear programming relaxation. For linear costs we also exhibit linear time best response dynamics that converge that mimic the classical greedy approximation algorithm of Bar-Yehuda and Even. This is a joint work with Georgios Piliouras and Tomas Valla.

The Beveridge-Nelson decomposition and limit theorems for random linear processes and fields

Series
Stochastics Seminar
Time
Thursday, March 15, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
skyles 006
Speaker
Vygantas PaulauskasVilnius University, Lithuania
In the talk we demonstrate the usefulness of the so-called Beveridge-Nelson decomposition in asymptotic analysis of sums of values of linear processes and fields. We consider several generalizations of this decomposition and discuss advantages and shortcomings of this approach which can be considered as one of possible methods to deal with sums of dependent random variables. This decomposition is derived for linear processes and fields with the continuous time (space) argument. The talk is based on several papers, among them [V. Paulauskas, J. Multivar. Anal. 101, (2010), 621-639] and [Yu. Davydov and V. Paulauskas, Teor. Verojat. Primenen., (2012), to appear]

On a problem of Erd\H{o}s and Rothschild on edges in triangles

Series
Combinatorics Seminar
Time
Thursday, March 15, 2012 - 12:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Po-Shen LohCarnegie Mellon University
Erd\H{o}s and Rothschild asked to estimate the maximum number, denotedby $h(n,c)$, such that every $n$-vertex graph with at least $cn^2$edges, each of which is contained in at least one triangle, mustcontain an edge that is in at least $h(n,c)$ triangles. In particular,Erd\H{o}s asked in 1987 to determine whether for every $c>0$ there is$\epsilon>0$ such that $h(n,c)>n^{\epsilon}$ for all sufficientlylarge $n$. We prove that $h(n,c)=n^{O(1/\log \log n)}$ for every fixed$c<1/4$. This gives a negative answer to the question of Erd\H{o}s,and is best possible in terms of the range for $c$, as it is knownthat every $n$-vertex graph with more than $n^2/4$ edges contains anedge that is in at least $n/6$ triangles.Joint work with Jacob Fox.

Pages