Random walk models of networks: modeling and inferring complex dependence
- đ¤ Speaker: Benjamin Bloem-Reddy (Columbia University)
- đ Date & Time: Wednesday 27 July 2016, 11:30 - 12:00
- đ Venue: Seminar Room 1, Newton Institute
Abstract
A signature of many network datasets is strong local dependence, a phenomenon that gives rise to frequently observed properties such as transitive triples, pendants, and structural heterogeneity. One difficulty in modeling such dependence is that the notion of locality may not be well-defined, and it is likely to be heterogeneous throughout the network. Furthermore, models that do not assume some form of conditional independence on the edges typically are intractable or too simplistic to serve as useful statistical models. We introduce a class of models, based on random walks, that allows the scale of dependence to vary; it is able to generate a range of network structures faithful to those observed in real data, and it admits tractable inference procedures.
This is joint work with Peter Orbanz.
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.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Benjamin Bloem-Reddy (Columbia University)
Wednesday 27 July 2016, 11:30-12:00