683 | computer graphics (Pajek) 3d layout of 5-regular graph G(3,53) obtained using eigenvectors. Colors of vertices represent distances from the 'Cyan' vertex. |
1255 | 2007 Web by Daniele Galiffa using Actionscript Analysis and experiments on relations into the Italian Blogosphere I’ve been invited to join to the blogbabel initiative that aims to map the italian blogosphere. My effort in this interesting project is about to find some new, useful infovis-related solutions to offer some better cognitive tools to approach the Italian blog world and its relations. I started looking around to find interesting solutions about blog-mapping ( from the Manuel Lima’s blogviz, to the BlogoPole French initiative and the first BlogBabel visualization from Ludo). What seemed to me really interesting is mainly the relations Analysis and not the Graph representation, because it tends to offer a “star-system†style visual environment that requires some more deep work in order to be used to understand how blogs are related each other. My idea is really simple: suppose you have a line where you can use points to represent Blogs. Above the line I can have arches connecting a source blog (on the left side of the arch) to another (on the right side of the arch). Below the line I can have also arches, but the connection direction is from right to left. The use of arches and circles come out from “The Shape of Songs†by Martin Wattenberg. In this way we have a LinksOut View (UP) and a LinksIn View (DOWN) and we could use the opacity of each arch to visualize how relations are relevant considering the numeber of links (in/out) among blogs. The above description was modified from: http://www.mentegrafica.it/blog/2007/05/10/analisys-and-experiments-on-relation-into-the-italian-blogosphere/ (images may be found at http://flickr.com/photos/danielegaliffa/tags/blogosphere/) |
784 | 1940 computer graphics by (unknown) A graph of a Budget prepared on a Cosmograph. Source: H. Arkin., Graphs: How to make and use them (Harper & Brothers Publishers, New York, ed. Revised, 1940). |
1399 | 2010 by Give Me My Data / Nodebox 1.0 Network graph visualization of Facebook contacts using data retrieved using Give Me My Data http://givememydata.com and Nodebox 1.0. |
1400 | 2010 by Give Me My Data / Nodebox 1.0 Network graph visualization of Facebook contacts using data retrieved using Give Me My Data http://givememydata.com and Nodebox 1.0. |
1401 | 2010 by Give Me My Data / Nodebox 1.0 Network graph visualization of Facebook contacts and mutual contacts using data retrieved using Give Me My Data http://givememydata.com and Nodebox 1.0. |
1402 | 2010 by Give Me My Data / Nodebox 1.0 Network graph visualization of Facebook contacts and mutual contacts using data retrieved using Give Me My Data http://givememydata.com and Nodebox 1.0. |
927 | 2005 computer graphics by Doantam Phan, Ling Xiao, Ron Yeh Flow Map Layout is a novel visualization technique seen as a hybrid of graphs and flow maps. Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded, or the number of packets in a network. One of the most famous flow maps, depicting Napoleon's Russian Campaign, was created by Charles Joseph Minard in 1869, and can be seen here. The advantage of flow maps is that they reduce visual clutter by merging edges. Most flow maps are drawn by hand and there are few computer algorithms available. In Flow Map Layout, the authors present a method for generating flow maps using hierarchical clustering given a set of nodes, positions, and flow data between the nodes. The technique is inspired by graph layout algorithms that minimize edge crossings and distort node positions, while maintaining their relative position to one another. The authors have demonstrated the technique by producing flow maps for network traffic, census data, and trade data. The first image illustrates a close-up of top 15 imports to Spain and France. Notice the branching structure is shared across different nodes, for example Spain, and France branch to the Netherlands, Germany and the UK in the same way. The second image represents an outgoing migration map from Colorado (USA) from 1995-2000, generated by the algorithm without layout adjustment or edge routing. |
905 | 2005 computer graphics by Sheep N. Dalton These images are part of a research done by Sheep N. Dalton in the context of a paper for the Third Space Syntax conference in Atlanta, USA. The paper covers a new theory that can perform new kinds of configurational analysis. The software which performs the analysis is called "Meanda" (Mean Depth Angular) and was developed by Dalton. The project visualizes the network structure of the graph that is formed from the network of streets. This work is derived from a set of network theories in architecture known as "Space Syntax". It is generally found that these colors which are formed from a measurement of graph structure correlate well with observed patterns of pedestrian movement. The first image illustrates London Radius infinity Mean Depth. This is a vehicular map so Oxford street has been removed to represent it's non availability to cars. The second image shows Amsterdam Mean depth. For more information on how fractional analysis is computed click here |
32 | 1763 print by Thomas Bayes (1702-1761), England Graph of the beta density. |
1069 | 2006 computer graphics by Roberto Bianchettin The GraphNews project (beta released) has been developed as a new visualization and browsing feature of the Libero WebNews service, part of the Libero portal, one of the major Italian Internet Service providers. Libero WebNews, developed from Arianna Team, allows a fast visualization of the news published on the Web from more than 1.100 journalistic sources online. GraphNews analyzes the content of the news articles processed in Libero WebNews, with the goal of highlighting the main subjects, i.e. the people, the products, the localities, the societies, the institutions, etc., and extracts the relations that elapse between them. The final result of this elaboration is a graph visualization of these subjects and their relations. The graph is browsable through a simple one click: GraphNews also allows the change of detail level and the time period (day, week, month) of the graph. In the cases shown here, the inputted word for the first image was "Apple", while on the second was "Google". |
809 | 2004 computer graphics by Jeffrey Heer This image is a visualization of Jeffrey Heer's personal friendster network to 3 hops out, an online social network consisting of Jeffrey, his "friends", his friends' friends, and his friends' friends' friends. The resulting networks consist of 47471 people connected by 432430 friendship relations. The data was collected during the timespan of October 2003 to February 2004 as part of the Vizster project. The images were created using the prefuse visualization toolkit. Nodes are colored by proximity to the center of the network (which in this case is Jeffrey Heer himself). The central person is the brightest, that person's friends next brightest and so on. The elements are also ordered so that friends and relations closer from the central person are drawn on top of more distant relations and people. The graph layout was computed using a standard force-directed layout method in which nodes exert anti-gravity against each other and the edges are treated as springs. |
1052 | 2006 computer graphics by Matthew Hurst Matthew Hurst is Director of Research at Intelliseek and co-creator of BlogPulse. Hurst maintains in his blog (http://datamining.typepad.com) a gallery of images visualizing different aspects of the blogosphere. The first graph is only showing the links between the blogs, which as argued by the author gives us a far better look at the structure than if we include all the nodes. In this image, we are looking at the core of the blogosphere. The dark edges show the reciprocal links (where A has cited B and B has cited A), the lighter edges indicate a-reciprocal links. The larger, denser area of the graph is that part of the blogosphere generally characterised by socio-political discussion (the periphery contains some topical groupings). Above and to the left is that area of the blogosphere concerned with technical discussion and gadgetry. The second graph is essentially the same as the above with the nodes added. The size of the nodes represents the number of inlinks to the blog. The colours represent the URL - blogs hosted at the same domain have the same colour. |
680 | computer graphics (Pajek) p-graph of the largest component in the genealogy of American presidents with shortest path between G.H.W. Bush and F.D. Roosevelt. |
653 | computer graphics by Graphviz - Graph Visualization Software This example illustrates the use of partially transparent colors for node fill and graph background. |
875 | 2004 computer graphics by Jodi Dean, Zachary Devereaux and The Govcom.org Foundation, an Amsterdam-based organization dedicated to creating and hosting political tools on the Web, and its collaborators have developed a software tool that locates and visualizes networks on the Web. The Issue Crawler, at http://issuecrawler.net, is used by NGOs and other researchers to answer questions about specific networks and effective networking more generally. One may also do in-depth research with the software. This image represents the entangled network of the most popular political blogs on the net. The graph build with Issue Crawler was produced by John Hawkin for issuenetwork.org (the workshop site by the Govcom.org Foundation), using a list available at rightwingnews.com that can be seen here. Source: News about Networks, workshop by the Govcom.org Foundation, de Balie Center for Culture and Politics, Amsterdam, 21-24 June 2004, with support from the Ford Foundation, New York, (http://www.issuenetwork.org/node.php?id=47). |
651 | computer graphics, after hand-made figure by Graphviz - Graph Visualization Software This graph was created from a hand-made figure in an operating system paper. |
684 | computer graphics (Pajek) |
980 | 2003 computer graphics by Ed Blanchfield Ed Blanchfield used a Firewall/Intrusion Detection System (IDS) log data to get "before" and "after" graphs showing the impact of an MS-SQL worm, which hit the Internet around January 25th 2003. When this particular worm hit a large class B sized network, an IDS system designed and implemented by Blanchfield for a large managed services provider, was one of the first sites in the world to detect and report the incident. Ed posted his original findings and info to various security lists and quickly wrote up a parser to create GDL files from Firewall and IDS logs, which he fed into aiSee Graph Layout Software in order to visually map this worm's effect on their customer's network. The first image is a visualization of log data for a class B firewall without background worm traffic, while the second represents the same data with background worm traffic. The graphs show just 15 minutes worth of traffic at midnight, but the impact of the worm is already clearly visible. You can imagine what 24 hours must have been like. |