Partitioning and Connectivity
Description Abstract: The most famous and useful characterization of k-connected graphs is Menger's Theorem, but there is another, very nice but little-known characterization of a wholly different...
Description Abstract: The most famous and useful characterization of k-connected graphs is Menger's Theorem, but there is another, very nice but little-known characterization of a wholly different...
Speaker Mihai AnitescuArgonne National Laboratory, Division of Mathematical and Computer Scienceshttp://www.mcs.anl.gov/~anitescu/ Description Complementarity constraints are a very versatile modeling...
SpeakerStephen Damelin IMA University of Minnesotahttp://www.ima.umn.edu/~damelin/ Description Many practical problems in elasticity, vibration, etc., when modeled mathematically, reduce to the matrix...
SpeakerMichael G RoecknerPurdue Universityhttp://www.stat.purdue.edu/people/faculty/roeckner Description We shall first review the connection between ordinary stochastic differential equations (SODE)...
Description The speaker will discuss the main ideas of applying infinite dimensional Morse Theory to find nontrivial solutions for semilinear elliptic boundary value problems.
Description Work with T. Bielecki, Y. LeCam , M Rutkowski We study the different models of credit risk and we present some cases where the hazard process approach is more efficient than the intensity...
Description Archimedean copulas have proven to be remarkably useful for modeling dependence in a variety of settings. In this talk we will survey important aspects of the theory of Archimedean copulas...
Speaker Joe Tribbia Institute for Mathematics Applied to Geosciences, NCAR http://www.cgd.ucar.edu/cdp/gdsstaffwebs/tribbia.htm Description The problem of predicting the future state of the weather...