https://www.math.wisc.edu/wiki/api.php?action=feedcontributions&user=Xshen&feedformat=atomUW-Math Wiki - User contributions [en]2020-11-26T19:38:59ZUser contributionsMediaWiki 1.30.1https://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=20248SIAM Student Chapter Seminar2020-10-28T16:02:39Z<p>Xshen: /* Abstracts */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' 3:30 pm<br />
*'''Where:''' Zoom <br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [mailto:siam-chapter+join@g-groups.wisc.edu siam-chapter+join@g-groups.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|9/29<br />
|Yu Feng (Math)<br />
|''[[#9/29, Yu Feng (Math)|Phase separation in the advective Cahn--Hilliard equation]]''<br />
|-<br />
|-<br />
|10/14<br />
|Dongyu Chen (WPI)<br />
|''[[#10/14, Yuchen Dong (WPI)|A Half-order Numerical Scheme for Nonlinear SDEs with one-sided Lipschitz Drift and H\:{o}lder Continuous Diffusion Coefficients]]''<br />
|-<br />
|-<br />
|10/28<br />
|Evan Sorenson (math)<br />
|''[[#10/28, Evan Sorenson (math)|Unsupervised data classification via Bayesian inference]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== 9/29, Yu Feng (Math) ===<br />
'''Phase separation in the advective Cahn--Hilliard equation'''<br />
<br />
The Cahn--Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn--Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection-hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection-diffusion equation.<br />
<br />
<br />
=== 10/14, Yuchen Dong (WPI) ===<br />
'''A Half-order Numerical Scheme for Nonlinear SDEs with one-sided Lipschitz Drift and Hölder Continuous Diffusion Coefficients'''<br />
<br />
We consider positivity-preserving explicit schemes for one-dimensional nonlinear stochastic differential<br />
equations. The drift coefficients satisfy the one-sided Lipschitz condition, and the diffusion coefficients<br />
are Hölder continuous. To control the fast growth of moments of solutions, we introduce several explicit<br />
schemes including the tamed and truncated Euler schemes. The fundamental idea is to guarantee the<br />
non-negativity of solutions. The proofs rely on the boundedness for negative moments and exponential of<br />
negative moments. We present several numerical schemes for a modified Cox-Ingersoll-Ross model and a<br />
two-factor Heston model and demonstrate their half-order convergence rate.<br />
<br />
<br />
=== 10/28, Evan Sorenson (math) ===<br />
''' Unsupervised data classification via Bayesian inference'''<br />
<br />
Bayesian inference is a way of “updating” our current state of knowledge given some data. In this talk, I will discuss how one can use Bayesian inference to classify data into separate groups. Particularly, I will discuss an application of this to outlier detection in contamination control within semiconductor manufacturing. Time permitting, I will talk about some computational tools for these models.<br />
<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=20247SIAM Student Chapter Seminar2020-10-28T16:01:57Z<p>Xshen: /* Fall 2020 */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' 3:30 pm<br />
*'''Where:''' Zoom <br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [mailto:siam-chapter+join@g-groups.wisc.edu siam-chapter+join@g-groups.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|9/29<br />
|Yu Feng (Math)<br />
|''[[#9/29, Yu Feng (Math)|Phase separation in the advective Cahn--Hilliard equation]]''<br />
|-<br />
|-<br />
|10/14<br />
|Dongyu Chen (WPI)<br />
|''[[#10/14, Yuchen Dong (WPI)|A Half-order Numerical Scheme for Nonlinear SDEs with one-sided Lipschitz Drift and H\:{o}lder Continuous Diffusion Coefficients]]''<br />
|-<br />
|-<br />
|10/28<br />
|Evan Sorenson (math)<br />
|''[[#10/28, Evan Sorenson (math)|Unsupervised data classification via Bayesian inference]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== 9/29, Yu Feng (Math) ===<br />
'''Phase separation in the advective Cahn--Hilliard equation'''<br />
<br />
The Cahn--Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn--Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection-hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection-diffusion equation.<br />
<br />
<br />
=== 10/14, Yuchen Dong (WPI) ===<br />
'''A Half-order Numerical Scheme for Nonlinear SDEs with one-sided Lipschitz Drift and Hölder Continuous Diffusion Coefficients'''<br />
<br />
We consider positivity-preserving explicit schemes for one-dimensional nonlinear stochastic differential<br />
equations. The drift coefficients satisfy the one-sided Lipschitz condition, and the diffusion coefficients<br />
are Hölder continuous. To control the fast growth of moments of solutions, we introduce several explicit<br />
schemes including the tamed and truncated Euler schemes. The fundamental idea is to guarantee the<br />
non-negativity of solutions. The proofs rely on the boundedness for negative moments and exponential of<br />
negative moments. We present several numerical schemes for a modified Cox-Ingersoll-Ross model and a<br />
two-factor Heston model and demonstrate their half-order convergence rate.<br />
<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=20119SIAM Student Chapter Seminar2020-10-13T02:24:26Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' 3:30 pm<br />
*'''Where:''' Zoom <br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [mailto:siam-chapter+join@g-groups.wisc.edu siam-chapter+join@g-groups.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|9/29<br />
|Yu Feng (Math)<br />
|''[[#9/29, Yu Feng (Math)|Phase separation in the advective Cahn--Hilliard equation]]''<br />
|-<br />
|-<br />
|10/14<br />
|Dongyu Chen (WPI)<br />
|''[[#10/14, Yuchen Dong (WPI)|A Half-order Numerical Scheme for Nonlinear SDEs with one-sided Lipschitz Drift and H\:{o}lder Continuous Diffusion Coefficients]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== 9/29, Yu Feng (Math) ===<br />
'''Phase separation in the advective Cahn--Hilliard equation'''<br />
<br />
The Cahn--Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn--Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection-hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection-diffusion equation.<br />
<br />
<br />
=== 10/14, Yuchen Dong (WPI) ===<br />
'''A Half-order Numerical Scheme for Nonlinear SDEs with one-sided Lipschitz Drift and Hölder Continuous Diffusion Coefficients'''<br />
<br />
We consider positivity-preserving explicit schemes for one-dimensional nonlinear stochastic differential<br />
equations. The drift coefficients satisfy the one-sided Lipschitz condition, and the diffusion coefficients<br />
are Hölder continuous. To control the fast growth of moments of solutions, we introduce several explicit<br />
schemes including the tamed and truncated Euler schemes. The fundamental idea is to guarantee the<br />
non-negativity of solutions. The proofs rely on the boundedness for negative moments and exponential of<br />
negative moments. We present several numerical schemes for a modified Cox-Ingersoll-Ross model and a<br />
two-factor Heston model and demonstrate their half-order convergence rate.<br />
<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=20118SIAM Student Chapter Seminar2020-10-13T02:23:22Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' 3:30 pm<br />
*'''Where:''' Zoom <br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [mailto:siam-chapter+join@g-groups.wisc.edu siam-chapter+join@g-groups.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|9/29<br />
|Yu Feng (Math)<br />
|''[[#9/29, Yu Feng (Math)|Phase separation in the advective Cahn--Hilliard equation]]''<br />
|-<br />
|-<br />
|9/29<br />
|Dongyu Chen (WPI)<br />
|''[[#10/14, Dongyu Chen (WPI)|A Half-order Numerical Scheme for Nonlinear SDEs with one-sided Lipschitz Drift and H\:{o}lder Continuous Diffusion Coefficients]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== 9/29, Yu Feng (Math) ===<br />
'''Phase separation in the advective Cahn--Hilliard equation'''<br />
<br />
The Cahn--Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn--Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection-hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection-diffusion equation.<br />
<br />
<br />
=== 10/14, Yu Feng (Math) ===<br />
'''A Half-order Numerical Scheme for Nonlinear SDEs with one-sided Lipschitz Drift and Hölder Continuous Diffusion Coefficients'''<br />
<br />
We consider positivity-preserving explicit schemes for one-dimensional nonlinear stochastic differential<br />
equations. The drift coefficients satisfy the one-sided Lipschitz condition, and the diffusion coefficients<br />
are Hölder continuous. To control the fast growth of moments of solutions, we introduce several explicit<br />
schemes including the tamed and truncated Euler schemes. The fundamental idea is to guarantee the<br />
non-negativity of solutions. The proofs rely on the boundedness for negative moments and exponential of<br />
negative moments. We present several numerical schemes for a modified Cox-Ingersoll-Ross model and a<br />
two-factor Heston model and demonstrate their half-order convergence rate.<br />
<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=20029SIAM Student Chapter Seminar2020-09-29T17:53:04Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' 3:30 pm<br />
*'''Where:''' Zoom <br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [mailto:siam-chapter+join@g-groups.wisc.edu siam-chapter+join@g-groups.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|9/29<br />
|Yu Feng (Math)<br />
|''[[#9/29, Yu Feng (Math)|Phase separation in the advective Cahn--Hilliard equation]]''<br />
|-<br />
|-<br />
<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== 9/29, Yu Feng (Math) ===<br />
'''Phase separation in the advective Cahn--Hilliard equation'''<br />
<br />
The Cahn--Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn--Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection-hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection-diffusion equation.<br />
<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=20028SIAM Student Chapter Seminar2020-09-29T17:52:12Z<p>Xshen: /* Abstracts */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' TBA<br />
*'''Where:''' Zoom<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [mailto:siam-chapter+join@g-groups.wisc.edu siam-chapter+join@g-groups.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|9/29<br />
|Yu Feng (Math)<br />
|''[[#9/29, Yu Feng (Math)|Phase separation in the advective Cahn--Hilliard equation]]''<br />
|-<br />
|-<br />
<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== 9/29, Yu Feng (Math) ===<br />
'''Phase separation in the advective Cahn--Hilliard equation'''<br />
<br />
The Cahn--Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn--Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection-hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection-diffusion equation.<br />
<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=20027SIAM Student Chapter Seminar2020-09-29T17:52:05Z<p>Xshen: /* Fall 2020 */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' TBA<br />
*'''Where:''' Zoom<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [mailto:siam-chapter+join@g-groups.wisc.edu siam-chapter+join@g-groups.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|9/29<br />
|Yu Feng (Math)<br />
|''[[#9/29, Yu Feng (Math)|Phase separation in the advective Cahn--Hilliard equation]]''<br />
|-<br />
|-<br />
<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== TBA, Yu Feng (Math) ===<br />
'''Phase separation in the advective Cahn--Hilliard equation'''<br />
<br />
The Cahn--Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn--Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection-hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection-diffusion equation.<br />
<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=20026SIAM Student Chapter Seminar2020-09-29T17:51:51Z<p>Xshen: /* Fall 2020 */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' TBA<br />
*'''Where:''' Zoom<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [mailto:siam-chapter+join@g-groups.wisc.edu siam-chapter+join@g-groups.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|TBA<br />
|Yu Feng (Math)<br />
|''[[#9/29, Yu Feng (Math)|Phase separation in the advective Cahn--Hilliard equation]]''<br />
|-<br />
|-<br />
<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== TBA, Yu Feng (Math) ===<br />
'''Phase separation in the advective Cahn--Hilliard equation'''<br />
<br />
The Cahn--Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn--Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection-hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection-diffusion equation.<br />
<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=19867SIAM Student Chapter Seminar2020-09-18T05:18:35Z<p>Xshen: /* Fall 2020 */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' TBA<br />
*'''Where:''' Zoom<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|TBA<br />
|Yu Feng (Math)<br />
|''[[#TBA, Yu Feng (Math)|Phase separation in the advective Cahn--Hilliard equation]]''<br />
|-<br />
|-<br />
<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== TBA, Yu Feng (Math) ===<br />
'''Phase separation in the advective Cahn--Hilliard equation'''<br />
<br />
The Cahn--Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn--Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection-hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection-diffusion equation.<br />
<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=19866SIAM Student Chapter Seminar2020-09-18T05:18:18Z<p>Xshen: /* Fall 2020 */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' TBA<br />
*'''Where:''' Zoom<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Jan 31<br />
|Yu Feng (Math)<br />
|''[[#TBA, Yu Feng (Math)|Phase separation in the advective Cahn--Hilliard equation]]''<br />
|-<br />
|-<br />
<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== TBA, Yu Feng (Math) ===<br />
'''Phase separation in the advective Cahn--Hilliard equation'''<br />
<br />
The Cahn--Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn--Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection-hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection-diffusion equation.<br />
<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=19865SIAM Student Chapter Seminar2020-09-18T05:17:54Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' TBA<br />
*'''Where:''' Zoom<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Jan 31<br />
|[Yu Feng] (Math)<br />
|''[[#TBA, Yu Feng (Math)|Phase separation in the advective Cahn--Hilliard equation]]''<br />
|-<br />
|-<br />
<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== TBA, Yu Feng (Math) ===<br />
'''Phase separation in the advective Cahn--Hilliard equation'''<br />
<br />
The Cahn--Hilliard equation is a classic model of phase separation in binary mixtures that exhibits spontaneous coarsening of the phases. We study the Cahn--Hilliard equation with an imposed advection term in order to model the stirring and eventual mixing of the phases. The main result is that if the imposed advection is sufficiently mixing then no phase separation occurs, and the solution instead converges exponentially to a homogeneous mixed state. The mixing effectiveness of the imposed drift is quantified in terms of the dissipation time of the associated advection-hyperdiffusion equation, and we produce examples of velocity fields with a small dissipation time. We also study the relationship between this quantity and the dissipation time of the standard advection-diffusion equation.<br />
<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar/Spring2020&diff=19864SIAM Student Chapter Seminar/Spring20202020-09-18T05:12:51Z<p>Xshen: Created page with "__NOTOC__ *'''When:''' Every other Friday at 1:30 pm *'''Where:''' B333 Van Vleck Hall *'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen] *'''Faculty advisers:''..."</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Every other Friday at 1:30 pm<br />
*'''Where:''' B333 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Spring 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Jan 31<br />
|[https://lorenzonajt.github.io/ Lorenzo Najt] (Math)<br />
|''[[#Jan 31, Lorenzo Najt (Math)|Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges]]''<br />
|-<br />
|-<br />
|Feb 14<br />
|[https://www.math.wisc.edu/~pollyyu/ Polly Yu] (Math)<br />
|''[[#Feb 14, Polly Yu (Math)|Algebra, Dynamics, and Chemistry with Delay Differential Equations]]''<br />
|-<br />
|-<br />
|Feb 21<br />
|Gage Bonner (Physics)<br />
|''[[#Feb 21, Gage Bonner (Physics)|Growth of history-dependent random sequences]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Jan 31, Lorenzo Najt (Math) ===<br />
'''Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges'''<br />
<br />
We will review some recent work regarding measuring gerrymandering by sampling from the space of maps, including two methods used in a recent amicus brief to the supreme court. This discussion will highlight some of the computational challenges of this approach, including some complexity-theory lower bounds and bottlenecks in Markov chains. We will examine the robustness of these statistical methods through their connection to phase transitions in the self-avoiding walk model, as well as their dependence on artifacts of discretization. This talk is largely based on https://arxiv.org/abs/1908.08881<br />
<br />
=== Feb 14, Polly Yu (Math) ===<br />
'''Algebra, Dynamics, and Chemistry with Delay Differential Equations'''<br />
<br />
Delay differential equations (DDEs) can exhibit more complicated behavior than their ODE counterparts. What is stable in the ODE setting could exhibit oscillation in DDE. Where do delay equations show up anyway? In this talk, we’ll introduce DDEs, and how (sort-of-)linear algebra gives information about the stability of DDEs.<br />
<br />
<br />
=== Feb 21, Gage Bonner (Physics) ===<br />
''' Growth of history-dependent random sequences'''<br />
<br />
Unlike discrete Markov chains, history-dependent random sequences are sequences of random variables whose "next" term depends on all others seen previously. For this reason, they can be difficult to analyze. I will discuss some simple and fun cases where the long-term behavior of the sequence can be computed explicitly in expectation.<br />
<br />
<br />
<br></div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=19863SIAM Student Chapter Seminar2020-09-18T05:12:43Z<p>Xshen: /* Past Semesters */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Every other Friday at 1:30 pm<br />
*'''Where:''' B333 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Spring 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Jan 31<br />
|[https://lorenzonajt.github.io/ Lorenzo Najt] (Math)<br />
|''[[#Jan 31, Lorenzo Najt (Math)|Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges]]''<br />
|-<br />
|-<br />
|Feb 14<br />
|[https://www.math.wisc.edu/~pollyyu/ Polly Yu] (Math)<br />
|''[[#Feb 14, Polly Yu (Math)|Algebra, Dynamics, and Chemistry with Delay Differential Equations]]''<br />
|-<br />
|-<br />
|Feb 21<br />
|Gage Bonner (Physics)<br />
|''[[#Feb 21, Gage Bonner (Physics)|Growth of history-dependent random sequences]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Jan 31, Lorenzo Najt (Math) ===<br />
'''Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges'''<br />
<br />
We will review some recent work regarding measuring gerrymandering by sampling from the space of maps, including two methods used in a recent amicus brief to the supreme court. This discussion will highlight some of the computational challenges of this approach, including some complexity-theory lower bounds and bottlenecks in Markov chains. We will examine the robustness of these statistical methods through their connection to phase transitions in the self-avoiding walk model, as well as their dependence on artifacts of discretization. This talk is largely based on https://arxiv.org/abs/1908.08881<br />
<br />
=== Feb 14, Polly Yu (Math) ===<br />
'''Algebra, Dynamics, and Chemistry with Delay Differential Equations'''<br />
<br />
Delay differential equations (DDEs) can exhibit more complicated behavior than their ODE counterparts. What is stable in the ODE setting could exhibit oscillation in DDE. Where do delay equations show up anyway? In this talk, we’ll introduce DDEs, and how (sort-of-)linear algebra gives information about the stability of DDEs.<br />
<br />
<br />
=== Feb 21, Gage Bonner (Physics) ===<br />
''' Growth of history-dependent random sequences'''<br />
<br />
Unlike discrete Markov chains, history-dependent random sequences are sequences of random variables whose "next" term depends on all others seen previously. For this reason, they can be difficult to analyze. I will discuss some simple and fun cases where the long-term behavior of the sequence can be computed explicitly in expectation.<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2020|Spring 2020]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar/Spring2019&diff=19862SIAM Student Chapter Seminar/Spring20192020-09-18T05:11:55Z<p>Xshen: Created page with "__NOTOC__ *'''When:''' Every other Friday at 1:30 pm *'''Where:''' B333 Van Vleck Hall *'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen] *'''Faculty advisers:''..."</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Every other Friday at 1:30 pm<br />
*'''Where:''' B333 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Spring 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Jan 31<br />
|[https://lorenzonajt.github.io/ Lorenzo Najt] (Math)<br />
|''[[#Jan 31, Lorenzo Najt (Math)|Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges]]''<br />
|-<br />
|-<br />
|Feb 14<br />
|[https://www.math.wisc.edu/~pollyyu/ Polly Yu] (Math)<br />
|''[[#Feb 14, Polly Yu (Math)|Algebra, Dynamics, and Chemistry with Delay Differential Equations]]''<br />
|-<br />
|-<br />
|Feb 21<br />
|Gage Bonner (Physics)<br />
|''[[#Feb 21, Gage Bonner (Physics)|Growth of history-dependent random sequences]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Jan 31, Lorenzo Najt (Math) ===<br />
'''Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges'''<br />
<br />
We will review some recent work regarding measuring gerrymandering by sampling from the space of maps, including two methods used in a recent amicus brief to the supreme court. This discussion will highlight some of the computational challenges of this approach, including some complexity-theory lower bounds and bottlenecks in Markov chains. We will examine the robustness of these statistical methods through their connection to phase transitions in the self-avoiding walk model, as well as their dependence on artifacts of discretization. This talk is largely based on https://arxiv.org/abs/1908.08881<br />
<br />
=== Feb 14, Polly Yu (Math) ===<br />
'''Algebra, Dynamics, and Chemistry with Delay Differential Equations'''<br />
<br />
Delay differential equations (DDEs) can exhibit more complicated behavior than their ODE counterparts. What is stable in the ODE setting could exhibit oscillation in DDE. Where do delay equations show up anyway? In this talk, we’ll introduce DDEs, and how (sort-of-)linear algebra gives information about the stability of DDEs.<br />
<br />
<br />
=== Feb 21, Gage Bonner (Physics) ===<br />
''' Growth of history-dependent random sequences'''<br />
<br />
Unlike discrete Markov chains, history-dependent random sequences are sequences of random variables whose "next" term depends on all others seen previously. For this reason, they can be difficult to analyze. I will discuss some simple and fun cases where the long-term behavior of the sequence can be computed explicitly in expectation.<br />
<br />
<br />
<br></div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar/Fall2019&diff=19861SIAM Student Chapter Seminar/Fall20192020-09-18T05:11:32Z<p>Xshen: Undo revision 19859 by Xshen (talk)</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Most Friday at 11:30am<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|-<br />
|Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
|Oct. 25 <br />
|Max (Math)<br />
|''[[#Oct 25: Max (Math)|Coalescent with Recombination]]''<br />
|<br />
|-<br />
|-<br />
|Nov. 8<br />
|Hongfei Chen (Math)<br />
|''[[#Nov 15: Hongfei Chen (Math)| Brownian swimmers in a channel]]''<br />
|<br />
|-<br />
|-<br />
|Dec. 10<br />
|[http://www.maths.manchester.ac.uk/~higham/ Nicholas J. Higham] (University of Manchester)<br />
|''[[#Dec 10: Nicholas J. Higham (University of Manchester)|Scientific Writing]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25: Max (Math) ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
=== Nov 15: Hongfei Chen (Math) ===<br />
'''Brownian swimmers in a channel'''<br />
<br />
Abstract: Shape matters! I will talk about how their shapes affect their mean reversal time.<br />
<br />
=== Dec 10: Nicholas J. Higham (University of Manchester) ===<br />
'''Scientific Writing'''<br />
<br />
I will discuss various aspects of scientific writing, including<br />
<br />
• the craft of writing in general,<br />
<br />
• aspects specific to mathematical writing,<br />
<br />
• English Usage,<br />
<br />
• workflow, and<br />
<br />
• revising drafts and proofreading.<br />
<br />
Plenty of examples and links to further information will be given. I will also discuss<br />
my experiences in preparing ''Handbook of Writing for the Mathematical Sciences'' (third<br />
edition, SIAM, 2020).<br />
<br />
<br />
<br></div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=19860SIAM Student Chapter Seminar2020-09-18T05:10:58Z<p>Xshen: /* Past Semesters */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Every other Friday at 1:30 pm<br />
*'''Where:''' B333 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Spring 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Jan 31<br />
|[https://lorenzonajt.github.io/ Lorenzo Najt] (Math)<br />
|''[[#Jan 31, Lorenzo Najt (Math)|Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges]]''<br />
|-<br />
|-<br />
|Feb 14<br />
|[https://www.math.wisc.edu/~pollyyu/ Polly Yu] (Math)<br />
|''[[#Feb 14, Polly Yu (Math)|Algebra, Dynamics, and Chemistry with Delay Differential Equations]]''<br />
|-<br />
|-<br />
|Feb 21<br />
|Gage Bonner (Physics)<br />
|''[[#Feb 21, Gage Bonner (Physics)|Growth of history-dependent random sequences]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Jan 31, Lorenzo Najt (Math) ===<br />
'''Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges'''<br />
<br />
We will review some recent work regarding measuring gerrymandering by sampling from the space of maps, including two methods used in a recent amicus brief to the supreme court. This discussion will highlight some of the computational challenges of this approach, including some complexity-theory lower bounds and bottlenecks in Markov chains. We will examine the robustness of these statistical methods through their connection to phase transitions in the self-avoiding walk model, as well as their dependence on artifacts of discretization. This talk is largely based on https://arxiv.org/abs/1908.08881<br />
<br />
=== Feb 14, Polly Yu (Math) ===<br />
'''Algebra, Dynamics, and Chemistry with Delay Differential Equations'''<br />
<br />
Delay differential equations (DDEs) can exhibit more complicated behavior than their ODE counterparts. What is stable in the ODE setting could exhibit oscillation in DDE. Where do delay equations show up anyway? In this talk, we’ll introduce DDEs, and how (sort-of-)linear algebra gives information about the stability of DDEs.<br />
<br />
<br />
=== Feb 21, Gage Bonner (Physics) ===<br />
''' Growth of history-dependent random sequences'''<br />
<br />
Unlike discrete Markov chains, history-dependent random sequences are sequences of random variables whose "next" term depends on all others seen previously. For this reason, they can be difficult to analyze. I will discuss some simple and fun cases where the long-term behavior of the sequence can be computed explicitly in expectation.<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Spring2019|Spring 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar/Fall2019&diff=19859SIAM Student Chapter Seminar/Fall20192020-09-18T05:09:20Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Every other Friday at 1:30 pm<br />
*'''Where:''' B333 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Spring 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Jan 31<br />
|[https://lorenzonajt.github.io/ Lorenzo Najt] (Math)<br />
|''[[#Jan 31, Lorenzo Najt (Math)|Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges]]''<br />
|-<br />
|-<br />
|Feb 14<br />
|[https://www.math.wisc.edu/~pollyyu/ Polly Yu] (Math)<br />
|''[[#Feb 14, Polly Yu (Math)|Algebra, Dynamics, and Chemistry with Delay Differential Equations]]''<br />
|-<br />
|-<br />
|Feb 21<br />
|Gage Bonner (Physics)<br />
|''[[#Feb 21, Gage Bonner (Physics)|Growth of history-dependent random sequences]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Jan 31, Lorenzo Najt (Math) ===<br />
'''Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges'''<br />
<br />
We will review some recent work regarding measuring gerrymandering by sampling from the space of maps, including two methods used in a recent amicus brief to the supreme court. This discussion will highlight some of the computational challenges of this approach, including some complexity-theory lower bounds and bottlenecks in Markov chains. We will examine the robustness of these statistical methods through their connection to phase transitions in the self-avoiding walk model, as well as their dependence on artifacts of discretization. This talk is largely based on https://arxiv.org/abs/1908.08881<br />
<br />
=== Feb 14, Polly Yu (Math) ===<br />
'''Algebra, Dynamics, and Chemistry with Delay Differential Equations'''<br />
<br />
Delay differential equations (DDEs) can exhibit more complicated behavior than their ODE counterparts. What is stable in the ODE setting could exhibit oscillation in DDE. Where do delay equations show up anyway? In this talk, we’ll introduce DDEs, and how (sort-of-)linear algebra gives information about the stability of DDEs.<br />
<br />
<br />
=== Feb 21, Gage Bonner (Physics) ===<br />
''' Growth of history-dependent random sequences'''<br />
<br />
Unlike discrete Markov chains, history-dependent random sequences are sequences of random variables whose "next" term depends on all others seen previously. For this reason, they can be difficult to analyze. I will discuss some simple and fun cases where the long-term behavior of the sequence can be computed explicitly in expectation.<br />
<br />
<br />
<br></div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=19858SIAM Student Chapter Seminar2020-09-18T05:08:46Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Every other Friday at 1:30 pm<br />
*'''Where:''' B333 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Spring 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Jan 31<br />
|[https://lorenzonajt.github.io/ Lorenzo Najt] (Math)<br />
|''[[#Jan 31, Lorenzo Najt (Math)|Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges]]''<br />
|-<br />
|-<br />
|Feb 14<br />
|[https://www.math.wisc.edu/~pollyyu/ Polly Yu] (Math)<br />
|''[[#Feb 14, Polly Yu (Math)|Algebra, Dynamics, and Chemistry with Delay Differential Equations]]''<br />
|-<br />
|-<br />
|Feb 21<br />
|Gage Bonner (Physics)<br />
|''[[#Feb 21, Gage Bonner (Physics)|Growth of history-dependent random sequences]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Jan 31, Lorenzo Najt (Math) ===<br />
'''Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges'''<br />
<br />
We will review some recent work regarding measuring gerrymandering by sampling from the space of maps, including two methods used in a recent amicus brief to the supreme court. This discussion will highlight some of the computational challenges of this approach, including some complexity-theory lower bounds and bottlenecks in Markov chains. We will examine the robustness of these statistical methods through their connection to phase transitions in the self-avoiding walk model, as well as their dependence on artifacts of discretization. This talk is largely based on https://arxiv.org/abs/1908.08881<br />
<br />
=== Feb 14, Polly Yu (Math) ===<br />
'''Algebra, Dynamics, and Chemistry with Delay Differential Equations'''<br />
<br />
Delay differential equations (DDEs) can exhibit more complicated behavior than their ODE counterparts. What is stable in the ODE setting could exhibit oscillation in DDE. Where do delay equations show up anyway? In this talk, we’ll introduce DDEs, and how (sort-of-)linear algebra gives information about the stability of DDEs.<br />
<br />
<br />
=== Feb 21, Gage Bonner (Physics) ===<br />
''' Growth of history-dependent random sequences'''<br />
<br />
Unlike discrete Markov chains, history-dependent random sequences are sequences of random variables whose "next" term depends on all others seen previously. For this reason, they can be difficult to analyze. I will discuss some simple and fun cases where the long-term behavior of the sequence can be computed explicitly in expectation.<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Spring 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=19077SIAM Student Chapter Seminar2020-02-20T17:47:02Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Every other Friday at 1:30 pm<br />
*'''Where:''' B333 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Spring 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Jan 31<br />
|[https://lorenzonajt.github.io/ Lorenzo Najt] (Math)<br />
|''[[#Jan 31, Lorenzo Najt (Math)|Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges]]''<br />
|-<br />
|-<br />
|Feb 14<br />
|[https://www.math.wisc.edu/~pollyyu/ Polly Yu] (Math)<br />
|''[[#Feb 14, Polly Yu (Math)|Algebra, Dynamics, and Chemistry with Delay Differential Equations]]''<br />
|-<br />
|-<br />
|Feb 21<br />
|Gage Bonner (Physics)<br />
|''[[#Feb 21, Gage Bonner (Physics)|Growth of history-dependent random sequences]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Jan 31, Lorenzo Najt (Math) ===<br />
'''Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges'''<br />
<br />
We will review some recent work regarding measuring gerrymandering by sampling from the space of maps, including two methods used in a recent amicus brief to the supreme court. This discussion will highlight some of the computational challenges of this approach, including some complexity-theory lower bounds and bottlenecks in Markov chains. We will examine the robustness of these statistical methods through their connection to phase transitions in the self-avoiding walk model, as well as their dependence on artifacts of discretization. This talk is largely based on https://arxiv.org/abs/1908.08881<br />
<br />
=== Feb 14, Polly Yu (Math) ===<br />
'''Algebra, Dynamics, and Chemistry with Delay Differential Equations'''<br />
<br />
Delay differential equations (DDEs) can exhibit more complicated behavior than their ODE counterparts. What is stable in the ODE setting could exhibit oscillation in DDE. Where do delay equations show up anyway? In this talk, we’ll introduce DDEs, and how (sort-of-)linear algebra gives information about the stability of DDEs.<br />
<br />
<br />
=== Feb 21, Gage Bonner (Physics) ===<br />
''' Growth of history-dependent random sequences'''<br />
<br />
Unlike discrete Markov chains, history-dependent random sequences are sequences of random variables whose "next" term depends on all others seen previously. For this reason, they can be difficult to analyze. I will discuss some simple and fun cases where the long-term behavior of the sequence can be computed explicitly in expectation.<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=19076SIAM Student Chapter Seminar2020-02-20T17:46:02Z<p>Xshen: /* Spring 2020 */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Every other Friday at 1:30 pm<br />
*'''Where:''' B333 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Spring 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Jan 31<br />
|[https://lorenzonajt.github.io/ Lorenzo Najt] (Math)<br />
|''[[#Jan 31, Lorenzo Najt (Math)|Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges]]''<br />
|-<br />
|-<br />
|Feb 14<br />
|[https://www.math.wisc.edu/~pollyyu/ Polly Yu] (Math)<br />
|''[[#Feb 14, Polly Yu (Math)|Algebra, Dynamics, and Chemistry with Delay Differential Equations]]''<br />
|-<br />
|-<br />
|Feb 21<br />
|Gage Bonner (Physics)<br />
|''[[#Feb 21, Gage Bonner (Physics)|Growth of history-dependent random sequences]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Jan 31, Lorenzo Najt (Math) ===<br />
'''Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges'''<br />
<br />
We will review some recent work regarding measuring gerrymandering by sampling from the space of maps, including two methods used in a recent amicus brief to the supreme court. This discussion will highlight some of the computational challenges of this approach, including some complexity-theory lower bounds and bottlenecks in Markov chains. We will examine the robustness of these statistical methods through their connection to phase transitions in the self-avoiding walk model, as well as their dependence on artifacts of discretization. This talk is largely based on https://arxiv.org/abs/1908.08881<br />
<br />
=== Feb 14, Polly Yu (Math) ===<br />
'''Algebra, Dynamics, and Chemistry with Delay Differential Equations'''<br />
<br />
Delay differential equations (DDEs) can exhibit more complicated behavior than their ODE counterparts. What is stable in the ODE setting could exhibit oscillation in DDE. Where do delay equations show up anyway? In this talk, we’ll introduce DDEs, and how (sort-of-)linear algebra gives information about the stability of DDEs.<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=19016SIAM Student Chapter Seminar2020-02-13T17:11:41Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Every other Friday at 1:30 pm<br />
*'''Where:''' B333 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Spring 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Jan 31<br />
|[https://lorenzonajt.github.io/ Lorenzo Najt] (Math)<br />
|''[[#Jan 31, Lorenzo Najt (Math)|Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges]]''<br />
|-<br />
|-<br />
|Feb 14<br />
|[https://www.math.wisc.edu/~pollyyu/ Polly Yu] (Math)<br />
|''[[#Feb 14, Polly Yu (Math)|Algebra, Dynamics, and Chemistry with Delay Differential Equations]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Jan 31, Lorenzo Najt (Math) ===<br />
'''Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges'''<br />
<br />
We will review some recent work regarding measuring gerrymandering by sampling from the space of maps, including two methods used in a recent amicus brief to the supreme court. This discussion will highlight some of the computational challenges of this approach, including some complexity-theory lower bounds and bottlenecks in Markov chains. We will examine the robustness of these statistical methods through their connection to phase transitions in the self-avoiding walk model, as well as their dependence on artifacts of discretization. This talk is largely based on https://arxiv.org/abs/1908.08881<br />
<br />
=== Feb 14, Polly Yu (Math) ===<br />
'''Algebra, Dynamics, and Chemistry with Delay Differential Equations'''<br />
<br />
Delay differential equations (DDEs) can exhibit more complicated behavior than their ODE counterparts. What is stable in the ODE setting could exhibit oscillation in DDE. Where do delay equations show up anyway? In this talk, we’ll introduce DDEs, and how (sort-of-)linear algebra gives information about the stability of DDEs.<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=AMS_Student_Chapter_Seminar&diff=18959AMS Student Chapter Seminar2020-02-09T00:35:00Z<p>Xshen: /* February 12, Xiao Shen */</p>
<hr />
<div>The AMS Student Chapter Seminar (aka Donut Seminar) is an informal, graduate student seminar on a wide range of mathematical topics. Pastries (usually donuts) will be provided.<br />
<br />
* '''When:''' Wednesdays, 3:20 PM – 3:50 PM<br />
* '''Where:''' Van Vleck, 9th floor lounge (unless otherwise announced)<br />
* '''Organizers:''' [https://www.math.wisc.edu/~malexis/ Michel Alexis], [https://www.math.wisc.edu/~drwagner/ David Wagner], [http://www.math.wisc.edu/~nicodemus/ Patrick Nicodemus], [http://www.math.wisc.edu/~thaison/ Son Tu], Carrie Chen<br />
<br />
Everyone is welcome to give a talk. To sign up, please contact one of the organizers with a title and abstract. Talks are 25 minutes long and should avoid assuming significant mathematical background beyond first-year graduate courses.<br />
<br />
The schedule of talks from past semesters can be found [[AMS Student Chapter Seminar, previous semesters|here]].<br />
<br />
== Spring 2020 ==<br />
<br />
=== February 5, Alex Mine===<br />
<br />
Title: Khinchin's Constant<br />
<br />
Abstract: I'll talk about a really weird fact about continued fractions.<br />
<br />
=== February 12, Xiao Shen===<br />
<br />
Title: Coalescence estimates for the corner growth model with exponential weights<br />
<br />
Abstract: (Joint with Timo Seppalainen) I will talk about estimates for the coalescence time of semi-infinite directed geodesics in the planar corner growth model. Not much probability background is needed.<br />
<br />
=== February 19, Hyun Jong Kim===<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
=== February 26, Solly Parenti===<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
=== March 4, Ying Li===<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
=== March 11, Ivan Aidun===<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
=== March 24 - Visit Day===<br />
<br />
==== Brandon Boggess, Time TBD====<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
==== TBD, Time TBD====<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
==== TBD, Time TBD====<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
==== TBD, Time TBD====<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
==== TBD, Time TBD====<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
==== TBD, Time TBD====<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
==== TBD, Time TBD====<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
==== TBD, Time TBD====<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
==== TBD, Time TBD====<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
=== April 1, TBD===<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
=== April 8, TBD===<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
=== April 15, TBD===<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
=== April 22, TBD===<br />
<br />
Title: TBD<br />
<br />
Abstract: TBD<br />
<br />
== Fall 2019 ==<br />
<br />
=== October 9, Brandon Boggess===<br />
<br />
Title: An Application of Elliptic Curves to the Theory of Internet Memes<br />
<br />
Abstract: Solve polynomial equations with this one weird trick! Math teachers hate him!!!<br />
<br />
[[File:Thumbnail fruit meme.png]]<br />
<br />
=== October 16, Jiaxin Jin===<br />
<br />
Title: Persistence and global stability for biochemical reaction-diffusion systems<br />
<br />
Abstract: The investigation of the dynamics of solutions of nonlinear reaction-diffusion PDE systems generated by biochemical networks is a great challenge; in general, even the existence of classical solutions is difficult to establish. On the other hand, these kinds of problems appear very often in biological applications, e.g., when trying to understand the role of spatial inhomogeneities in living cells. We discuss the persistence and global stability properties of special classes of such systems, under additional assumptions such as: low number of species, complex balance or weak reversibility.<br />
<br />
=== October 23, Erika Pirnes===<br />
<br />
(special edition: carrot seminar)<br />
<br />
Title: Why do ice hockey players fall in love with mathematicians? (Behavior of certain number string sequences)<br />
<br />
Abstract: Starting with some string of digits 0-9, add the adjacent numbers pairwise to obtain a new string. Whenever the sum is 10 or greater, separate its digits. For example, 26621 would become 81283 and then 931011. Repeating this process with different inputs gives varying behavior. In some cases the process terminates (becomes a single digit), or ends up in a loop, like 999, 1818, 999... The length of the strings can also start growing very fast. I'll discuss some data and conjectures about classifying the behavior.<br />
<br />
=== October 30, Yunbai Cao===<br />
<br />
Title: Kinetic theory in bounded domains<br />
<br />
Abstract: In 1900, David Hilbert outlined 23 important problems in the International Congress of Mathematics. One of them is the Hilbert's sixth problem which asks the mathematical linkage between the mechanics from microscopic view and the macroscopic view. A relative new mesoscopic point of view at that time which is "kinetic theory" was highlighted by Hilbert as the bridge to link the two. In this talk, I will talk about the history and basic elements of kinetic theory and Boltzmann equation, and the role boundary plays for such a system, as well as briefly mention some recent progress.<br />
<br />
=== November 6, Tung Nguyen===<br />
<br />
Title: Introduction to Chemical Reaction Network<br />
<br />
Abstract: Reaction network models are often used to investigate the dynamics of different species from various branches of chemistry, biology and ecology. The study of reaction network has grown significantly and involves a wide range of mathematics and applications. In this talk, I aim to show a big picture of what is happening in reaction network theory. I will first introduce the basic dynamical models for reaction network: the deterministic and stochastic models. Then, I will mention some big questions of interest, and the mathematical tools that are used by people in the field. Finally, I will make connection between reaction network and other branches of mathematics such as PDE, control theory, and random graph theory.<br />
<br />
=== November 13, Jane Davis===<br />
<br />
Title: Brownian Minions<br />
<br />
Abstract: Having lots of small minions help you perform a task is often very effective. For example, if you need to grade a large stack of calculus problems, it is effective to have several TAs grade parts of the pile for you. We'll talk about how we can use random motions as minions to help us perform mathematical tasks. Typically, this mathematical task would be optimization, but we'll reframe a little bit and focus on art and beauty instead. We'll also try to talk about the so-called "storytelling metric," which is relevant here. There will be pictures and animations! 🎉<br />
<br />
Sneak preview: some modern art generated with MATLAB.<br />
<br />
[[File:Picpic.jpg]]<br />
<br />
=== November 20, Colin Crowley===<br />
<br />
Title: Matroid Bingo<br />
<br />
Abstract: Matroids are combinatorial objects that generalize graphs and matrices. The famous combinatorialist Gian Carlo Rota once said that "anyone who has worked with matroids has come away with the conviction that matroids are one of the richest and most useful ideas of our day." Although his day was in the 60s and 70s, matroids remain an active area of current research with connections to areas such as algebraic geometry, tropical geometry, and parts of computer science. Since this is a doughnut talk, I will introduce matroids in a cute way that involves playing bingo, and then I'll show you some cool examples.<br />
<br />
=== December 4, Xiaocheng Li===<br />
<br />
Title: The method of stationary phase and Duistermaat-Heckman formula<br />
<br />
Abstract: The oscillatory integral $\int_X e^{itf(x)}\mu=:I(t), t\in \mathbb{R}$ is a fundamental object in analysis. In general, $I(t)$ seldom has an explicit expression as Fourier transform is usually inexplicit. In practice, we are interested in the asymptotic behavior of $I(t)$, that is, for $|t|$ very large. A classical tool of getting an approximation is the method of stationary phase which gives the leading term of $I(t)$. Furthermore, there are rare instances for which the approximation coincides with the exact value of $I(t)$. One example is the Duistermaat-Heckman formula in which the Hamiltonian action and the momentum map are addressed. In the talk, I will start with basic facts in Fourier analysis, then discuss the method of stationary phase and the Duistermaat-Heckman formula.<br />
<br />
=== December 11, Chaojie Yuan===<br />
<br />
Title: Coupling and its application in stochastic chemical reaction network<br />
<br />
Abstract: Stochastic models for chemical reaction networks have become increasingly popular in the past few decades. When the molecules are present in low numbers, the chemical system always displays randomness in their dynamics, and the randomness cannot be ignored as it can have a significant effect on the overall properties of the dynamics. In this talk, I will introduce the stochastic models utilized in the context of biological interaction network. Then I will discuss coupling in this context, and illustrate through examples how coupling methods can be utilized for numerical simulations. Specifically, I will introduce two biological models, which attempts to address the behavior of interesting real-world phenomenon.</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18818SIAM Student Chapter Seminar2020-01-29T01:41:46Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Every other Friday at 1:30 pm<br />
*'''Where:''' B333 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Spring 2020 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[https://lorenzonajt.github.io/ Lorenzo Najt] (Math)<br />
|''[[#Jan 31, Lorenzo Najt (Math)|Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Jan 31, Lorenzo Najt (Math) ===<br />
'''Ensemble methods for measuring gerrymandering: Algorithmic problems and inferential challenges'''<br />
<br />
We will review some recent work regarding measuring gerrymandering by sampling from the space of maps, including two methods used in a recent amicus brief to the supreme court. This discussion will highlight some of the computational challenges of this approach, including some complexity-theory lower bounds and bottlenecks in Markov chains. We will examine the robustness of these statistical methods through their connection to phase transitions in the self-avoiding walk model, as well as their dependence on artifacts of discretization. This talk is largely based on https://arxiv.org/abs/1908.08881<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18817SIAM Student Chapter Seminar2020-01-29T01:37:07Z<p>Xshen: /* Past Semesters */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Most Friday at 11:30am<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|-<br />
|Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
|Oct. 25 <br />
|Max (Math)<br />
|''[[#Oct 25: Max (Math)|Coalescent with Recombination]]''<br />
|<br />
|-<br />
|-<br />
|Nov. 8<br />
|Hongfei Chen (Math)<br />
|''[[#Nov 15: Hongfei Chen (Math)| Brownian swimmers in a channel]]''<br />
|<br />
|-<br />
|-<br />
|Dec. 10<br />
|[http://www.maths.manchester.ac.uk/~higham/ Nicholas J. Higham] (University of Manchester)<br />
|''[[#Dec 10: Nicholas J. Higham (University of Manchester)|Scientific Writing]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25: Max (Math) ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
=== Nov 15: Hongfei Chen (Math) ===<br />
'''Brownian swimmers in a channel'''<br />
<br />
Abstract: Shape matters! I will talk about how their shapes affect their mean reversal time.<br />
<br />
=== Dec 10: Nicholas J. Higham (University of Manchester) ===<br />
'''Scientific Writing'''<br />
<br />
I will discuss various aspects of scientific writing, including<br />
<br />
• the craft of writing in general,<br />
<br />
• aspects specific to mathematical writing,<br />
<br />
• English Usage,<br />
<br />
• workflow, and<br />
<br />
• revising drafts and proofreading.<br />
<br />
Plenty of examples and links to further information will be given. I will also discuss<br />
my experiences in preparing ''Handbook of Writing for the Mathematical Sciences'' (third<br />
edition, SIAM, 2020).<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2019|Fall 2019]]<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18705SIAM Student Chapter Seminar2020-01-19T20:34:11Z<p>Xshen: /* Abstracts */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Most Friday at 11:30am<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|-<br />
|Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
|Oct. 25 <br />
|Max (Math)<br />
|''[[#Oct 25: Max (Math)|Coalescent with Recombination]]''<br />
|<br />
|-<br />
|-<br />
|Nov. 8<br />
|Hongfei Chen (Math)<br />
|''[[#Nov 15: Hongfei Chen (Math)| Brownian swimmers in a channel]]''<br />
|<br />
|-<br />
|-<br />
|Dec. 10<br />
|[http://www.maths.manchester.ac.uk/~higham/ Nicholas J. Higham] (University of Manchester)<br />
|''[[#Dec 10: Nicholas J. Higham (University of Manchester)|Scientific Writing]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25: Max (Math) ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
=== Nov 15: Hongfei Chen (Math) ===<br />
'''Brownian swimmers in a channel'''<br />
<br />
Abstract: Shape matters! I will talk about how their shapes affect their mean reversal time.<br />
<br />
=== Dec 10: Nicholas J. Higham (University of Manchester) ===<br />
'''Scientific Writing'''<br />
<br />
I will discuss various aspects of scientific writing, including<br />
<br />
• the craft of writing in general,<br />
<br />
• aspects specific to mathematical writing,<br />
<br />
• English Usage,<br />
<br />
• workflow, and<br />
<br />
• revising drafts and proofreading.<br />
<br />
Plenty of examples and links to further information will be given. I will also discuss<br />
my experiences in preparing ''Handbook of Writing for the Mathematical Sciences'' (third<br />
edition, SIAM, 2020).<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18704SIAM Student Chapter Seminar2020-01-19T20:33:49Z<p>Xshen: /* Fall 2019 */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Most Friday at 11:30am<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|-<br />
|Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
|Oct. 25 <br />
|Max (Math)<br />
|''[[#Oct 25: Max (Math)|Coalescent with Recombination]]''<br />
|<br />
|-<br />
|-<br />
|Nov. 8<br />
|Hongfei Chen (Math)<br />
|''[[#Nov 15: Hongfei Chen (Math)| Brownian swimmers in a channel]]''<br />
|<br />
|-<br />
|-<br />
|Dec. 10<br />
|[http://www.maths.manchester.ac.uk/~higham/ Nicholas J. Higham] (University of Manchester)<br />
|''[[#Dec 10: Nicholas J. Higham (University of Manchester)|Scientific Writing]]''<br />
|-<br />
|-<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25: Max (Math) ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
=== Nov 15: Hongfei Chen (Math) ===<br />
'''Brownian swimmers in a channel'''<br />
<br />
Abstract: Shape matters! I will talk about how their shapes affect their mean reversal time.<br />
<br />
=== Dec 10: Nicholas J. Higham ===<br />
'''Scientific Writing'''<br />
<br />
I will discuss various aspects of scientific writing, including<br />
<br />
• the craft of writing in general,<br />
<br />
• aspects specific to mathematical writing,<br />
<br />
• English Usage,<br />
<br />
• workflow, and<br />
<br />
• revising drafts and proofreading.<br />
<br />
Plenty of examples and links to further information will be given. I will also discuss<br />
my experiences in preparing ''Handbook of Writing for the Mathematical Sciences'' (third<br />
edition, SIAM, 2020).<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18703SIAM Student Chapter Seminar2020-01-19T20:31:10Z<p>Xshen: /* Abstracts */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Most Friday at 11:30am<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|-<br />
|Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
|Oct. 25 <br />
|Max (Math)<br />
|''[[#Oct 25: Max (Math)|Coalescent with Recombination]]''<br />
|<br />
|-<br />
|-<br />
|Nov. 8<br />
|Hongfei Chen (Math)<br />
|''[[#Nov 15: Hongfei Chen (Math)| Brownian swimmers in a channel]]''<br />
|<br />
|-<br />
|-<br />
|<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25: Max (Math) ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
=== Nov 15: Hongfei Chen (Math) ===<br />
'''Brownian swimmers in a channel'''<br />
<br />
Abstract: Shape matters! I will talk about how their shapes affect their mean reversal time.<br />
<br />
=== Dec 10: Nicholas J. Higham ===<br />
'''Scientific Writing'''<br />
<br />
I will discuss various aspects of scientific writing, including<br />
<br />
• the craft of writing in general,<br />
<br />
• aspects specific to mathematical writing,<br />
<br />
• English Usage,<br />
<br />
• workflow, and<br />
<br />
• revising drafts and proofreading.<br />
<br />
Plenty of examples and links to further information will be given. I will also discuss<br />
my experiences in preparing ''Handbook of Writing for the Mathematical Sciences'' (third<br />
edition, SIAM, 2020).<br />
<br />
<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18702SIAM Student Chapter Seminar2020-01-19T20:27:25Z<p>Xshen: /* Fall 2019 */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Most Friday at 11:30am<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|-<br />
|Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
|Oct. 25 <br />
|Max (Math)<br />
|''[[#Oct 25: Max (Math)|Coalescent with Recombination]]''<br />
|<br />
|-<br />
|-<br />
|Nov. 8<br />
|Hongfei Chen (Math)<br />
|''[[#Nov 15: Hongfei Chen (Math)| Brownian swimmers in a channel]]''<br />
|<br />
|-<br />
|-<br />
|<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25: Max (Math) ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
=== Nov 15: Hongfei Chen (Math) ===<br />
'''Brownian swimmers in a channel'''<br />
<br />
Abstract: Shape matters! I will talk about how their shapes affect their mean reversal time.<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18701SIAM Student Chapter Seminar2020-01-19T20:26:48Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Most Friday at 11:30am<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|-<br />
|Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
|Oct. 25 <br />
|''[[#Oct 25: Max (Math)|Coalescent with Recombination]]''<br />
|<br />
|-<br />
|-<br />
|Nov. 8<br />
|''[[#Nov 15: Hongfei Chen (Math)| Brownian swimmers in a channel]]''<br />
|<br />
|-<br />
|-<br />
|<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25: Max (Math) ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
=== Nov 15: Hongfei Chen (Math) ===<br />
'''Brownian swimmers in a channel'''<br />
<br />
Abstract: Shape matters! I will talk about how their shapes affect their mean reversal time.<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18700SIAM Student Chapter Seminar2020-01-19T20:25:42Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Most Friday at 11:30am<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|-<br />
|Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
|Oct. 25 <br />
|Max (Math)<br />
|''[[#Oct 25: Coalescent with Recombination]]''<br />
|<br />
|-<br />
|-<br />
|Nov. 8<br />
|Hongfei Chen (Math)<br />
|''[[#Nov 15: Brownian swimmers in a channel]]''<br />
|<br />
|-<br />
|-<br />
|<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25: Max (Math) ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
=== Nov 15: Hongfei Chen (Math) ===<br />
'''Brownian swimmers in a channel'''<br />
<br />
Abstract: Shape matters! I will talk about how their shapes affect their mean reversal time.<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18699SIAM Student Chapter Seminar2020-01-19T20:24:37Z<p>Xshen: /* Fall 2019 */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Most Friday at 11:30am<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|-<br />
|Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
|Oct. 25 <br />
|Max (Math)<br />
|''[[#Oct 25:|Coalescent with Recombination]]''<br />
|<br />
|-<br />
|-<br />
|Nov. 8<br />
|Hongfei Chen (Math)<br />
|''[[#Nov 15:|Brownian swimmers in a channel]]''<br />
|<br />
|-<br />
|-<br />
|<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25: Max (Math) ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
=== Nov 15: Hongfei Chen (Math) ===<br />
'''Brownian swimmers in a channel'''<br />
<br />
Abstract: Shape matters! I will talk about how their shapes affect their mean reversal time.<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18698SIAM Student Chapter Seminar2020-01-19T20:22:46Z<p>Xshen: /* Abstracts */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Most Friday at 11:30am<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|Oct. 11<br />
|''no seminar''<br />
|<br />
|-<br />
|-<br />
|Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
|Oct. 25 <br />
|Max Bacharach (Math)<br />
|''[[#Oct 25:|Coalescent with Recombination]]''<br />
|-<br />
|-<br />
|Nov. 1<br />
|''no seminar''<br />
|<br />
|-<br />
|-<br />
|Nov. 8<br />
|<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25: Max (Math) ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
=== Nov 15: Hongfei Chen (Math) ===<br />
'''Brownian swimmers in a channel'''<br />
<br />
Abstract: Shape matters! I will talk about how their shapes affect their mean reversal time.<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18697SIAM Student Chapter Seminar2020-01-19T20:22:28Z<p>Xshen: /* Abstracts */</p>
<hr />
<div>__NOTOC__<br />
<br />
*'''When:''' Most Friday at 11:30am<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen]<br />
*'''Faculty advisers:''' [http://www.math.wisc.edu/~jeanluc/ Jean-Luc Thiffeault], [http://pages.cs.wisc.edu/~swright/ Steve Wright] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
|Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|Oct. 11<br />
|''no seminar''<br />
|<br />
|-<br />
|-<br />
|Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
|Oct. 25 <br />
|Max Bacharach (Math)<br />
|''[[#Oct 25:|Coalescent with Recombination]]''<br />
|-<br />
|-<br />
|Nov. 1<br />
|''no seminar''<br />
|<br />
|-<br />
|-<br />
|Nov. 8<br />
|<br />
|<br />
|}<br />
<br />
== Abstracts ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25: Max (Math) ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
<br />
=== Nov 15: Hongfei Chen (Math) ===<br />
'''Brownian swimmers in a channel'''<br />
<br />
Abstract: Shape matters! I will talk about how their shapes affect their mean reversal time.<br />
<br><br />
<br />
== Past Semesters ==<br />
*[[SIAM_Student_Chapter_Seminar/Fall2018|Fall 2018]]<br />
*[[SIAM_Student_Chapter_Seminar/Spring2017|Spring 2017]]</div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18279SIAM Student Chapter Seminar2019-10-30T17:49:59Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
<br />
<br />
*'''When:''' Most Friday at 11:30 am (see e-mail)<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
| Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|Oct. 11 (No seminar) <br />
|<br />
|<br />
|-<br />
|-<br />
| Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|<br />
|-<br />
|-<br />
| Oct. 25 <br />
|<br />
|''[[#Oct 25:|Coalescent with Recombination]]''<br />
|-<br />
|-<br />
| Nov. 1 (No seminar) <br />
|<br />
|}<br />
<br />
<br />
<br />
== Abstract ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br />
=== Oct 25 ===<br />
'''Coalescent with Recombination'''<br />
<br />
I will talk about the continuous time coalescent with mutation and recombination, with a focus on introducing key concepts related to genetic distance and evolutionary relatedness. The talk will be informal and accessible.<br />
<br />
<br></div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18207SIAM Student Chapter Seminar2019-10-17T20:27:38Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
<br />
<br />
*'''When:''' Most Friday at 11:30 am (see e-mail)<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu].<br />
<br />
<br><br />
<br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
| Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|Oct. 11 (No seminar) <br />
|<br />
|<br />
|-<br />
|-<br />
| Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|-<br />
|}<br />
<br />
<br />
<br />
== Abstract ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br></div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18192SIAM Student Chapter Seminar2019-10-16T00:10:48Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
<br />
<br />
*'''When:''' Most Friday at 11:30 am (see e-mail)<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu] website.<br />
<br />
<br><br />
<br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
| Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|Oct. 11 (No seminar) <br />
|<br />
|<br />
|-<br />
|-<br />
| Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|-<br />
|}<br />
<br />
<br />
<br />
== Abstract ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
'''The corner growth model'''<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
'''Non-stationary Stochastic Approximation'''<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br></div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18191SIAM Student Chapter Seminar2019-10-16T00:09:14Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
<br />
<br />
*'''When:''' Most Friday at 11:30 am (see e-mail)<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu] website.<br />
<br />
<br><br />
<br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
| Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27, Oct 4: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|Oct. 11 (No seminar) <br />
|<br />
|<br />
|-<br />
|-<br />
| Oct. 18 <br />
|[https://scholar.google.com/citations?user=7cVl9IkAAAAJ&hl=en Bhumesh Kumar] (EE)<br />
|''[[#Oct 18: Bhumesh Kumar (EE)|Non-stationary Stochastic Approximation]]''<br />
|-<br />
|}<br />
<br />
<br />
<br />
== Abstract ==<br />
<br />
=== Sep 27, Oct 4: Xiao Shen (Math) ===<br />
The corner growth model<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
=== Oct 18: Bhumesh Kumar (EE) ===<br />
Non-stationary Stochastic Approximation<br />
<br />
Abstract: Robbins–Monro pioneered a general framework for stochastic approximation to find roots of a function with just noisy evaluations.With applications in optimization, signal processing and control theory there is resurged interest in time-varying aka non-stationary functions. This works addresses that premise by providing explicit, all time, non-asymptotic tracking error bounds via Alekseev's nonlinear variations of constant formula. <br />
<br />
Reference: https://arxiv.org/abs/1802.07759 (To appear in Mathematics of Control, Signals and Systems)<br />
<br></div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18090SIAM Student Chapter Seminar2019-10-02T18:18:14Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
<br />
<br />
*'''When:''' Most Friday at 11:30 am (see e-mail)<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu] website.<br />
<br />
<br><br />
<br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
| Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|Oct. 11 (No seminar) <br />
|<br />
|<br />
|-<br />
|}<br />
<br />
<br />
<br />
== Abstract ==<br />
<br />
=== Sep 27: Xiao Shen (Math) ===<br />
The corner growth model<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
<br></div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18089SIAM Student Chapter Seminar2019-10-02T18:18:04Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
<br />
<br />
*'''When:''' Most Friday at 11:30 am (see e-mail)<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu] website.<br />
<br />
<br><br />
<br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
| Sept. 27, Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
|Oct 11 (No seminar) <br />
|<br />
|<br />
|-<br />
|}<br />
<br />
<br />
<br />
== Abstract ==<br />
<br />
=== Sep 27: Xiao Shen (Math) ===<br />
The corner growth model<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
<br></div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=18088SIAM Student Chapter Seminar2019-10-02T18:17:19Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
<br />
<br />
*'''When:''' Most Friday at 11:30 am (see e-mail)<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu] website.<br />
<br />
<br><br />
<br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
| Sept. 27 + Oct. 4 <br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
| <br />
|Oct 11 (No seminar)<br />
|<br />
|-<br />
|}<br />
<br />
<br />
<br />
== Abstract ==<br />
<br />
=== Sep 27: Xiao Shen (Math) ===<br />
The corner growth model<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
<br></div>Xshenhttps://www.math.wisc.edu/wiki/index.php?title=SIAM_Student_Chapter_Seminar&diff=17977SIAM Student Chapter Seminar2019-09-20T18:32:14Z<p>Xshen: </p>
<hr />
<div>__NOTOC__<br />
<br />
<br />
<br />
*'''When:''' Most Friday at 11:30 pm (see e-mail)<br />
*'''Where:''' 901 Van Vleck Hall<br />
*'''Organizers:''' [http://www.math.wisc.edu/~xshen/ Xiao Shen] <br />
*'''To join the SIAM Chapter mailing list:''' email [join-siam-chapter@lists.wisc.edu] website.<br />
<br />
<br><br />
<br />
<br />
== Fall 2019 ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
|-<br />
| Sept. 27<br />
|[http://www.math.wisc.edu/~xshen/ Xiao Shen] (Math)<br />
|''[[#Sep 27: Xiao Shen (Math)|The corner growth model]]''<br />
|-<br />
| Oct. 4 <br />
|<br />
|<br />
|-<br />
|}<br />
<br />
<br />
<br />
== Abstract ==<br />
<br />
=== Sep 27: Xiao Shen (Math) ===<br />
The corner growth model<br />
<br />
Imagine there is an arbitrary amount of donuts attached to the integer points of Z^2. The goal is to pick an optimal up-right path which allows you to eat as much donuts as possible along the way. We will look at some basic combinatorial observations, and how specific probability distribution would help us to study this model.<br />
<br />
<br></div>Xshen