In collaboration with Optimice, I will teach a workshop on Social Network Analysis for enterprises, organizations, and businesses using NodeXL.

• Self-paced e-learning (4 hours)
  • Introduction to Social/Organisational Network Analysis
  • Network patterns and metrics
  • Software tools for network analysis
  • Managing an ONA Project
    
• Module 1: Scoping your ONA Project (2 hour virtual session hosted by Patti Anklam)
  • Determining which business problem to solve with ONA
  • Review of case-studies
  • Determining your questions
• Module 2: Setting up your ONA survey (2 hour virtual session hosted by Cai Kjaer / Laurence Lock Lee)
  • Setting up your survey
  • Working with mailing lists and other lists
  • Creating relationship sets and network questions
  • Previewing and launching the survey
  • Tracking progress and downloading responses
• Module 3: Visualise networks with NodeXL (2 hour virtual session hosted by Marc Smith)
  • Getting started with NodeXL
  • Calculating and visualizing network metrics
  • Preparing data and filtering
  • Importing data from Social Media tools
  • Clustering and grouping

A number of ONA Practitioner Courses are available to suit the timezones of participants located in the US, Europe and/or Asia-Pacific (but not restricted to these regions):

Mastering Social Media 2011 is a workshop scheduled for November 28 and 30 in Cape Town and Johannesburg, South Africa.

My partner, Walter Pike, is a Marketing Maven and Founder of PiKE | New Marketing (www.pike.co.za) and the founder of the Digital Academy www.digitalacademy.co.za
He blogs at walterpike.com.

Mastering Social Media will give you practical tools on how to plan, execute and monitor your social media campaigns. Discussions will lead you through the introduction to social media marketing, understanding community dynamics, mapping social networks and applying network insights to your goals.
Brand Managers, Marketing Managers, Advertising Agencies, Digital Agencies, and PR Agencies are likely to find the day useful.

Venues and Dates

Johannesburg

30 November 2011
Gordon Institute
of Business Science,
Illovo

Pictures:

This map of connections among people who tweeted Teaparty starts on 11/15/2011 14:22 UTC and ends on 11/15/2011 17:23, a total of 3 hours and 1 minute of traffic.

The Teaparty data set contained 1,533 tweets, replies and mentions.
Blue edges are connections created by replies and mentions. Grey lines are follows relationships.

Top most between users:
@ronpaul
@michellemalkin
@christopherhull
@theteaparty_net
@capaction
@thedailyedge
@bill1phd
@dbargen
@gulagbound
@rightcandidates

Graph Metric: Value
Graph Type: Directed
Vertices: 659
Unique Edges: 8808
Edges With Duplicates: 1423
Total Edges: 10231
Self-Loops: 1084
Connected Components: 49
Single-Vertex Connected Components: 44
Maximum Vertices in a Connected Component: 606
Maximum Edges in a Connected Component: 10148
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance:2.693965
Graph Density: 0.02036797
NodeXL Version: 1.0.1.193

The major clusters are composed of teaparty supporters. The center bottom cluster are teaparty critics.

This map of the connections among people who tweeted Occupywallstreet starts on 11/15/2011 23:08 and ends on 11/15/2011 23:34 UTC, a total of 26 minutes of traffic.

Occupywallstreet 1,370 tweets, replies and mentions
Blue edges are connections created by replies and mentions. Grey lines are follows relationships.

Top most between users:
@occupywallst
@mmflint
@nyclu
@allisonkilkenny
@andrewbreitbart
@operationleaks
@occupydenver
@theatlantic
@usgeneralstrike
@rt_com

Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 3546
Edges With Duplicates: 826
Total Edges: 4372
Self-Loops: 794
Connected Components: 241
Single-Vertex Connected Components: 230
Maximum Vertices in a Connected Component: 747
Maximum Edges in a Connected Component: 3998
Maximum Geodesic Distance (Diameter): 7
Average Geodesic Distance: 2.65438
Graph Density: 0.003246246
NodeXL Version: 1.0.1.194

Some notable contrasts:
Teaparty Graph Density: 0.002652645
Occupywallstreet Graph Density: 0.02036797 – significantly lower levels of interconnection
Teaparty: Single-Vertex Connected Components 44 of 1000
Occupywallstreet: Single-Vertex Connected Components 283 of 1000

Many more “isolates” (Single-Vertex Connected Components) in Occupywallstreet.
Many more hubs, and more retweeting activity in Occupywallstreet.

The difference in duration of these data sets illustrates the relative speed of content creation in the topics. The data sets are commensurable in that they are both the result of a single query against the Twitter search API. So both maps are the results of charting connections among the authors of the last 1500 tweets, how ever long that takes to create.

On November 9th and 10th, 2011 the LocalSocialSummit11 will be held in London.

On Thursday morning, November 10th, Doctor Bernie Hogan from the Oxford Internet Institute and member of the Social Media Research Foundation will speak on the topic:

Insights: Social Network Analysis On Facebook Data, with a local twist

Thursday at 3:45 I will speak at the event on:

Charting Collections Of Connections In Social Media

Following the conference from 5 to 6pm will be a reception for the Social Media Research Foundation.

Please join us for refreshments and a discussion of the ways social media analysis tools can guide your engagement with stakeholders around the world.

The event is held at wallacespace:

22 Duke’s Road, London, WC1H 9PN
t +44(0)20 7395 1265
f +44 (0)20 7836 9591
e ask@wallacespace.com

22 Duke’s Road is only minutes walk away from Euston, St Pancras International, King’s Cross and Russell Square Tube.

Registration form for attending the event is below….

I presented on social media network analysis on October 20, 2011 in New York City at Predictive Analytics World.

A map of the connections among the people tweeting about the #Pawcon hashtag is below.

Network Maps for End Users: Collect, Analyze, Visualize and Communicate Network Insights with Zero Coding

Abstract: Networks are everywhere except the end user desktop.  NodeXL, the free and open network overview, discovery and exploration add-in for the popular and familiar Excel (2007/2010) spreadsheet allows users who are comfortable making pie charts to now make useful network visualizations.  Developed and released by the Social Media Research Foundation, NodeXL uses Excel as a framework, providing a GUI network browser (a “web browser”?) that novices can use quickly and experts can use to generate sophisticated results.  Data importers provide access to a range of social media network data sources like Twitter, flickr, YouTube, Facebook, email, the WWW, and more through standard file formats (CSV, GraphML, Matrix).  Simple to use tools can automatically analyze, visualize and highlight insights in complex network graphs.  Using NodeXL, researchers have been collecting a wide range of network data sets from various social media services.  These images reveal a range of common social formations in social media and point to people who occupy strategic locations in these graphs.

This is a map of the connections among the people who tweeted the term “PAWCON” on the first day of the event:

These are the connections among the Twitter users who recently tweeted the word #pawcon when queried on October 19, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

A larger version of the image is here: www.flickr.com/photos/marc_smith/6261006732/sizes/l/in/ph…

Top most between users:
@tapan_patel
@pawcon
@sasanalytics
@deloitteba
@kristinevick
@jamet123
@zementis
@kdnuggets
@tibcospotfire
@saspublishing

Graph Metric: Value
Graph Type: Directed
Vertices: 41
Unique Edges: 233
Edges With Duplicates: 120
Total Edges: 353
Self-Loops: 44
Connected Components: 2
Single-Vertex Connected Components: 1
Maximum Vertices in a Connected Component: 40
Maximum Edges in a Connected Component: 352
Maximum Geodesic Distance (Diameter): 4
Average Geodesic Distance: 1.87133
Graph Density: 0.15304878
NodeXL Version: 1.0.1.179

Here is an example map of the connections among the people who tweeted the term “pawcon” in Twitter on September 14th, a week prior to the event.

Manu Sharma, Principle Research Scientist at LinkedIn gave a great presentation on the patterns found in their data.  Big data, for example, showed that most of the people who previously worked at recently failed banks and financial institutions have updated their profiles to show that they mostly have new jobs at some of the remaining companies in the industry.

The event was held at the New York Hilton: Maps & Directions

Threaded conversations are a major form of social media.  Message boards, email and email lists, twitter, blog comments, text messages, and discussion forums are all social media systems built around the message thread data structure.  As messages are exchanged through these systems, some messages are sent as a reply to a particular previous message.  As messages are sent in reply to prior messages, chains of messages form.  Message chains come in two major forms: branching and non-branching.  Branching threads are those that allow more than one message to reply to a prior message.  Non-branching threads are single chains, like a string of pearls, that allow only one message to reply to a prior message.  Many web based message boards are non-branching.  Many email systems and discussion forums are branching.

ThreadMill requires a minimal set of data elements to generate its reports.  A data table must minimally have a column of information for each message that includes the name of the message board, the forum, the thread, and the author, along with a unique identifier for each message and the date and time it was posted.  Optional data elements include the unique identifier of the message being replied to, the URL of the message, and the URL for a profile photo.

All forms of threaded message exchange can be measured.  Simple measures like the count of the number of messages or the number of authors are obvious and useful.  Other measures can be created from more sophisticated analysis.  For example, the network of connections that forms as different authors reply to one another can be extracted and analyzed using network analysis methods.  It is possible to calculate metrics from these networks of reply that describe the location of each person in the graph.

ThreadMill generates several data sets that can be used to create visualizations of the activity and structure of a message board collection.

A Treemap data set can illustrate the hierarchy of encapsulated authors within threads, threads within fora, fora within boards, and boards within collections.  Treemap visualizations of collections of threaded conversations can quickly highlight the most active or populous discussions.

An AuthorLine visualization takes the form of a double histogram, with bubbles representing each thread active in each time period sized by the volume of messages the author contributed, sorted by size.  Threads that have been initiated by the author are represented as bubbles above the center line.  Messages that the author contributes to threads started by other authors are represented as bubbles stacked below the center line.  AuthorLines quickly reveal the pattern of activity an author displays and identifies which of several types of contributors the author is.

A scatter plot visualization represents each author as a bubble in an X-Y space defined by the number of different days the author was active against the average number of messages the author contributes to the threads in which they participate.

A time series line chart reveals the days of maximum and minimum activity along with trends.

A network diagram reveals the overall structure of the discussion space and the people who occupy strategic locations within the network graph.

ThreadMill has received generous assistance from Morningside Analytics.  Bruce Woodson implemented ThreadMill.

http://ir12.aoir.org/

These are the  connections among the Twitter users who recently tweeted the word AOIR when queried on October 10, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: ir12.aoir.org/

Top most between users:
@ir12
@barrywellman
@mikemonello
@netcrit
@andresmh
@s_t_e_v_e_jones
@zizip
@kellybergstrom
@katypearce
@guillaumelatzko

Graph Metric: Value
Graph Type: Directed
Vertices: 98
Unique Edges: 119
Edges With Duplicates: 672
Total Edges: 791
Self-Loops: 153
Connected Components: 40
Single-Vertex Connected Components: 35
Maximum Vertices in a Connected Component: 55
Maximum Edges in a Connected Component: 710
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.257477
Graph Density: 0.035766884
NodeXL Version: 1.0.1.179

By expanding the query to include #IR12, the conference hashtag, the network expands to include:

Connections among the Twitter users who recently tweeted the word AOIR OR #IR12 when queried on October 11, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

Top most between users:
@ir12
@barrywellman
@mikemonello
@netcrit
@andresmh
@s_t_e_v_e_jones
@zizip
@kellybergstrom
@katypearce
@guillaumelatzko

Graph Metric: Value
Graph Type: Directed
Vertices: 231
Unique Edges: 1984
Edges With Duplicates: 2118
Total Edges: 4102
Self-Loops: 586
Connected Components: 46
Single-Vertex Connected Components: 40
Maximum Vertices in a Connected Component: 181
Maximum Edges in a Connected Component: 4012
Maximum Geodesic Distance (Diameter): 5
Average Geodesic Distance: 2.213887
Graph Density: 0.046320346
NodeXL Version: 1.0.1.179

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

Here is the updated map of connections among people who recently tweeted #occupywallstreet:

These are the connections among the Twitter users who recently tweeted the word OccupyWallStreet when queried on October 10, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: occupywallst.org/

A larger version of the image is here: www.flickr.com/photos/marc_smith/6232030871/sizes/l/in/ph…

Top most between users:
@ajenglish
@anonymousirc
@cnbc
@rawstory
@ryannewyork
@mediabistro
@blogdiva
@brentnhunter
@krenner2
@rebuilddream

Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 3014
Edges With Duplicates: 720
Total Edges: 3734
Self-Loops: 994
Connected Components: 318
Single-Vertex Connected Components: 300
Maximum Vertices in a Connected Component: 664
Maximum Edges in a Connected Component: 3326
Maximum Geodesic Distance (Diameter): 9
Average Geodesic Distance: 3.508133
Graph Density: 0.002524525
NodeXL Version1.0.1.179

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

Link: www.flickr.com/photos/marc_smith/6225446144/

Each user is scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: occupywallst.org/

A larger version of the image is here: www.flickr.com/photos/marc_smith/6225446144/sizes/l/in/ph…

Top most between users:
@maddow
@motherjones
@aclu
@zerohedge
@mmfa
@spread4freedom
@diggrbiii
@angelsavant
@marychastain
@katiepavlich

Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 3835
Edges With Duplicates: 916
Total Edges: 4751
Self-Loops: 1109
Connected Components: 311
Single-Vertex Connected Components: 301
Maximum Vertices in a Connected Component: 678
Maximum Edges in a Connected Component: 4327
Maximum Geodesic Distance (Diameter): 9
Average Geodesic Distance: 3.283708
Graph Density: 0.003408408
NodeXL Version: 1.0.1.179

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

The Workshop on Information in Networks 2011 was held at NYU September 30-October 1st.

Over the course of the event a number of people tweeted using the hashtag #win2011.

These are the connections among the Twitter users who recently tweeted the word win2011 when queried on October 3, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: winworkshop.net/

Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.

A larger version of the image is here:http://www.flickr.com/photos/marc_smith/6209064926/sizes/l/in/photostream/

Betweenness Centrality is defined here: en.wikipedia.org/wiki/Centrality#Betweenness_centrality

Clauset-Newman-Moore algorithm is defined here: pre.aps.org/abstract/PRE/v70/i6/e066111

Top most between users:

@sinanaral
@winworkshop
@barrywellman
@ladamic
@seanjtaylor
@drewconway
@chrisdiehl
@dylanwalker
@marc_smith
@ariegoldshlager

Graph Metric: Value
Graph Type: Directed
Vertices: 38
Unique Edges: 227
Edges With Duplicates: 193
Total Edges: 420
Self-Loops: 68
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 38
Maximum Edges in a Connected Component: 420
Maximum Geodesic Distance (Diameter): 3
Average Geodesic Distance: 1.836565
Graph Density: 0.194167852
NodeXL Version: 1.0.1.179

These are the connections among the Twitter users who tweeted the word win2011 when queried a few days earlier on September 30, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

A larger version of the image is here: www.flickr.com/photos/marc_smith/6198785387/sizes/l/in/ph…

Top most between users:
@sinanaral
@winworkshop
@ariegoldshlager
@drewconway
@chrisdiehl
@kateaanderson
@dylanwalker
@barrywellman
@kristinalerman
@pboothe

Graph Metric: Value
Graph Type: Directed
Vertices: 16
Unique Edges: 60
Edges With Duplicates: 45
Total Edges: 105
Self-Loops: 26
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 16
Maximum Edges in a Connected Component: 105
Maximum Geodesic Distance (Diameter): 3
Average Geodesic Distance: 1.617188
Graph Density: 0.270833333
NodeXL Version: 1.0.1.179

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/
NodeXL is free and open and available from www.codeplex.com/nodexl
NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.

The recent Strata Conference in New York City gathered many leaders in big data, data mining, and information visualization.

Link: www.flickr.com/photos/marc_smith/6203313170

Connections among the Twitter users who recently tweeted the word Strata when queried on September 20, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: strataconf.com/summit2011

Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.

A larger version of the image is here: www.flickr.com/photos/marc_smith/6203313170/sizes/l/in/ph…

Betweenness Centrality is defined here: en.wikipedia.org/wiki/Centrality#Betweenness_centrality

Clauset-Newman-Moore algorithm is defined here: pre.aps.org/abstract/PRE/v70/i6/e066111

Top most between users:
@timoreilly
@strataconf
@doctorow
@acroll
@ticbeat
@datacenter
@hnshah
@oreillymedia
@markmadsen
@unglobalpulse

Graph Metric: Value
Graph Type: Directed
Vertices: 1118
Unique Edges: 5813
Edges With Duplicates: 6522
Total Edges: 12335
Self-Loops: 1010
Connected Components: 9
Single-Vertex Connected Components: 8
Maximum Vertices in a Connected Component: 1110
Maximum Edges in a Connected Component: 12327
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.575622
Graph Density: 0.00647018
NodeXL Version: 1.0.1.177

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/
NodeXL is free and open and available from www.codeplex.com/nodexl
NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.
The book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.

This is a map of the connections among the Twitter users who recently tweeted the word HealthTap when queried on September 28, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: healthtap.com/

Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.

A larger version of the image is here: www.flickr.com/photos/marc_smith/6198785341/sizes/l/in/ph…

Betweenness Centrality is defined here: en.wikipedia.org/wiki/Centrality#Betweenness_centrality

Clauset-Newman-Moore algorithm is defined here: pre.aps.org/abstract/PRE/v70/i6/e066111

Top most between users:
@lifehacker
@healthtap
@drpam4women
@androidandme
@drpam
@amazonwireless
@jonmrich
@etseng
@mobilehealth
@doctor_v

Graph Metric: Value
Graph Type: Directed
Vertices: 638
Unique Edges: 3630
Edges With Duplicates: 1337
Total Edges: 4967
Self-Loops: 865
Connected Components: 183
Single-Vertex Connected Components: 167
Maximum Vertices in a Connected Component: 426
Maximum Edges in a Connected Component: 4677
Maximum Geodesic Distance (Diameter): 11
Average Geodesic Distance: 3.098025
Graph Density: 0.008715423
NodeXL Version: 1.0.1.177

More NodeXL network visualizations are here: www.flickr.com/photos/marc_smith/sets/72157622437066929/

NodeXL is free and open and available from www.codeplex.com/nodexl
NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.
The book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.

The effect is visually striking.  Here is a before and after with the same network:

Curved Edges, no Edge Bundles

Curved and bundled edges.

In future releases we will expose more controls for configuring the bundles.

NodeXL is extendable.  3rd Party developers have been building data providers that can plug into NodeXL that connect the network visualization tool to sources of network data.  We now have three providers of extensions to NodeXL: VOSON for WWW hyperlink networks, the Exchange Spigot for NodeXL for extracting enterprise email networks, and the Facebook Spigot for NodeXL that extracts your own Facebook network for analysis and visualization!

We welcome additional data provider projects!  Have a network? Connect it to NodeXL with the simple directions listed here.

Import hyperlink networks into NodeXL with the VOSON System – a web-based software incorporating web mining, data visualisation, and traditional empirical social science methods (e.g. social network analysis, SNA).
http://voson.anu.edu.au/node/13#VOSON-NodeXL

http://facebookimporter.codeplex.com/

 

Please vote on our SxSW 2012 panel:

Thanks for your vote for our SxSW panel!

Here is a map of the connections among the people who tweeted the term “AEJMC” on August 7, 2011:

The top most between people in this network are:@aejmc, @jlab, @karenrussell, @terryflynn, @natcomm, @tmccorkindale, @derigansilver, @tkell, @aejmconlineads, and @jeremyhl:

I will present a Workshop on Social Media Network Analysis and NodeXL at the 9 August 2011 – Association for Education in Journalism and Mass Communication (http://www.aejmc.com) in St. Louis, Missouri along with my colleague Professor Hernando Rojas, from the School of Journalism & Mass Communication, University of Wisconsin – Madison.

See: http://www.aejmc.com/home/events/annual-convention/

The Association for Education in Journalism and Mass Communication (AEJMC) is a nonprofit, educational association of journalism and mass communication educators, students and media professionals. The Association’s mission is to promote the highest possible standards for journalism and mass communication education, to cultivate the widest possible range of communication research, to encourage the implementation of a multi-cultural society in the classroom and curriculum, and to defend and maintain freedom of communication in an effort to achieve better professional practice and a better informed public.

Our session is:

Using NodeXL for Social Network Analysis
Tuesday — 2 pm to 5 pm
Presented by Communication Theory and Methodology Division
This pre-conference workshop examines social network analysis. Social network analysis can be used to examine message boards, blogs, and friend networks (amongmany other phenomena). Participants will learn to use the NodeXL program to conduct a network analysis. For information, contact Michel M. Haigh, Pennsylvania State University at mmh25@psu.edu.

NodeXL automatically generates a network legend and displays it when the Graph Elements menu is opened:

And the “Legend” option is selected.

This will place a legend at the bottom of the visualization canvas:

Starting in version .165 of NodeXL we have supported the idea of an options file that can be imported, exported and exchanged among users.

If you have set all the knobs and dials of your copy of NodeXL just right, you can export these adjustments and configurations into a single file.  Use the NodeXL>Options>Export feature to create a named file containing your settings.  You can now exchange this file with others.  If you receive an options file, you can use the NodeXL>Options>Import feature to pick it out from the file system and set your copy of NodeXL to the settings defined in that file.

If you use the related NodeXL>Options>Use Current for New feature you can set the defaults for NodeXL to the settings contained in any imported options file.

I have been fine tuning a settings file that generates network visualizations that are tailored for the Twitter networks I have been making many of.  I have saved these sample settings file for NodeXL and you can try them yourself here: NodeXL-Twitter Network-Options Settings.NodeXLOptions.

Download this file, rename it by removing the .txt extension and load it into your copy of NodeXL.

This is a map of the connections among the Twitter users who recently tweeted the words #rw2011 when queried on April 28, 2011, scaled by numbers of followers (with outliers thresholded), connected by replying, mentioning and following.

Layout using the “Group Layout” composed of tiled bounded regions. Clusters calculated by the Clauset-Newman-Moore algorithm are also encoded by color.

A larger version of the network map is here: www.flickr.com/photos/marc_smith/5666637994/sizes/o/

A detailed list of top most between users is here: www.flickr.com/photos/marc_smith/5666069249/

Top most between users: @nytimes, @skynews, @peoplemag, @royalweddingcnn, @itv_news, @katewilliam2011, @julieetchitv, @abc, @cbsnews, @abcroyals

Graph Metric: Value
Graph Type: Directed
Vertices: 1000
Unique Edges: 1735
Edges With Duplicates: 531
Total Edges: 2266
Self-Loops: 0
Connected Components: 271
Single-Vertex Connected Components: 246
Maximum Vertices in a Connected Component: 701
Maximum Edges in a Connected Component: 2199
Maximum Geodesic Distance (Diameter): 11
Average Geodesic Distance: 3.892905
Graph Density: 0.001984985
NodeXL Version: 1.0.1.166

NodeXL is free and open and available from www.codeplex.com/nodexl

NodeXL is developed by the Social Media Research Foundation (www.smrfoundation.org) – which is dedicated to open tools, open data, and open scholarship.

The book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.

http://www.ischools.org/iConference11/2011index/

Our paper, Finding Social Roles in Wikipedia,  about the variety of  roles people perform in Wikis received the best paper award (along with 4 others) in a field of 86 papers.   The 2011 iConference accepted 86 papers, and had about 550 attendees.

The paper is authored by: Howard T. Welser at Ohio University, Austin Lin at Cornell University and Microsoft, Dan Cosley, Fedor Dokshin, Gueorgi Kossinets and Geri Gay at  Cornell University, and Marc Smith from Connected Action.

The paper pdf pre-print is available here: http://oak.cats.ohiou.edu/~welser/Welser.Cosley.plus.Wiki.Roles.pdf

The link to the ACM abstract and pdf: http://portal.acm.org/citation.cfm?id=1940778&CFID=9933318&CFTOKEN=58981138

Abstract: This paper investigates some of the social roles people play in the online community of Wikipedia. We start from qualitative comments posted on community oriented pages, wiki project memberships, and user talk pages in order to identify a sample of editors who represent four key roles: substantive experts, technical editors, vandal fighters, and social networkers. Patterns in edit histories and egocentric network visualizations suggest potential “structural signatures” that could be used as quantitative indicators of role adoption. Using simple metrics based on edit histories we compare two samples of Wikipedians: a collection of long term dedicated editors, and a cohort of editors from a one month window of new arrivals. According to these metrics, we find that the proportions of editor types in the new cohort are similar those observed in the sample of dedicated contributors. The number of new editors playing helpful roles in a single month’s cohort nearly equal the number found in the dedicated sample. This suggests that informal socialization has the potential provide sufficient role related labor despite growth and change in Wikipedia. These results are preliminary, and we describe several ways that the method can be improved, including the expansion and refinement of role signatures and identification of other important social roles.

Today, we release a new NodeXL feature in version  .164  that we think will improve the results generated by other layout algorithms: Group Layout.  In the Layout Options menu in the NodeXL Network Graph Pane (called “Document Actions” by Excel) you will find that the dialog box has been updated:

Selecting the new “Lay out each of the graph’s groups in its own box and sort the boxes by group size” option and checking the “Show each box’s outline” can generate an image that neatly places each group in a bounded region.

Here we see the set of connections among the people who tweeted the string “msrtf11 OR techfest” – referring to the Microsoft Research TechFest 2011 event that took place in early March in Redmond, Washington.  This map clarifies the set of set of relationships among sub-groups within the graph.

Contrast this with the layout created without this feature turned on:

We still have some refinements coming that will improve this layout further (for example, the neat grid of isolated nodes takes an extra step today, we will try to make that happen automatically soon) but this is a nice step in making network graphs easier to understand.  Let us know what you think!

Here is a recipe for finding and building collections of influential Twitter users relevant to your goal and message.

A common question related to social media that I am often asked is: “how do we grow our twitter followers?”  I try to re-frame that question as “how can we get our message viewed by the right people?” and its related question: “who could best pass our message along?”

The goal is not to gain many followers, but rather to gain well positioned followers!  A well positioned follower is someone who talks about topics related to your topic and is located at the center of many relationships with other people in that topic network.  These highly central people are able to get their message to be visible to many people. If they re-tweet you, your message will go far.  Why would they re-tweet you?  First, they have to be able to hear you to re-tweet you and that means that you need to get these people to follow you.  Second, you need to say something sensible enough to be worth re-tweeting.

The task is finding the important users to focus on.  To find them, create a network map of the relevant topics.  A few people in these network maps will occupy key positions in which they have many connections or have special ties that bridge gaps between sub-groups.  There are often only a few of these people in any topic area.

Find these strategically located people and follow them and often they will follow you back. A good proxy for the strategic value of a person’s location is their “betweenness centrality” – a measure of how much a person acts a bridge between others.

If the people you select and follow do not immediately follow you back there is another opportunity to get them to follow you.  If you re-tweet particularly good content from the people you have selected to follow there is a good chance that you will be followed back.

Once you have identified, followed, and been followed back by some fraction of the influential people around your topics of interest you have a increased chance that your tweets will be re-tweeted.  For each re-tweet, your message is exposed to a potentially large and highly targeted group of people.  Over time it is possible to create a relationship with a collection of highly influential participants who may be interested in sharing your message with their followers.

The event is a globally visible opportunity for the President of the United States to present the Administration’s vision for its agenda for the year to the people of the US and the world.

The hashtag #stateoftheunion is already very active in Twitter.

This is a NodeXL map of the connections among people who recently tweeted the string “stateoftheunion” on 21 January, 2011.

The most between user, @keitholbermann, is highlighted.  Two major clusters emerge, shown arbitrarily here as green and blue, and which are more clearly seen in the filtered graph below the list.

Summary network statistics:

Graph Type Directed
Vertices 1259
Unique Edges 8014
Edges With Duplicates 544
Total Edges 8558
Connected Components 306
Single-Vertex Connected Components 293
Maximum Vertices in a Connected Component 937
Maximum Edges in a Connected Component 8513
Maximum Geodesic Distance (Diameter) 9
Average Geodesic Distance 3.140191
Graph Density 0.00522786

The most “between” contributors in the network are:

@keitholbermann, @borowitzreport, @thefix, @katyinindy,
@america1first, @wbconservative, @westwingreport, @dailykos,
@writer2go, and @gottalaff

When contributors with low “betweenness” are filtered out of the graph, two dominant clusters become easier to discern.  To the left are supporters of the President and to the right are those critical of the Administration.  A representative tweet from this cluster is highlighted.

A recent paper “EventGraphs: Charting Collections of Conference Connections” by Marc Smith from Connected Action, Professor Derek Hansen (College of Information Studies) and Professor Ben Shneiderman (Computer Science/Human Computer Interaction Lab) both from the University of Maryland and has been accepted for publication at the 2011 Hawaii International Conference on System Sciences (HICSS) Conference.  This is the 44th year for the conference. Derek Hansen presented the paper on January 7, 2011.

Hansen, D., Smith, M., Shneiderman, B., EventGraphs: charting collections of conference connections. Hawaii International Conference on System Sciences. Forty-Forth Annual Hawaii International Conference on System Sciences (HICSS). January 4-7, 2011. Kauai, Hawaii.

http://www.cs.umd.edu/localphp/hcil/tech-reports-search.php?number=2010-13

Our paper is about visualizing social media and it describes the visualization of the patterns of connections formed when people tweet about events like conferences and news stories.

EventGraphs are social media network diagrams constructed from content selected by its association with time-bounded events, such as conferences. Many conferences now communicate a common “hashtag” or keyword to identify messages related to the event. EventGraphs help make sense of the collections of connections that form when people follow, reply or mention one another and a keyword. This paper defines EventGraphs, characterizes different types, and shows how the social media network analysis add-in NodeXL supports their creation and analysis. The paper also identifies the structural and conversational patterns to look for and highlight in EventGraphs and provides design ideas for their improvement.

A collection of EventGraphs are available in flickr: http://www.flickr.com/photos/marc_smith/sets/72157625618025980/

The EventGraph for HICSS this year is here: 20110109-NodeXL-Twitter-HICSS

The top most between contributors to the HICSS Twitter graph this year are: @arcticpenguin @avantgame @barrywellman @clifflampe @dalprof @chandlerism @shakmatt @marc_smith @shen045 and @thecatandthekey

Here is the data set: 20110109-NodeXL-Twitter-HICSS
Graph Metric Value
Graph Type Directed
Vertices 92
Unique Edges 243
Edges With Duplicates 71
Total Edges 314
Self-Loops 0
Connected Components 21
Single-Vertex Connected Components 18
Maximum Vertices in a Connected Component 69
Maximum Edges in a Connected Component 307
Maximum Geodesic Distance (Diameter) 8
Average Geodesic Distance 3.081693
Graph Density 0.032967033

NodeXL Version 1.0.1.159

An article about social media visualization Social Seen: Analyzing and Visualizing Data from Social Networks by Hunter Whitney, appeared in UX Magazine on December 15, 2010.  It provides a great round up of tools and approaches to mapping populations in social media spaces.

Previous HICSS papers:

Gleave, Eric, Howard T. Welser, Marc Smith, and Thomas Lento.  2009.  “A conceptual and operational definition of social role in online community.”   In Proceedings of the 42nd  Hawaii International Conference on Systems Sciences (HICSS), January 5-8. Computer Society Press.  (Best Paper, Digital Media and Communication Mini-Track)

2009 – HICSS – 42 – Best Paper – A Conceptual and Operational Definition of ‘Social Role’ in Online Community

Fisher, D., Smith, M., and Welser, H. You Are Who You Talk To, Proceedings of HICSS, January 2006. (Best Paper, Digital Media and Communication Program)

http://www.connectedaction.net/wp-content/uploads/2009/08/2006-HICSS-You-Are-Who-You-Talk-To-Detecting-Roles-in-Usenet-Newsgroups.pdf

Viégas, Fernanda B., Marc Smith. “Newsgroup Crowds and AuthorLines: Visualizing the Activity of Individuals in Conversational Cyberspaces“, Proceedings of Hawaii International Conference on Software and Systems (HICSS) 2004. (Best Paper: Persistent Conversation Minitrack)

http://www.connectedaction.net/wp-content/uploads/2009/08/2004-HICSS-Viegas-and-Smith-Newsgroup-Crowds-and-Author-Lines.pdf

Here are some sample event graphs:

Once you start creating and collecting network graphs you may find you can build a significant collection: hundreds, thousands or tens of thousands of graphs may result from a study or on-going monitoring project. In a series of features in the NodeXL project we have enabled a workflow for constructing many social media  network graphs using the Network Server component (see: How to schedule the creation of a network with NodeXL and Windows Task Scheduler and: New NodeXL Network Server (v1.0.1.126) – Frequently Asked Questions).  This can result in a collection of *many* NodeXL (and GraphML) network files.  Then we implemented features that enabled “Automation”, the application of many operations in NodeXL (metrics calculation, autofill columns, layout and more) to many files without direct human engagement (see: Automatic for the people (who use the latest NodeXL!). Release v.1.0.1.128 and: Fully automatic: NodeXL can build your network graphs hands free).

A single workbook may contain data from a single NodeXL data collection, run on a particular day and collecting data from a few hours or days back from that moment  (depending on factors like the volume of activity around the selected keyword and the depth of the twitter search catalog, which is often not more than a week or two long and much shorter for active topics).  An example of a single network slice is this recent map of the connections among people who mentioned “microsoft research” in Twitter on a single day (December 18th, 2010):

:

This is a single slice of the network, a day out of months of activity.  A still frame can tell a rich story: this is a picture of a crowd that has gathered to discuss a topic of common interest: “microsoft research“.  It illustrates a structure common to many large discussions of popular topics — a large set of isolates (the rows at the bottom) who were not observed to have a followed, mentions, or replies relationship to anyone else who tweeted the same term.  These are casual mentioners of the topic.  At the end of these rows are a small number of dyads, triads, and small components of a handful of people who link to one another but not to the largest connected component. These are pairs or small groups discussing the topic among themselves, but none are connected to a larger component.  Above these rows is the “giant component” — the blob of people who do have a connection to someone else who also tweeted a message containing the same term who in turn have a connection that leads to a large number of others.  The giant component is itself composed of several sub-components of densely connected groups.  At the center of each component are the core users, the people who often hold their cluster together. Between these clusters are the bridges, the people who link otherwise disconnected sub-groups.  At the edges are the peripheral people who have just taken the first step up from being an isolate and have formed a single reply, mention, or follows relationship to someone else who also tweeted the search keyword and can bridge them back to the core of the giant component.  This is a large and active network with hybrid qualities.  There is a “brand” or broadcast element in it: the yellow cluster is a hub and spoke structure centered on the Microsoft Research Twitter account.  These people re-tweet what this account publishes but do not connect to one another.  Just a few of these people set off second and third waves of retweets.  Elsewhere in the graph there are other network structures present, for example the green and blue clusters feature people are centered around their own discussions of the term “microsoft research“.

If you collect many still frames of slices of network activity there is great value in exploring the way the network graph changes over time.  In the most recent release NodeXL provides the first step in a series of features related to time and graph comparison.  You can now create a workbook that aggregates the overall metrics (edge counts, vertex counts, connected component counts, etc.) for a folder full of NodeXL workbooks. In NodeXL follow the menu path: NodeXL>Analysis>Graph Metrics>Aggregate Overall Metrics to get this:

The result of this feature is a workbook with a row containing the summary data from each of the workbooks in the target folder.  Any arbitrary collection of network workbooks can be aggregated but this is particularly useful when the workbooks are sequential time slices.

An example is the time series plot below tracking the rise and fall of several Twitter volume and network measures for the “microsoft research” search term over several months:

This chart tracks the number of vertices (each vertex in this case is a person  our data collector saw tweet about the search term “microsoft research“) in each (almost) daily network snapshot.  In addition the unique edges or connections between these Twitter users are plotted along with the number of people with no connections (“Single-Vertex Connected Components”).  The size of the largest component in the network (“Maximum vertices in a connected component “) is a measure of the changing size of the core community of discussion participants.  Measures like the maximum and average “geodesic” distance provide a rough measure of how long and thin (high values) or generally spherical (low values) a particular network is shaped. A “geodesic” is the longest path that can be walked through the network.  Long skinny networks may indicate the presence of loosely connected smaller groups that have a few people who act as bridges.  Low geodesic values suggest dense networks with people connected to many others with few isolates and sub-groups.

The peaks are closely associated with major events on the Microsoft Research calendar, like the 2010 Microsoft Research Faculty Summit event I attended in early July.

I find the ratios between measures of the size of the large network component and the population of isolates to be interesting.  As events go on over a period of days more people connect with others who are talking about the same topic, growing the size of the large connected component.  But often the isolate population also grows during this time as people at the periphery of the topic network catch sight of mentions of the event and tweet about it.  I could imagine one goal of social media management to be the conversion of isolates to connected component members.  Those who follow, reply or mention even a single other person also talking about a topic are more likely to return and engage than those who have zero connections.  It is not clear if more connections provide a linear increase in continued engagement, I suspect that the main effect is at the zero/one divide and drops off in effect after the first dozen or so connections.  Encouraging cohesion and network density by replying to isolates and encouraging others to do so may help keep a social media population focused and growing.

This feature follows the work done in the ManyNets project (http://www.cs.umd.edu/hcil/manynets/) at the University of Maryland by Manuel Freire, Catherine Plaisant, Ben Shneiderman, Awalin Sopan, and Miguel Rios.  ManyNets also created a framework for managing the metadata about collections of networks. ManyNets provides for  much richer interactions and linkages to the underlying networks than NodeXL can do so far.

As mobile devices become a major method for authoring and consuming social media, location data is increasingly a part of many posts, tweets, check-ins, and messages.  Many Twitter clients, for example, can add the user’s current latitude and longitude to the metadata associated with a tweet.  Other systems like Facebook Places, Google Latitude and Foursquare encourage users to declare  where they are to the world, often passing the information to other social media sites.

Using this location data in network analysis opens up a range of new opportunities.  Instead of a person – to – person social network, location data allows people to be linked to places and, by extension, places can be linked to other places based on the patterns of connection people create when located in a particular place.  A convergence of network analysis and Geographic Information Systems in underway.  A great example of this can be found in this wonderful video from the BBC which demonstrates the idea by mapping the flow of telephone calls, texts, and data around the UK and the wider world.

Link on the BBC

Even better is this video from the SensibleCity group at MIT:

Now, NodeXL (v.156) has the first of a series of features that will start to approximate the experience displayed in the video by supporting the import of location data about networks and plotting networks onto maps.

For now, we have started importing latitude and longitude data that Twitter makes available.  If you check “Add a Tweet column to the Vertices worksheet” in NodeXL, Data, Import, From Twitter Search Network or From Twitter User Network, the Twitter user’s geographical coordinates will be added to the Vertices worksheet when they are available.

Note that not every tweet has a latitude and longitude, in fact many do not (yet).  Further, note that not every latitude and longitude is accurate, many are not.

We need to implement more features for better location data support in a NodeXL workbook, but this is a start.  We are interested in exploring geospatial networks and Twitter is a great data source.  With this data in place we may look into features that emit KML files for exploration in other packages like Google Earth.  A nifty Google Earth/Spreadsheet importer can take small sets (400) of location data points in a spreadsheet and export them to a KML file, something we could implement in the future as well.  In addition we may be able to connect directly with services like Bing Maps and Google Maps to display connections between nodes with known locations.  Metrics that calculate the distance between nodes seem sensible as well.

Location coordinates are the key to a cornucopia of related data about a place.  Given a latitude and longitude it is possible to find the name of the city it is located in, look up data about that location in official records as well as resources like Wikipedia.  Income, education, property values, weather, photos, and more can be pulled together from just a simple lat/long.  All of these attributes could be used to cluster or illustrate the network visualization.

In this map nodes represent the major feature groups and functions in the NodeXL application.

This map will become the default file that will open when you run NodeXL for the first time.  You will see a dialog like this:

Select Yes to have the graph above imported into the workbook.  You can then display the graph using the Show Graph button in the NodeXL menu ribbon.

After that, it will be available via the help menus. When you import the file, all of the data is also available in the spreadsheet part of NodeXL so that you can experiment with changing values there to see the impact in the graph display after you hit the “refresh graphs” button.

Over the coming weeks we plan to release additional sample network data sets that illustrate key concepts and methods in network science.  Suggestions for sample networks are welcome!

Here are some NodeXL generated maps of recent  discussions around Wikileaks, pdfleaks, and cablegate in Twitter:

These are the connections among the people who tweeted the term “wikileaks” on 11 December 2010. The “wikileaks” account is at the center of the inner circle.  It is surrounded by a collection of very lightly interconnected people (there is a low clustering coefficient) who retweet messages from the wikileaks account.  This ring is surrounded by a thinner ring of 2nd order retweets.  This is a very common pattern for a successful “brand” or broadcast account, getting lots of retweets and, even more impressive, retweets of retweets.

The most between people who tweeted the term “wikileaks” on 11 December 2010.  The top ten: @wikileaks, @melhoresfrases, @ukelectionnews, @nonradical, @nelsonbocaranda, @linuxmall, @dominiofeminino, @resermarca, @crazy_dymnd, @rodolfomoros

Here is the data file: 20101209-NodeXL-Twitter-wikileaks

These are the connections among people who recently tweeted “pdfleaks” in Twitter on 11 December 2010.  It shares the brand/broadcast structure of the wikileaks account shown above.  After the wikileaks account itself, the second most between participant is @jeffjarvis who uniquely bridged to many people who would otherwise not be connected in this graph.

The most between people who tweeted the term pdfleaks“ on 11 December 2010.

Here is the data set: 20101211-NodeXL-Twitter-pdfleaks

The most between people who tweeted the term “cablegate” on 11 December 2010.  The cablegate discussion is more multipolar, with several high betweenness hubs connecting to otherwise separate communities.  El Pais, for example, is reaching a mostly Spanish language community.  The top ten: @anonops, @el_pais, @mparent77772, @wllawyer, @wikileaks_pp, @gdncables, @milenio, @evgenymorozov, @muschelschloss, @saladeprensa.

Here is the data set:

I spoke at the University of Michigan, School of Information on October 19th, 2010 about “Charting Collections of Connections in Social Media: Mapping and Measuring Social Media Networks to Find Key Positions and Structures“.

I demonstrated the ways social network data sets can be extracted from social media services like Facebook, Twitter, email, YouTube, and flickr.  These network graphs can reveal information about the “shape” of the population in terms of the presence of sub-groups and communities within the larger population.  In addition, each individual participant is located or positioned within the graph, helping to identify the people who are “core” versus those who are peripheral, as well as those who occupy the position of “bridge” between two otherwise separate groups.

Yahoo! Speaker Series

The Yahoo Speaker Series at the School of Information supports distinguished guest lecturers from the fields of information and technology.

2010 Speaker: Marc Smith
VIDEO: Marc Smith

Marc Smith, chief social scientist with the Connected Action Social Group, presented “Charting Collections of Connections in Social Media: Mapping and Measuring Social Media Networks to Find Key Positions and Structures,” on Tuesday, Oct. 19, 2010.

Smith’s talk was sponsored by the Yahoo! Speaker Series, Michigan Interactive & Social Computing, and the School of Information.

In this talk, Smith described how networks are a data structure common across all social media systems — systems defined by enabling populations to author collections of connections. The Social Media Research Foundation‘s NodeXL project makes analysis of social media networks accessible to most users of the Excel spreadsheet application. Using NodeXL, networks become as easy to create and analyze as pie charts. Applying the tool to a range of social media networks has already revealed the variations present in online social spaces. A review of the tool and images of Twitter, Flickr, YouTube, and e-mail networks will be presented, illustrating different patterns created when communities, brands, and controversies are discussed.

I am coming to understand what is interesting in any particular network visualization by looking at many network visualizations.

Using NodeXL, I have made several maps of  social media networks of people talking about several topics of interest from current events to conferences I attend.  You can find a collection of them on flickr.

I look at these images and look for differences in the number of big clusters: some images have a “double yolk” – that I propose is a necessary (but not necessarily sufficient) condition of defining a topic to be “controversial”.  These two cluster networks have two well defined populations who lack much if any connection across the divide to the “other” side.

Some networks are highly populated but sparse, these are often the networks that form around brands where a central account tweets and is retweeted by many.  But these many lack much connection to one another.  So these brands form broadcast networks, not communities.

Some networks are dense single clusters with few if any “isolates”.  Isolates are people who say a term, and thus appear in the graph, but have no connections (follows, replies, ore mentions) to anyone else in the graph (at least as observed and reported by twitter at that time).  These dense clusters without isolates are topics where everyone is in-group.  Examples, like “scrm”, are technical and business terms that identify medium sized populations with high levels of density.

Have a look and see what patterns you can find.