![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Peter Orbanz (Columbia University)
Monday 11 July 2016, 14:30-15:00
Subsampling, symmetry and averaging in networks
- đ¤ Speaker: Peter Orbanz (Columbia University)
- đ Date & Time: Monday 11 July 2016, 14:30 - 15:00
- đ Venue: Seminar Room 1, Newton Institute
Abstract
Consider a very large graph—-say, the link graph of a large social network. Now invent a randomized algorithm that extracts a smaller subgraph. If we use the subgraph as sample data and perform statistical analysis on this sample, what can we learn about the underlying network? Clearly, that should depend on the subsampling algorithm. I show how the choice of algorithm defines a notion of (1) distributional invariance and (2) of averaging within a single large graph. Under suitable conditions, the resulting averages satisfy a law of large numbers, such that statistical inference from a single sample graph is indeed possible. From this algorithmic point of view, graphon models arise from a specific choice of sampling algorithm, various known pathologies of these models are explained as a selection bias.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- dh539
- Featured lists
- INI info aggregator
- Interested Talks
- Isaac Newton Institute Seminar Series
- ndk22's list
- ob366-ai4er
- rp587
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.