COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Probability Theory and Statistics in High and Infinite Dimensions > Exponential inequalities and local independence graphs to unravel functional neuronal connectivity
Exponential inequalities and local independence graphs to unravel functional neuronal connectivityAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact clc32. The starting theoretical point is to provide “data-driven” exponential inequalities for counting processes with as few assumptions as possible on the underlying conditional intensity. This allows us to present a weighted Lasso method in the abstract set-up of linear counting processes. Thanks to this method, it is possible to approximate real neuronal data, called spike trains, by Hawkes models even if this model is not true. This leads to an estimation of local independence graphs for which we are currently testing the adequation with the biological notion of “functional connectivity”. This talk is part of the Probability Theory and Statistics in High and Infinite Dimensions series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsProtein crystallisation seminars Kettle's Yard Lunchtime Talks DAMTP info aggregator Land Economy Departmental Seminar Series Graduate Women's Network Contagion and ContainmentOther talksPropagation of Very Low Frequency Emissions from Lightning Lunchtime Talk: Helen's Bedroom Ramble through my greenhouse and Automation Academic CV Workshop |