Small-worlds, complex networks, and random graphs

Onderzoeksoutput: Niet-tekstuele vormDigitale or audiovisueel materiaalProfessioneel

Uittreksel

Empirical findings have shown that many real-world networks share fascinating features. Indeed, many real-world networks are small worlds, in the sense that typical distances are much smaller than the size of the network. Further, many real-world networks are scale-free in the sense that there is a high variability in the number of connections of the elements of the networks. Therefore, such networks are highly inhomogeneous. Spurred by these empirical findings, models have been proposed for such networks. In this lecture series, we discuss empirical findings of real-world networks, and describe some of the random graph models proposed for them. In particular, we will discuss the configuration model, generalized random graphs and preferential attachment models. We then discuss the small-world phenomenon in these random graph models and its link to `six degrees of separation'. We highlight some of the ingredients used in the proofs, namely the tree-like nature of the random graphs under consideration and the use of branching processes. A rough outline of the lecture series is as follows: Lecture 1: Real-world networks and random graphs; Lecture 2: Small-world phenomenon in random graphs
Originele taal-2Engels
UitgeverYouTube
StatusGepubliceerd - 2014

Vingerafdruk

Small World
Random Graphs
Complex Networks
Graph Model
Preferential Attachment
Series
Branching process
Rough
Model
Configuration

Citeer dit

Hofstad, van der, R. W. (Auteur). (2014). Small-worlds, complex networks, and random graphs. Digitale or audiovisueel materiaal, YouTube.
@misc{f52d447e5edf4c29a1711c683aa8ca57,
title = "Small-worlds, complex networks, and random graphs",
abstract = "Empirical findings have shown that many real-world networks share fascinating features. Indeed, many real-world networks are small worlds, in the sense that typical distances are much smaller than the size of the network. Further, many real-world networks are scale-free in the sense that there is a high variability in the number of connections of the elements of the networks. Therefore, such networks are highly inhomogeneous. Spurred by these empirical findings, models have been proposed for such networks. In this lecture series, we discuss empirical findings of real-world networks, and describe some of the random graph models proposed for them. In particular, we will discuss the configuration model, generalized random graphs and preferential attachment models. We then discuss the small-world phenomenon in these random graph models and its link to `six degrees of separation'. We highlight some of the ingredients used in the proofs, namely the tree-like nature of the random graphs under consideration and the use of branching processes. A rough outline of the lecture series is as follows: Lecture 1: Real-world networks and random graphs; Lecture 2: Small-world phenomenon in random graphs",
author = "{Hofstad, van der}, R.W.",
year = "2014",
language = "English",
publisher = "YouTube",

}

Hofstad, van der, RW, Small-worlds, complex networks, and random graphs, 2014, Digitale or audiovisueel materiaal, YouTube.
Small-worlds, complex networks, and random graphs. Hofstad, van der, R.W. (Auteur). 2014. YouTube.

Onderzoeksoutput: Niet-tekstuele vormDigitale or audiovisueel materiaalProfessioneel

TY - ADVS

T1 - Small-worlds, complex networks, and random graphs

AU - Hofstad, van der, R.W.

PY - 2014

Y1 - 2014

N2 - Empirical findings have shown that many real-world networks share fascinating features. Indeed, many real-world networks are small worlds, in the sense that typical distances are much smaller than the size of the network. Further, many real-world networks are scale-free in the sense that there is a high variability in the number of connections of the elements of the networks. Therefore, such networks are highly inhomogeneous. Spurred by these empirical findings, models have been proposed for such networks. In this lecture series, we discuss empirical findings of real-world networks, and describe some of the random graph models proposed for them. In particular, we will discuss the configuration model, generalized random graphs and preferential attachment models. We then discuss the small-world phenomenon in these random graph models and its link to `six degrees of separation'. We highlight some of the ingredients used in the proofs, namely the tree-like nature of the random graphs under consideration and the use of branching processes. A rough outline of the lecture series is as follows: Lecture 1: Real-world networks and random graphs; Lecture 2: Small-world phenomenon in random graphs

AB - Empirical findings have shown that many real-world networks share fascinating features. Indeed, many real-world networks are small worlds, in the sense that typical distances are much smaller than the size of the network. Further, many real-world networks are scale-free in the sense that there is a high variability in the number of connections of the elements of the networks. Therefore, such networks are highly inhomogeneous. Spurred by these empirical findings, models have been proposed for such networks. In this lecture series, we discuss empirical findings of real-world networks, and describe some of the random graph models proposed for them. In particular, we will discuss the configuration model, generalized random graphs and preferential attachment models. We then discuss the small-world phenomenon in these random graph models and its link to `six degrees of separation'. We highlight some of the ingredients used in the proofs, namely the tree-like nature of the random graphs under consideration and the use of branching processes. A rough outline of the lecture series is as follows: Lecture 1: Real-world networks and random graphs; Lecture 2: Small-world phenomenon in random graphs

UR - http://www.youtube.com/watch?v=pylTEAyUQiM

M3 - Digital or Visual Products

PB - YouTube

ER -