In this webinar, we will explore the ability of Wolfram Language to understand the structure of graphs—in particular, those that are organic and asymmetrical, such as social networks, coauthorship graphs or even the type of "real-life" interaction graph studied by epidemiologists.

We will show a few methods for detecting communities and central nodes in graphs (as well as define what that even means). We will also talk about homophily in social graphs and say something about why it seems like your friends have more friends than you. We will conclude by showing how we can analyze flow networks in Wolfram Language—letting us discover, for example, the peak bandwidth of an intranet or the cheapest way to disrupt a national transport network.
  • Cliques and communities
  • Annotations and homophily
  • Vertex centrality
  • Maximum flow and minimum cut
Wolfram Events Europe
Joseph Brennan
First Name*
Last Name*
Your Email*
Job Title*
Which best describes you?*
I would like to sign up for Wolfram News to stay up to date with news on the latest technology, events and products from Wolfram. *
Are you a Mathematica or Wolfram Language user?*
I agree to the retention of my personal data by the Wolfram Companies as explained in the Privacy Policy.*
We use BigMarker as our webinar platform. By clicking Register, you acknowledge that the information you provide will be transferred to BigMarker processing in accordance with their Terms of Service and Privacy Policy.