A social network can be represented as a collection of nodes and edges. The nodes represent the people in the network and the edges (or links) between nodes signify a relationship, such as friendship or professional acquaintance. In mathematical terms, such a structure is often called a graph. This talk will introduce the notion of a random graph model, which is essentially a non-deterministic algorithm for producing a graph. It will investigate various random graph models and provide an overview of their strengths and limitations in capturing some essential features of social networks.
Pure Maths Seminar
Tue, 11/08/2020 - 12:00pm
Zoom meeting link: https://unsw.zoom.us/j/98036856024