Mapping social media networks (with no coding) using NodeXL

Time: 16:50 on 01 Mar 2012.

Session type: 40 minute presentation

Topics: Visualization & Interface

Description: Maps of the complex connections that form when people link, like, reply, rate, review, favorite, friend, follow, edit, and mention one another can reveal important trends. It is possible to create network maps with free and open tools that identify key people and sub-groups in any social media population with just a few key clicks. Can you make a pie chart? You can now make a network chart.

Abstract: Networks are a data structure common found across all social media services that allow populations to author collections of connections. The Social Media Research Foundation’s (http://www.smrfoundation.org) free and open NodeXL project (http://nodexl.codeplex.com) makes analysis of social media networks accessible to most users of the Excel spreadsheet application. With NodeXL, Networks become as easy to create 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 email networks will be presented.

We now live in a sea of tweets, posts, blogs, and updates coming from a significant fraction of the people in the connected world. Our personal and professional relationships are now made up as much of texts, emails, phone calls, photos, videos, documents, slides, and game play as by face-to-face interactions. Social media can be a bewildering stream of comments, a daunting fire hose of content. With better tools and a few key concepts from the social sciences, the social media swarm of favorites, comments, tags, likes, ratings, and links can be brought into clearer focus to reveal key people, topics and sub-communities. As more social interactions move through machine-readable data sets new insights and illustrations of human relationships and organizations become possible. But new forms of data require new tools to collect, analyze, and communicate insights.

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.

I will speak at the International Symposium on Convergence Technology (ConTech 2011) – Smart & Humane World – on November 3rd in Seoul, South Korea.

Date: 2011 November 3 (Thurs)
Place: COEX Grand Ballroom, Seoul, Korea
Organized by Advanced Institutes of Convergence Technologies (AICT), Seoul National University (SNU)
In Cooperation with Ministry of Knowledge Economy, Ministry of Education, Science and Technology, National Research Foundation of Korea, Graduate School of Convergence Science and Technology (GSCST)
Symposium Chair : Choi, Yanghee (President, AICT)

Program
09:00~09:30 Registration
09:30~10:00 Opening Ceremony
Plenary Session : Smart & Humane World through Convergence
10:00~10:40 Speaker (TBD)
10:50~11:30 Speaker (TBD)
11:30~13:00 Lunch
Session 1 : Bio Convergence (Chair : Prof. Kim, Sunghoon)
Session 2 : IT Convergence (Chair : Dr. Lee, Manjai)
Session 3 : Appropriate Technology (Chair : Prof. Kang, Namjun)
13:00~15:00 Scott A. Strobel (Professor, Yale University)
Speaker Kevin Kim (Professor, University of Illinois)
Speaker Masaru Kitsuregawa (Professor, Tokyo University)
Speaker Haesun Park (Professor, Georgia Institute of Technology)
Speaker Marc Smith (Connected Action)
Speaker Sang-goo Lee (Professor, Seoul National University)
Speaker Haklae Kim (Samsung)
Speaker Raghu Ramakrishnan (Yahoo)

My slides: 20111103 con tech2011-marc smith

I will also visit Professor Han Woo Park at YeungNam University (Wikipedia) in Daegu, South Korea to meet with his students in the Webometrics Institute program.

This will be my second trip to Korea, I was there last year for a related event.  Pictures after the jump:

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/

This year the IEEE Social Computing conference is being held in Boston, October 9-11, 2011.

The NodeXL team from the Social Media Research Foundation have a paper on our newest layout feature in NodeXL: Group-in-a-box.

Abstract: Communities in social networks emerge from interactions among individuals and can be analyzed through a combination of clustering and graph layout algorithms. These approaches result in 2D or 3D visualizations of clustered graphs, with groups of vertices representing individuals that form a community. However, in many instances the vertices have attributes that divide individuals into distinct categories such as gender, profession, geographic location, and similar. It is often important to investigate what categories of individuals comprise each community and vice-versa, how the community structures associate the individuals from the same category. Currently, there are no effective methods for analyzing both the community structure and the category-based partitions of social graphs. We propose Group-In-a-Box (GIB), a metalayout for clustered graphs that enables multi-faceted analysis of networks. It uses the treemap space filling technique to display each graph cluster or category group within its own box, sized according to the number of vertices therein. GIB optimizes visualization of the network sub-graphs, providing a semantic substrate for category-based and cluster-based partitions of social graphs. We illustrate the application of GIB to multi-faceted analysis of real social networks and discuss desirable properties of GIB using synthetic datasets.

The paper is authored by:

Eduarda Mendes Rodrigues*, Natasa Milic-Frayling†, Marc Smith‡, Ben Shneiderman§, Derek Hansen¶
* Dept. of Informatics Engineering, Faculty of Engineering, University of Porto, Portugal – eduardamr @ acm.org
† Microsoft Research, Cambridge, UK -natasamf @ microsoft.com
‡ Connected Action Consulting Group, Belmont, California, USA – marc @ connectedaction.net
§ Dept. of Computer Science & Human-Computer Interaction Lab, University of Maryland, College Park, Maryland, USA – ben @ cs.umd.edu
¶ College of Information Studies, University of Maryland, College Park, Maryland – dlhansen @ umd.edu

A map of the connections among the people who recently tweeted #SocialCom2011:

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

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/6232130442/sizes/l/in/ph…

Top most between users:
@danielequercia
@gadgetman4u
@bkeegan
@shaunlawson
@maryheston
@mmiiina
@ronaldomenezes
@theshadowhost
@fergal_reid
@cosleydr

Graph Metric: Value
Graph Type: Directed
Vertices: 36
Unique Edges: 119
Edges With Duplicates: 155
Total Edges: 274
Self-Loops: 105
Connected Components: 2
Single-Vertex Connected Components: 1
Maximum Vertices in a Connected Component: 35
Maximum Edges in a Connected Component: 273
Maximum Geodesic Distance (Diameter): 5
Average Geodesic Distance: 2.174551
Graph Density: 0.107936508
NodeXL Version: 1.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 Future of Technology in Education workshop met on 7 October 2011 in London at the University of London Computer Centre (ULCC) to discuss the ways technology is changing the learning experience.

The hashtag for the event is #FOTE11 so I made a NodeXL SNA Map -

The following is a map of the connections among the Twitter users who recently tweeted the word #fote11 when queried on October 7, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

See: fote-conference.com/wordpress/

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/6221247656/sizes/l/in/ph…

Top most between users:
@fotie
@jamesclay
@timbuckteeth
@hopkinsdavid
@dajbelshaw
@eingang
@fredgarnett
@pressfuturist
@grahambm
@eyebeams

Graph Metric: Value
Graph Type: Directed
Vertices: 251
Unique Edges: 2904
Edges With Duplicates: 1908
Total Edges: 4812
Self-Loops: 730
Connected Components: 7
Single-Vertex Connected Components: 6
Maximum Vertices in a Connected Component: 245
Maximum Edges in a Connected Component: 4803
Maximum Geodesic Distance (Diameter): 4
Average Geodesic Distance: 2.246839
Graph Density: 0.052988048
NodeXL Version: 1.0.1.179

The data set for this network is available from the NodeXLGraphGallery.

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.

At the end of the conference on October 5th, the network of connections among the people who tweeted about Wikisym looked like this:

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

See: www.wikisym.org/

Top most between users:
@edchi
@jfelipe
@phauly
@readermeter
@hfordsa
@wikisym
@clifflampe
@staeiou
@geoplace
@wikimedia

Graph Metric: Value
Graph Type: Directed
Vertices: 170
Unique Edges: 1163
Edges With Duplicates: 2165
Total Edges: 3328
Self-Loops: 658
Connected Components: 5
Single-Vertex Connected Components: 3
Maximum Vertices in a Connected Component: 165
Maximum Edges in a Connected Component: 3319
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.385502
Graph Density: 0.052941176
NodeXL Version: 1.0.1.179

In contrast, a few days earlier, these are the connections among the Twitter users who recently tweeted the word wikisym when queried on October 3, 2011, scaled by numbers of followers (with outliers thresholded). Connections created when users reply, mention or follow one another.

Top most between users:
@wikisym
@jfelipe
@andicat
@geoplace
@staeiou
@dirkriehle
@wikimedia
@edchi
@bkeegan
@hfordsa

Graph Metric: Value
Graph Type: Directed
Vertices: 78
Unique Edges: 459
Edges With Duplicates: 354
Total Edges: 813
Self-Loops: 132
Connected Components: 10
Single-Vertex Connected Components: 8
Maximum Vertices in a Connected Component: 68
Maximum Edges in a Connected Component: 800
Maximum Geodesic Distance (Diameter): 5
Average Geodesic Distance: 2.207506
Graph Density: 0.086913087
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 book, Analyzing social media networks with NodeXL: Insights from a connected world, is available from Morgan Kaufmann and from Amazon.

Marc Smith on Twitter.

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.

 

Please vote on our SxSW 2012 panel:

Thanks for your vote for our SxSW panel!

Here is a network visualization with all the edges drawn as straight lines:

The same network graph can be drawn with slightly curved edges:

The result is a slight improvement in readability.

To start, the edges curve just a bit.  Soon, we will allow user control over the extent of the curvature.

Turn on curved edges by checking the box in the Graph Options dialog accessed from the graph pane.

This is a map of the connections among the people who tweeted the terms “FOCAS11″ or “Aspen Institute” on August 2, 2011.

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

See: www.aspeninstitute.org/policy-work/communications-society…

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/6001893675/sizes/o/

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

Top most between users:
@aspeninstitute
@lancearmstrong
@emptywheel
@knightfdn
@pkedrosky
@bostonreview
@josefjohann
@kgosztola
@utknightcenter
@sowers

Graph Metric: Value
Graph Type: Directed
Vertices: 324
Unique Edges: 649
Edges With Duplicates: 743
Total Edges: 1392
Self-Loops: 339
Connected Components: 81
Single-Vertex Connected Components: 76
Maximum Vertices in a Connected Component: 240
Maximum Edges in a Connected Component: 1284
Maximum Geodesic Distance (Diameter): 7
Average Geodesic Distance: 2.67739
Graph Density: 0.007023277
NodeXL Version: 1.0.1.173

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.

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.

On June 22nd in New York City Wired Magazine and the Economist hosted a day of discussions and displays related to the theme of “Nextwork” hosted by Juniper Networks and located at the Tribeca Rooftop.

The Social Media Research Foundation displayed and printed  Nextwork Networks maps of the connections among the people who tweeted about the conference, the speakers, and their companies.

Visit the NextWork Network booth hosted by the Social Media Research Foundation to see a map of the connections among people who tweeted the term “NextWork“.  Networks are important data structures but the tools to access, analyze and visualize networks have been hard to use.  New tools now make networks as easy to handle as making a pie chart.  NodeXL, the free and open network overview, discovery and exploration add-in for the familiar Excel spreadsheet, makes creating network diagrams and gaining insights much simpler (see: http://nodexl.codeplex.com).  Using NodeXL, we have been collecting all the tweets that mention the NextWork event and building a network map of the ways those people connect to one another.  Not everyone is equally connected: some people occupy more strategic locations in the web of connections than others.   Find out who: request your own NodeXL social media network map for your Twitter account or the name of your company or brand (or your competitors) by dropping by the booth (or visit: http://www.smrfoundation.org/nextwork2011).

Here is an example, a map of the connections among the people who recently tweeted the name “Kevin Kelly”, one of the speakers at the event:

This is a map of the connections among the people who tweeted the term “Nextwork”:

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.

The ACM CHI 2011 Conference is taking place in Vancouver, BC.

May 10, 2011

May 8, 2011

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

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/5701022497/sizes/o/in/ph…

Top most between users:
@chi2011
@msftresearch
@edchi
@jeffbigham
@landay
@evanmpeck
@acagamic
@clifflampe
@yardi
@eytanadar

Graph Metric: Value
Graph Type: Directed
Vertices: 421
Unique Edges: 3849
Edges With Duplicates: 324
Total Edges: 4173
Self-Loops: 0
Connected Components: 32
Single-Vertex Connected Components: 29
Maximum Vertices in a Connected Component: 384
Maximum Edges in a Connected Component: 4146
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.553249
Graph Density: 0.022587943

NodeXL Version1.0.1.167

Data set in NodeXL format.

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.

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.

Lists are a recent feature of Twitter which enable users to compile collections of users to follow in a single tweet stream.  People can add up to 500 people to follow on a single list.    People on a list may be connected to one another if one follows the other.

Some people on a list may have many connections.  Some have only a few or even no connections to others on the list.

In version 161 of NodeXL you may now create maps of the connections among a list of Twitter users.

There are two options in this feature.  One makes use of the List functions in Twitter.  If you request the map for a single twitter list, NodeXL will build a map of the connections among all the people Twitter reports as being on the list.  You can create and manage the people on a list using the Twitter list features, or select an existing Twitter list created by other users.

A second option in this feature accepts a list of up to 10,000 twitter user names pasted into the query text box.  If you have a list of users and want a map of how they are connected, and the list is not already in Twitter, just paste them here and get a map.

Either way, a connection will be created for every two users if one follows the other.

Here is an example of the network map of the Twitter list of social network analysis people maintained by Valdis Krebs: valdiskrebs\network-analysts

Here is a NodeXL map of the connections among the people who tweeted the term PDA2011 OR PDA11:

The top most between people in this graph were: @anarchivist, @blefurgy, @naypinya, @rodanda, @jeffubois, @scottros, @evancaroll, @kevinmarks, @vurayav, and @sshreeves.

Here is the video from my talk:

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!

I will be speaking at the next Predictive Analytics World in San Francisco– March 14-15, 2011 about measuring and mapping social media networks with NodeXL:

Social Data: Advanced Methods – Social (Media) Network Analysis with NodeXL
www.predictiveanalyticsworld.com/sanfrancisco/2011/agenda.php#day2-13a

Networks are the common data structure that unify the otherwise diverse range of social media services. In this session learn how to extract social networks from various social media systems and analyze and visualize the structures found in collections of connections. Learn to use the free and open NodeXL add-in for Excel 2007/2010 to analyze email, twitter, facebook, youtube, www, flickr, and wiki networks.

Here is an example – a map of the connections among the people who recently tweeted the string “#pawcon”.

Connections among the Twitter users who recently mentioned PAWCON when queried on March 14, 2011 including tweets from the period 3/10/2011 15:13 to 3/15/2011 3:51, scaled by numbers of followers.
NodeXL is available from www.codeplex.com/nodexl

The top most between contributors were: @tapan_patel, @jamet123, @zementis, @pawcon, @ibmspss, @sasanalytics, @kristinevick, @waynettetubbs, @dataspora, @inside_r

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: