00:00:00 / 00:00:00

Network archeology: a few results and questions - Lecture 1

By Gábor Lugosi

Appears in collection : Meeting in Mathematical Statistics - Machine learning and nonparametric statistics / Rencontres de statistique mathématique

Networks are often naturally modeled by random processes in which nodes and edges of the network are added one-by-one, according to some simple stochastic dynamics. Uniform and preferential attachment processes are prime examples of such dynamically growing networks. The statistical problems we address in this talk regard discovering the past of the network when a present-day snapshot is observed. Such problems are sometimes termed 'network archeology'. We present a few results that show that, even in gigantic networks, a lot of information is preserved from the very early days. As the field is still in its infancy, many interesting questions remain to be explored.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.19867603
  • Cite this video Lugosi Gábor (12/13/21). Network archeology: a few results and questions - Lecture 1. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19867603
  • URL https://dx.doi.org/10.24350/CIRM.V.19867603

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback