# Difference between revisions of "Past Probability Seminars Spring 2020"

(→Monday, January 9, Miklos Racz) |
(→Monday, January 9, 4pm Miklos Racz, Microsoft Research) |
||

Line 11: | Line 11: | ||

− | == <span style="color:red"> Monday</span>, January 9, <span style="color:red"> 4pm </span> [http://www.stat.berkeley.edu/~racz/ Miklos Racz], Microsoft Research == | + | == <span style="color:red"> Monday</span>, January 9, <span style="color:red"> 4pm, B233 Van Vleck </span> [http://www.stat.berkeley.edu/~racz/ Miklos Racz], Microsoft Research == |

<div style="width:320px;height:50px;border:5px solid black"> | <div style="width:320px;height:50px;border:5px solid black"> | ||

<b><span style="color:red"> Please note the unusual day and time </span></b> | <b><span style="color:red"> Please note the unusual day and time </span></b> | ||

</div> | </div> | ||

+ | |||

+ | |||

+ | Title: '''Statistical inference in networks and genomics''' | ||

+ | |||

+ | |||

+ | Abstract: | ||

+ | From networks to genomics, large amounts of data are increasingly available and play critical roles in helping us understand complex systems. Statistical inference is crucial in discovering the underlying structures present in these systems, whether this concerns the time evolution of a network, an underlying geometric structure, or reconstructing a DNA sequence from partial and noisy information. In this talk I will discuss several fundamental detection and estimation problems in these areas. | ||

+ | |||

+ | I will present an overview of recent developments in source detection and estimation in randomly growing graphs. For example, can one detect the influence of the initial seed graph? How good are root-finding algorithms? I will also discuss inference in random geometric graphs: can one detect and estimate an underlying high-dimensional geometric structure? Finally, I will discuss statistical error correction algorithms for DNA sequencing that are motivated by DNA storage, which aims to use synthetic DNA as a high-density, durable, and easy-to-manipulate storage medium of digital data. | ||

== Thursday, January 19, TBA == | == Thursday, January 19, TBA == |

## Revision as of 12:36, 5 January 2017

# Spring 2017

**Thursdays in 901 Van Vleck Hall at 2:25 PM**, unless otherwise noted.
**We usually end for questions at 3:15 PM.**

If you would like to sign up for the email list to receive seminar announcements then please send an email to join-probsem@lists.wisc.edu.

## Monday, January 9, 4pm, B233 Van Vleck Miklos Racz, Microsoft Research

** Please note the unusual day and time **

Title: **Statistical inference in networks and genomics**

Abstract:
From networks to genomics, large amounts of data are increasingly available and play critical roles in helping us understand complex systems. Statistical inference is crucial in discovering the underlying structures present in these systems, whether this concerns the time evolution of a network, an underlying geometric structure, or reconstructing a DNA sequence from partial and noisy information. In this talk I will discuss several fundamental detection and estimation problems in these areas.

I will present an overview of recent developments in source detection and estimation in randomly growing graphs. For example, can one detect the influence of the initial seed graph? How good are root-finding algorithms? I will also discuss inference in random geometric graphs: can one detect and estimate an underlying high-dimensional geometric structure? Finally, I will discuss statistical error correction algorithms for DNA sequencing that are motivated by DNA storage, which aims to use synthetic DNA as a high-density, durable, and easy-to-manipulate storage medium of digital data.