Search Information Visualization Database
infovis.info
1100+ examples of information visualization

home        .        about              

Search for:    Mode:
(ex: Paley, New York, subway, PIIM)

Found 141 results for "graph":

134
1999 computer graphics by Leland Wilkinson (1944-), USA

Grammar of Graphics: A comprehensive systematization of grammatical rules for data and graphs and graph algebras within an object-oriented, computational framework.

Wilkinson, L. (1999). The Grammar of Graphics. New York: Springer. ISBN 0-387-98774-6.


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.


986
2001 computer graphics by Ka-Ping Yee, Danyel Fisher, Rach

Presented at InfoVis 2001, this project presents a new animation technique for supporting interactive exploration of a graph using a radial tree layout method. As an alternative to trying to fit an entire graph into one view, this project provides exploration of subregions of the graph. Even if a graph is small enough to display all at once, it can be difficult to understand all of its relationships from only a single view. The ability to interactively view a graph from different perspectives can yield new insights.

The authors used a visualization paradigm in which the view of a graph is determined by the selection of a single node as the center of interest, or focus. The main contribution of this work is a new technique for animating the transitions from one view to the next in a smooth, appealing manner. The algorithm augments the well-known radial layout method by linearly interpolating the polar coordinates of the nodes and enforcing constraints on the new layout to keep it as similar as possible to the previous layout. When combined with a method for aggregating or eliding nodes far away from the focus, this technique can also provide an effective way to explore very large graphs.


732
2002 computer graphics by (unknown)

This graph reflects 1,134,634 IP addresses and 2,434,073 IP links (immediately adjacent addresses in a traceroute-like path) of topology data gathered from 25 monitors probing approximately 865,000 destinations spread across 76,000 (62% of the total) globally routable network prefixes.

"We then aggregate this view of the network into a topology of Autonomous Systems (ASes), each of which approximately maps to an Internet Service Provider (ISP) (Some ISPs administer more than one AS but it is not typical). We map each IP address to the AS responsible for routing it, i.e., the origin (end-of-path) AS for the best match IP prefix of this address in Border Gateway Protocol (BGP) routing tables collected by the University of Oregon's RouteViews project. The abstracted graph consists of 12,517 Autonomous System (AS) nodes and 35,334 peering sessions. The resulting graph contains 11,411 AS (73% of all ASes present in RouteViews BGP tables on 8 May 2003) and 32,209 peering sessions."


950
computer graphics by (unknown)

Bestiario is a studio based in Barcelona which work is based on a solid collaboration among several contributors. As stated in their website, they use non-conventional methods to transform complex content in interactive information spaces.

The displayed graph shows the network of interactions between individuals and group representatives that collaborate with bestiario. The initial configuration organizes people by their knowledge and core competences, where intertwined names of people are arranged according to key domains, such as science, narrative or community. Every domain node can be re-arranged and names are clickable, showing more detailed information about the individual's expertise.


1016
2005 computer graphics by Ulrik de Lichtenberg, Lars Juhl

Most things that happen in the cell are the work of 'molecular machines' -- complexes of proteins that carry out important cellular functions. Until now, scientists didn't have a clear idea of when proteins form these machines -- are these complexes pre-fabricated or put together on the spot for each specific job? Researchers at the European Molecular Biology Laboratory (EMBL), working closely with scientists from the Technical University of Denmark (DTU), have now answered that question by drawing together many types of data in a fascinating new model.

"Past studies of this type have usually left out a crucial element -- time," says EMBL Group Leader Peer Bork. "But now a picture has emerged which is extremely dynamic." This graph represents a temporal protein interaction network of the yeast mitotic cell cycle. Cell cycle proteins that are part of complexes or other physical interactions are shown within the circle. For the dynamic proteins, the time of peak expression is shown by the node color; static proteins are represented by white nodes. Outside the circle, the dynamic proteins without interactions are both positioned and colored according to their peak time, and thus also serve as a legend for the color scheme in the network.


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/)


993
2004 computer graphics by Patrick Yau

As an undergraduate at UC Davis, Patrick Yau had the opportunity to work at the Visualization and Graphics Research Group in the Institute for Data Analysis and Visualization (IDAV). He was under the guidance of Professor Bernd Hamann and Dr. Lars Linsen when he and his colleagues developed the project "Brain Mapping via Hierarchical Isosurface Segmentation Based on Discrete Curvature".

The idea of the project is to look into the surface of two brains and identify the similarities between then. They focused in particular on the curvature of the brains (folds and bumps). Yau worked on data preprocessing and the automated brain mapping algorithm. He wrote a procedure that automatically identifies the front, side and the top for two brains using Principal Component Analysis (PCA), and he also wrote a procedure that constructs a topology graph based on the curvature of a brain. The two images shown here reveal different representations of the same brain: as points and as a topology graph.


478
computer graphics by researchers at CAIDA

A graph visualisation showing the topology of the core of the Internet from mid-January 2000.




A version of this image is available to buy as a large wall poster.




It reveals the peering relations and geographic locations of Autonomous Systems (ASes), which are a vital part of Internet infrastructure that represent large ISP networks for the complex routing of traffic flows. It was created by researchers at CAIDA as part of their skitter project.


64
1817 print by Alexander von Humboldt (1769-1859), Germany

First graph of isotherms, showing mean temperature around the world by latitude and longitude. Recognizing that temperature depends more on latitude and altitude, a subscripted graph shows the direct relation of temperature on these two variables.

von Humboldt, A. (1817). Sur les lignes isothermes. Annales de Chimie et de Physique, 5:102-112.


66
1817 print by Alexander von Humboldt (1769-1859)

von Humboldt isotherms from Berghaus' 1849 AtlasrnrnFirst graph of isotherms, showing mean temperature around the world by latitude and longitude. Recognizing that temperature depends more on latitude and altitude, a subscripted graph shows the direct relation of temperature on these two variables - Germany


928
2005 computer graphics by Wayne McIntosh, Ken Cousins, Ste

This project focuses on the articulation, development, and dissemination of legal precedent across the multi-tiered system of American courts. With support from the National Science Foundation, the investigators are engaged in a mission to study and map the flow of precedent across the American court system during the full course of the 20th century on the issue of regulatory takings.

They are still in the process of identifying and acquiring the corpus of cases relevant to the issue of regulatory takings, but have already demonstrated "proof of concept" for the citation mining and network graphing aspect of the project.

The first graph represents a detail of the citations between all decisions in the current pool. Decisions (circles) are ordered on the x-axis, such that recent decisions appear furthest to the right side of the graph. Position along the y-axis is arbitrary. Information appearing to the right of the graph is generated by selecting decisions within the network. The second graph portraits the dynamics of citations to Parallel Courts.

Decisions (circles) are coded by the court that issued them: Red - US Supreme, Yellow - US Circuit, Blue - US District.

Citations (lines) are coded by the position of the court whose decision is cited, relative to the citing court: Blue - Higher, Black - Parallel, Red - Lower.


638
computer graphics (Graphviz) by Graphviz - Graph Visualization Software

This small example illustrates dot's feature to draw nodes and edges in clusters or separate rectangular layout regions. Clusters are encoded as subgraphs whose names have the prefix 'cluster'. The color attribute of a cluster is interpreted as its outline color or its background color if its style is 'filled'. Mdiamond and Msquare are modified symbols for data flow diagrams.


482
computer graphics by Charles Isbell and Michael Kearns

This is a graph representation of the social relationships inside a textual virtual space. The data is conversations between players in the MUD LambaMOO as observed and measured by the software bot called Cobot.




Each node in the graph is a single player and the colour coding shows their style of communications in terms of speech and actions. The links show which other player they are most connected to in terms of observed interactions.




Cobot was developed by Charles Isbell and Michael Kearns.


759
computer graphics by Prof. David Lavigne

The importance of fully understanding the dynamics of scale-free networks as been recognized by the cod fishery industry in the worst way. The collapse of the Northwest Atlantic cod fishery has become a metaphor for ecological catastrophe and is universally cited as an example of failed management of a natural resource" (MacKenzie 1995). Peter Meisenheimer in his paper "Seals, Cod, Ecology and Mythology" says, the use of seals as scapegoats for the failings of Canadian fisheries management is an example of a global problem in the management of fisheries and wildlife. Whether the system is aquatic or terrestrial, tropical or arctic, the predators of the world are seen as problems to be controlled, not as integral parts of a functioning ecosystem.

Prof. David Lavigne, a zoologist researcher sponsored by the Natural Sciences and Engineering Research Council and the International Marine Management Association is a leading force in combating this miscomprehension of food webs. Regarding the cod stock decrease, he also claims that seals are being used as scapegoats because government scientists are failing to look at the problem in a macro level, the way any network should to be analyzed. The graph on the left is Lavigne's effort to understand the complex dynamics of a food web. This astonishing work shows the Cod food web displaying some trophic interactions for part of the Northwest Atlantic.




1078
print by Kimberly Cloutier (White Rhino Productions) and Larry Gormley

The successful assault of Mount Everest in 1953 was the result of the heroic effort and sacrifice of every member of the twelve major expeditions from 1921 to 1953. In the words of Sir John Hunt, leader of the 1953 climb, the conquest of Everest is "a tale of sustained and tenacious endeavor by many, over a long period of time." Each expedition added critical knowledge to the planning, routes, skills, and equipment necessary for success.





This print maps the story of the conquest of Everest from 1921 to 1953. It has two related components each with its own intriguing design and rich set of content. On the left, the year, sponsor, duration, dates, height reached, and members of each of the major expeditions are provided. The history of climbers who went on more than one expedition are tracked as well. On the right is a detailed graph of the numerous ascents and descents of the 1953 team as they blazed trails and ferried supplies ever higher up the mountain. In addition, the weather conditions predominate for each day are provided.





This print is printed on high-quality, fine art, acid-free archival paper (100 lb Monadnock). It was printed on a Heidelberg offset press. In addition to the four-color printing process, each print is sealed with aqueous-satin coating to provide further longevity.





Note: A portion of the sales of this print will be donated to the Royal Geographic Society to help them continue their important mission of research, education and training, together with the wider public understanding and enjoyment of Geography.





Credits




Concept, research, and data: Larry Gormley




Design: Kimberly Cloutier (White Rhino Productions) and Larry Gormley


135
1999 computer graphics by Leland Wilkinson (1944-), USA

Grammar of Graphics: A comprehensive systematization of grammatical rules for data and graphs and graph algebras within an object-oriented, computational framework.

Wilkinson, L. (1999). The Grammar of Graphics. New York: Springer. ISBN 0-387-98774-6.


639
19930319 computer graphics (Graphviz) by Stephen North

A (non-authoritative) diagram of heritage of the Unix operating system. This "crazy" version of the classic graph was created to stress test the polygon shape generator and color map manager with random values.


878
2005 computer graphics by (unknown)

ATA (Advanced Technology Assessment) is a business intelligence company developing a unique combination of knowledge-bases, software, technological solutions and expertise to support decision-makers in identifying actionable patterns in complex dynamic business environments.

One of ATA's network visualization techniques is called Dynamic Network Rendering. The method supports effective representations of both static structural information and changes over time, which significantly boost understanding of complex relational datasets, and allow analysts to effectively gather competitive technological and organizational intelligence. Representation of time evolution can be addressed from complementary perspectives that can be integrated into unified graph visualization solutions: Static Approach - networks are generated corresponding to "slices" of the original dataset at different points in time; Dynamic Approach - changes to network structure and node relative positions over time are conveyed by motion of graphical elements on the screen.

This graph incorporates ATA's network-based technology and represents a time-sliced view of hypothetical network trajectories of individuals involved in the terrorist attack in Spain, March 2004. (Data from J. A. Rodriguez)


640
computer graphics (Graphviz) by Graphviz - Graph Visualization Software

The graph file was generated automatically from a session with the LDBX graphical interface to the standard DBX debugger. Nodes are drawn with the 'record' shape. Labels of this shape are interpreted specially as nested horizontal and vertical box lists formatted as tables. In a record label, curly braces { } enclose lists, vertical bar | separates list items, and creates a port identifier for attaching edges. Edges are also labeled with 'id' attributes. Though not demonstrated in this particular file, these attributes allow referencing multiple (parallel) edges between the same node pair.


300
2007 computer graphics by Jess Bachman, Burlington, Vermont, USA

“Death and Taxes” is a representational poster of the federal discretionary budget; the amount of money that is spent at the discretion of your elected representatives in Congress. Basically, your federal income taxes. The data is from the President's budget request for 2008. It will be debated, amended, and approved by Congress by October 1st to begin the fiscal year.


294
2006 computer graphics by Jess Bachman, Burlington, Vermont, USA

'Death and Taxes' is a representational graph of the federal discretionary budget. The amount of money that is spent at the discretion of your elected representatives in Congress. Basically, your federal income taxes.


952
2004 computer graphics by Jesse Bachman

Most Americans are unaware of how much of their taxes fund the military, and those aware are often misinformed. Jesse Bachman spent close to a year in extensive research and number crunching to get the facts and produce this holistic graph with extensive detail. The effort paid off in the form of an informative map that's easy to read and compare. The author hopes that it will make people think and ask questions. Why do we spend more on jets than we do on public housing? Why is the Endowment for the Arts so small? What's with all this foreign military financing?

All budget figures are from the Office of Management and Budget (Whitehouse.gov/omb/) with supplementary military data from the department of Defense (DoD.mil) and the Center for Defense Information (CDI.org). The DoD is under congressional control and thus, as a governmental department, was placed on the right side of the graph. However, for the purpose of this chart, the DoD is on the left as the total is divided into military and non-military spending.

All circles are sized based on their values and relative to the total budget. Recipients of less than 200 Bilion dollars are generally not depicted except in cases when their importance or relevance merits depiction. The DoD was broken down by branch and then major procurements and programs were depicted. Inlay pie charts were added to reduce redundancy.


570
2005 computer graphics by Olivier Zitvogel

Delicous Soup shows related del.icio.us tags in a circular graph manner:

Delicious Soup - A tool that reveals your del.icio.us activities...

[Zitvogel, 2005]

via information aesthetics blog

[edit] 3 References

[Ivy, 2005] Ivy, Revealicious, Created at: 2005, Retrieved at: September 15, 2005. http://www.ivy.fr/revealicious/ [Zitvogel, 2005] Olivier Zitvogel, Delicous Soup, Created at: 2005, Retrieved at: September 15, 2005. http://www.zitvogel.com/delicioussoup/

Retrieved from "http://www.infovis-wiki.net/index.php?title=2005-09-15:_%22Revealicious%22_and_%22Delicious_Soup%22_-_two_Flash_based_del.icio.us_visualization_tools"


50
1801 print by William Playfair (1759-1823), England

Invention of the pie chart, and circle graph, used to show part-whole relations.

Playfair, W. (1801). Statistical Breviary; Shewing, on a Principle Entirely New, the Resources of Every State and Kingdom in Europe . London: Wallis. Re-published in Wainer, H. and Spence, I. (eds.), The Commercial and Political Atlas and Statistical Breviary, 2005, Cambridge University Press, ISBN 0-521-85554-3.




168
1997 print by John Fox (1947-)

This graph shows a scatterplot of data from a survey of Chilean voters held six months before the plebicite held in September 1988 on the future of the military government of Augusto Pinochet. The ordinate, "Voting Intention" is a binary variable, 0 = No = Return to Civilian government, 1 = Yes = Continue Military rule. The abscissa reflects a scale of Support for the Status Quo.

The graph shows the binary observations at the top and bottom of the display, jittered vertically to avoid overplotting. The solid line is a linear regression; the solid curve is a logistic regression. A non-parametric (lowess) curve is shown by the broken line. Although there is no data in the middle of the graph, the visual elements combine to show how the propensity to vote Yes increases steadily with Support for the status quo.

Discrete, categorical data presents difficult challenges for graphical display. It is hard to show the data, because many points coincide.

Figure from John Fox's Applied Regression Analysis, Linear Models, and Related Methods, Figure 15.1.


1265
2006 Java by Christopher Collins

DocuBurst is the first visualization of document content which takes advantage of the human-created structure in lexical databases. We use an accepted design paradigm to generate visualizations which improve the usability and utility of WordNet as the backbone for document content visualization. A radial, space-filling layout of hyponymy (IS-A relation) is presented with interactive techniques of zoom, filter, and details-on-demand for the task of document visualization. The techniques can be generalized to multiple documents.

This image shows the DocuBurst interface. A note in the main graph is selected, and all occurrences of words corresponding to that node are highlighted in orange in the document browser on the right. The bottom panel highlights occurrences of the selected words in the original text.


1264
2006 Java by Christopher Collins

DocuBurst is the first visualization of document content which takes advantage of the human-created structure in lexical databases. We use an accepted design paradigm to generate visualizations which improve the usability and utility of WordNet as the backbone for document content visualization. A radial, space-filling layout of hyponymy (IS-A relation) is presented with interactive techniques of zoom, filter, and details-on-demand for the task of document visualization. The techniques can be generalized to multiple documents.

This image shows the occurrences of "idea" words in a general science textbook. The opacity of the node fill colour corresponds to the strength of occurrence of related terms in the target text. The graph structure is the WordNet hyponymy graph, rooted at "idea", and the gold coloured nodes match a search query for words starting with "pl".


1266
2006 Java by Christopher Collins

DocuBurst is the first visualization of document content which takes advantage of the human-created structure in lexical databases. We use an accepted design paradigm to generate visualizations which improve the usability and utility of WordNet as the backbone for document content visualization. A radial, space-filling layout of hyponymy (IS-A relation) is presented with interactive techniques of zoom, filter, and details-on-demand for the task of document visualization. The techniques can be generalized to multiple documents.

This image shows a DocuBurst graph rooted at "atmospheric phenomenon". Node opacity is directly related to the occurrences of related terms in the target text. The graph structure is the WordNet hyponymy tree. Gold coloured nodes are search results for words that start with "w". Blue nodes trace the path from the node under the mouse ("light") to the graph's root.


1268
2006 Java by Christopher Collins

DocuBurst is the first visualization of document content which takes advantage of the human-created structure in lexical databases. We use an accepted design paradigm to generate visualizations which improve the usability and utility of WordNet as the backbone for document content visualization. A radial, space-filling layout of hyponymy (IS-A relation) is presented with interactive techniques of zoom, filter, and details-on-demand for the task of document visualization. The techniques can be generalized to multiple documents.

In this DocuBurst graph, occurrences of words in the document of interest (a science textbook) is indicated by increased opacity of the corresponding graph node. The graph structure is the WordNet hyponymy tree. Here, we can see that "kind" and "quantity" occur more often than "feature" and "idea", while "concept" does not occur at all.


923
2005 computer graphics by Pak Chung Wong, Patrick Mackey,

These images are part of a paper presented at InfoVis'05, which describes a novel technique to visualize graphs with extended node and link labels. The lengths of these labels range from a short phrase to a full sentence to an entire paragraph and beyond. The proposed solution is different from existing approaches that rely on intensive computational effort to optimize the label placement problem. Instead, the authors share the visualization resources with the graph and present the label information in static, interactive, and dynamic modes without the requirement for tackling the intractability issues. This allows the reallocation of the computational resources for dynamic presentation of real-time information. The paper also includes a user study to evaluate the effectiveness and efficiency of this visualization technique.


1006
2002 computer graphics by Raffi Krikorian

This project aims to be a free, flexible, and easily modifiable visualisation tool that allows a user to intuitively understand their online social group structure. This software was inspired by social network fragments and buddy graph -- this code has all the functionality from its counterparts (except zoom) that could be implemented in a generic fashion. As the author explains: "Colouring is not in this software as it is currently impossible to colour the graph without asking the user to classify his or her entire mail network manually; it is too hard to do automatic classification and colouring of e-mail addresses".

In this example, the user's mailbox scanned has been relaxed into about 10 different social groups. by looking at To:, From:, and Cc: headers, this tool constructs a graph of who knows who. each "star" represents a person, and each "constellation line" draws out the relationship.


983
2005 computer graphics by Bill Marsh

In 2003, the US Federal Energy Regulatory Commission posted about 1.5 million messages from Enron's e-mail servers on its Web site. After duplicates were weeded out, a half-million e-mails were left from about 150 accounts, including those of the company's top executives. Most were sent from 1999 to 2001, a period when Enron executives were manipulating financial data, making false public statements, engaging in insider trading, and the company was coming under scrutiny by regulators.

This graph produced by The New York Times reveals a map of a week's e-mail patterns in May 2001, when a new name suddenly appeared. Scientists found that this week's pattern differed greatly from others, suggesting different conversations were taking place that might interest investigators.

Source: The New York Times. Dr. Carey E. Priebe and Youngser Park, Johns Hopkins University.


648
computer graphics (Graphviz) by Neato (and Graphviz?)

Layouts made with neato have the property that all edges tend to have about the same length (unless there is a manual adjustment). By default neato uses randomization, so it makes a different layout each time, but this particular example almost always look well. Edge labels are placed at the edge's midpoint.


792
computer graphics by Linyuan Lu

This a random subgraph of the Erdos' 2nd neighborhood Collaboration graph. The size of this subgraph is about 2500. It illustrates the shape of the power law graph --- an 'octupus' with a dense core and long legs. The structure has been proved in a PNAS paper in 2002.


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).


751
2005 computer graphics by Jeffrey Heer

This project attempts to take the first steps toward an exploratory data environment for e-mail corpora, using the Enron e-mail corpus as a motivating data set. The interface--currently named "enronic"--unifies information visualization techniques with various algorithms for processing the e-mail corpus, including social network inference, message categorization, and community analysis. Though still a preliminary design, enronic shows promise as a platform for more tightly coupling manual and automated data analysis.

The graph on the left shows the resulting social network visualization. People are drawn as nodes with labels containing either their name or their e-mail address, depending on what was present in the database. Edges represent the histories of ALL e-mail traffic between two people. Pie graphs are placed in the center of each edge, conveying an overall picture of how the e-mail traffic represented by that edge has been categorized.


823
computer graphics by Tamara Munzner

Drawing graphs as nodes connected by links is visually compelling but computationally difficult. Hyperbolic space and spanning trees can reduce visual clutter, speed up layout, and provide fluid interaction.

This project consists of a software system that explicitly attempts to handle much larger graphs than previous systems and support dynamic exploration rather than final presentation.

A software system that supports graph exploration should include both a layout and an interactive drawing component. Tamara Munzner developed new algorithms for both layout and drawing - H3 and H3Viewer . As she describes: "I have implemented a software library that uses these algorithms. It can handle graphs of more than 100,000 edges by using a spanning tree as the backbone for the layout and drawing algorithms. We draw the graph structure in 3D hyperbolic space to show a large neighborhood around a node of interest. This also allows for quick, fluid changes of the focus point". The H3Viewer drawing algorithm uses both graph-theoretic and view-dependent information to achieve a high guaranteed frame rate.




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.


641
computer graphics (Graphviz) by Graphviz - Graph Visualization Software

This is a drawing of a finite automaton. The rankdir and orientation request a left-to-right drawing in landscape mode. Note the use of text labels on edges.


803
2005 computer graphics by Marcos Weskamp

Flickr Graph is an application that explores the social relationships inside flickr.com. It makes use of the classic attraction-repulsion algorithm for graphs. The user starts exploring its contacts by entering their flickr username or email address, after which the network starts emerging around its own icon. One can also explore uploaded photos by any user present in the graph.


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.


690
200505 computer graphics by Simon Leinen

Fluxoscope is a system used by SWITCH for measurements of our external network traffic. One of its products are graphs which represent, for each external connection, the protocol distribution of traffic over time. The example graph shows the traffic distribution on one of our "upstream" or transit ISPs over a period of a few hours. The "positive" part of the graph shows incoming traffic (what we receive from the ISP), the "negative" part corresponds to outgoing traffic (what we send them).


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


1055
2006 computer graphics by Mike Love

As the author himself recognizes, this is a highly ambitious project that aims at creating a genealogical tree of the influence of writers and artists through history.

The graph was made using a Graphviz port by Pixelglow. As for references, Mike Love used many Wikipedia articles, Stanford's Internet Encyclopedia of Philosophy, Axel's Castle, Philosophy in the Tragic Age of the Greeks, The Modern Mind, Contingency Irony and Solidarity, the Passion of the Western Mind, and The Worldly Philosophers, clearly focusing more on the Western World. Although static, each node in the graph is clickable and leads to a Wikipedia article.


767
2005 computer graphics by Pedro Ortiz, Santiago Ortiz, Lui

The goal of the GNOM project is to develop a series of digital interfaces for the exploration of genetic networks. The first stage of the project explores the genetic interaction network in the bacteria Escherichia Coli.

The graph shown represents the first tryout of the Oracle interface: A circular interface of high control level over the node selection, where the entire network of relations can be visualised.


976
computer graphics by Gregory Bray

Looking for a new way to surf the Gnutella network - a P2P community sharing network (http://www.gnutella.com) - Gregory Bray decided to use a web spider, as a means of collecting information from each node, in order to create a map of the network and gather statistics without changing the Gnutella protocol. After the web spider downloads all the information it can find, a simple parser creates the statistics and outputs the data file in a graph using aiSee Graph Layout Software (http://www.aisee.com).

As the author explains: "So far the largest data set I have collected was about 80,000 nodes in half an hour (...) way more than the 10 or 20 thousand that the common user can see".


1027
2004 computer graphics by Richard Jones

Google Cartography uses the Google Search API to build a visual representation of the interconnectivity of streets in an area. It is indeed a very innovative and appealing concept, particularly since its interactive functionality allows a deeper understanding of the vast mesh of intersections that form a city's street network.

This application takes a starting street and finds streets that intersect with it. Traversing the streets in a breadth-first manner, further intersections are discovered. Eventually a connected graph is produced showing the interconnectivity of streets flowing from the starting street.

The largest connected subgraph is visualized using a Radial Layout algorithm provided by the Prefuse graph visualization framework. The graph is initially centered on the start street but will automatically adjust its focus to center around the most recently selected street.

On the provided URL you can try navigating through the streets of New York or Melbourne, or in case you have a Google key, you can explore your own area.


24
1686 print by Edmond Halley (1656-1742), England

Bivariate plot of a theoretical curve derived from observations (barometric pressure vs. altitude), graphical analysis based on empirical data.

Halley, E. (1686). On the height of the mercury in the barometer at different elevations above the surface of the earth, and on the rising and falling of the mercury on the change of weather. Philosophical Transactions , 16 :104-115.


32
1763 print by Thomas Bayes (1702-1761), England

Graph of the beta density.


870
2004 computer graphics by Ero Carrera, Gergely Erdelyi

Windows binary malware has come a long way. Today's average worm is often tens or hundreds of kilobytes of code exhibiting a level of complexity that surpasses even some operating systems. This degree of complexity, coupled with the overwhelming flow of new malware, calls for improvements to tools and techniques used in analysis.

The authors focused greatly on graph theory to aid the analysis of these viruses. They use a series of tools for reverse engineering malware such as: IDA - the Interactive DisAssembler, IDAPython - Python extension for IDA, and pydot - Python interface to Graphviz utilities. IDAPython and pydot were developed by the authors and released as open source. The resulting graphs are done by exploring the code of a malware sample looking for all the functions and the relationships between them (who calls who). This information, together with text references, are then exported using pydot into a format that Graphviz utilities can read.

These two images illustrate a comparative analysis between two viruses, respectively, Netsky.AD (first image) and Buchon (second image).


869
2004 computer graphics by Ero Carrera, Gergely Erdelyi

Windows binary malware has come a long way. Today's average worm is often tens or hundreds of kilobytes of code exhibiting a level of complexity that surpasses even some operating systems. This degree of complexity, coupled with the overwhelming flow of new malware, calls for improvements to tools and techniques used in analysis.

The authors focused greatly on graph theory to aid the analysis of these viruses. They use a series of tools for reverse engineering malware such as: IDA - the Interactive DisAssembler, IDAPython - Python extension for IDA, and pydot - Python interface to Graphviz utilities. IDAPython and pydot were developed by the authors and released as open source. The resulting graphs are done by exploring the code of a malware sample looking for all the functions and the relationships between them (who calls who). This information, together with text references, are then exported using pydot into a format that Graphviz utilities can read.

These images show a graph representing the structure of the Sobig.F Virus.


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:
- If one clicks a node (ellipse box), GraphNews creates a new graph with subject and relations tied to that specific node.
- If one clicks an arc (square box), GraphNews returns all the news that speak about the two subjects joined from the arc.

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".


954
2005 computer graphics by Eytan Adar

GUESS is an exploratory data analysis and visualization tool for graphs and networks. The system contains a domain-specific embedded language called Gython (an extension of Python, or more specifically Jython) which supports the operators and syntactic sugar necessary for working on graph structures in an intuitive manner. An interactive interpreter binds the text that one types in the interpreter to the objects being visualized for more useful integration. GUESS also offers a visualization front end that supports the export of static images and dynamic movies.

Because GUESS is Jython/Java based one can also construct their own applications and applets without much coding. GUESS is distributed as GPL and makes use of a number of other open source packages and contributions.


563
20040609 computer graphics by Michal Migurski

2005-07-21: "In The News" - Interactive Visualization of Google News

From InfoVis:Wiki

Apart from the well known Newsmap visualization that utilizes Treemaps to present the current distribution of Google News topics, another very interesting visualization exists: In The News is the title of Michal Migurski's interactive Flash application that was posted already a year ago:

http://news.stamen.com/

In contrast to Newsmap that only shows current news, In The News adds temporal aspects via presenting the history of news topics over time. Thus, it allows for interactive exploration of the development of news topics over time.

In The News (Google News visualization)

[Migurski, 2004] Michal Migurski, In The News. Created at: June 9, 2004. Retrieved at: July 21, 2005. http://news.stamen.com/

* One week worth of news is represented in rows on the display.

* A single news topic is represented as color chip whereas the size of a chip denotes its relative importance on that day.

* Color is used to show whether an item has gained or lost importance relative to the previous day.

* When selecting a news topic, the corresponding color chips are highlighted and a small bar graph showing the topic's performance over the last month is shown below the main visualization.

* If a new topic is selected, another small bar graph is added while keeping the history of the last five selected topics visible and allowing for their comparison.

* Furthermore, news topics can be searched and lists of Top Names, Top Gainers, and Top Losers are provided.

The different views are very well coordinated and smooth transitions are provided, which adds to the coherent picture of the whole application making it an excellent example for a highly interactive exploration tool for time-oriented abstract data. And even nicer, the source code is available and released under a Creative Commons License.

via sendung.de blog

[Migurski, 2004] Michal Migurski, In The News. Created at: June 9, 2004. Retrieved at: July 21, 2005. http://news.stamen.com/


817
computer graphics by AT&T Labs - Research

cobot is a software agent who lives in the MUD - LambdaMOO, an active online community frequented by several hundred users. His goal in life is to interact with other members of the community and to become a real part of his social fabric. Toward this end, Cobot builds models of those around him, based on statistics of who performs what actions, and on whom they use them.

This graph is a representation of the social relationships inside cobot's head. Each node in this graph is a person. The color represents communicative style, translated into HSV space. One dimension measures the amount of interaction generated by that player while another measures the ratio of speech actions (eg "say") to non-speech actions (eg "hug" or "kick"). The third dimension is held constant to provide uniform brightness.

Red-purple colors tend to be players who are average interactors, and who interact mainly through speaking; yellow, a normal interactors, but through non-speech acts; blue, heavy interactors through speaking; and green heavy non-speaking interactors.




688
200603 computer graphics (RRDtool) by Ben Golden

Graph shows inbound and outbound call traffic going in and out of the switch via the 6 trunks connected to the Diamond exchange. Inbound traffic shown as positive and uses a lowest-free fill method. Outbound traffic shown as negative uses a distributed fill method. Tech details on RRDtrac.


650
computer graphics (Graphviz) by Graphviz - Graph Visualization Software

This is the graph of an intranet. The edge length adjustment in the last line is an attempt to improve the placement of two nodes that otherwise wind up too close. Notice the way of using subgraphs to create a fully-connected subgraph between the nodes IHP, IW, IH1, IH2, and IH4.


918
2002 computer graphics by Simon Greenwold

The Internet constitutes an enormous electronic architecture that defines spaces without regard to physical structure. We navigate these spaces with browsers, moving from place to place with a click on a link. Internaut proposes that a physical architecture may be derived from the shape of the network and navigated with a first-person 3D game engine.

The applet represented here demonstrates the process of turning a network structure into a physical map. The nodes are pages connected by links. The links act as springs, drawing the graph into its lowest energy state, a configuration best suited to physical navigation. The cells themselves are generated as a Voronoi diagram, bounded by a convex hull around the set of sites.


291
2000 computer graphics by Valdis Krebs

Valdis Krebs is an expert in organisation network analysis. He has analysed the structure of the Internet industry, looking at the ownership and alliances between different companies providing the infrastructure, content and commerce. Three key metrics were used to understand the structure - control, access and status.

The results are presented in an interactive graph in the Internet Industry map. The four companies with the most control over the Internet industry were AOL, Microsoft, AT&T and Yahoo!, shown by the large red circles.


829
1998 computer graphics by Hal Burch and Bill Cheswick

The Internet Mapping Project was started at Bell Labs in the summer of 1998. Its long-term goal is to acquire and save Internet topological data over a long period of time. This data has been used in the study of routing problems and changes, DDoS attacks, and graph theory.

"This mapping consists of frequent traceroute-style path probes, one to each registered Internet entity. From this, we build a tree showing the paths to most of the nets on the Internet. We have no interest in the specific endpoints or network services on those endpoints, just the topology of the 'center' of the Internet."

These paths change over time, as routes reconfigure and the Internet grows. "We are preserving this data, and plan to run the scans for a long time. The database should help show how the Internet grows. We think we can even make a movie of this growth someday."


916
computer graphics by (unknown)

This remarkable graph shows a travel-time map from an issue of the Japanese magazine Shukan Asahi. The shortest travel times (not counting waiting time) from Tokyo to various points around Japan using airplanes and trains were plotted in this deformed map. Data was taken from the 1969 issue of the Japan National Railways timetables. Coordinates for the various areas were determined by time coordinates using concentric circles centering on Tokyo and by topographical directions centering on Tokyo. To obtain an accurate concept of the space in this deformed map, one ought to conceive a topographical map like a prune that is all shriveled up.

Source: Herdeg, Walter. Graphis Diagrams. 4th Expanded ed. Zurich, Switzerland: Graphics Press Corp., 1981.




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.


973
2004 computer graphics by Rusty Russel

The original Linux Kernel Graphing Project was a bold undertaking by Rusty Russel which resulted in a complex graph of all the .c files in the 2.4.0 Linux Kernel: each function graphically represented and named, resulting in 180MB of PostScript.

Another version of the graph, developed by Creinig for V2.5.2, took the Linux Kernel source distribution, crunched over it for about 35 minutes on a 400MHz machine / 11 minutes on a 1.2GHz Athlon, requiring up to 90MB RAM at peak times and about 240MB disk space (without kernel sources) and finally produced a ~22MB postscript file of the poster.

The latest attempt by Creinig, with 2.6 Kernel, took about 20 minutes to generate in a 2.2GHz P4.


172
1997 computer graphics by Mintz, D., Fitz-Simons, T., and Wayland, M.

The tile map is a useful semi-graphical display for data with seasonal variation. One square (tile) is plotted for each day of the year; the color of the tile shows the level of Ozone concentration in Los Angeles for that day, with lighter shades indicating lower concentration and darker shades showing higher concentrations. (Ed. note: This is true of the B/W version in the printed paper, but not true of the color version shown here, which uses 'elevation mapping' of colors to ozone concentration. The rendition in color is not exemplary.)

The figure shows the data for the 10 years, 1982 - 1991. Within each year, ozone concentrations are higher in the summer months; Over years, the concentrations in the summer months have decreased.

Figure from Mintz, D., Fitz-Simons, T. & Wayland, M. "Tracking Air Quality Trends with SAS/GRAPH", SUGI 22 Proceedings, 807-812.


483
2001 computer graphics

This large graph shows the router level connectivity of the Internet as measured by Hal Burch and Bill Cheswick's Internet Mapping Project.




The work is being commercially developed by Lumeta.




Lumeta are developing network measurement and mapping tools for analysing large corporate intranets. This graph part of this graph show the portion of a corporate intranet that are 'leaking' with the Internet.




For more information see the article "What Can You Do With traceroute?" by Steve Branigan, Hal Burch, Bill Cheswick, and Frank Wojcik, Internet Computing, Sept./Oct. 2001.


488
2001 computer graphics

This large graph shows the router level connectivity of the Internet as measured by Hal Burch and Bill Cheswick's Internet Mapping Project.




The work is being commercially developed by Lumeta.




Lumeta are developing network measurement and mapping tools for analysing large corporate intranets. This graph part of this graph show the portion of a corporate intranet that are 'leaking' with the Internet.




For more information see the article "What Can You Do With traceroute?" by Steve Branigan, Hal Burch, Bill Cheswick, and Frank Wojcik, Internet Computing, Sept./Oct. 2001.


1028
2006 computer graphics by Kevin W. Boyack, Richard Klavans

Dr. Kevin Boyack is in the Computation, Computers, and Mathematics Center at Sandia National Laboratories. Richard Klavans is with SciTech Strategies, Inc. They are interested in the mapping of science as a platform for planning and evaluation on national, corporate, and personal levels. Science can be thought of as containing themes and paradigms; themes are current areas of research while paradigms comprise the dominant tool sets and existing knowledge that are used by current researchers.

To generate this map, Boyack and Klavans recursively clustered (using the VxOrd graph layout tool) the 820,000 most important papers referenced in 2003, resulting in 776 paradigms. The most dominant relationships between paradigms were also calculated and are shown as lines between paradigms. The map of scientific paradigms comprises a reference system that can be used for multiple purposes. Countries, industries, companies, and individual researchers can all locate themselves within the map, either as single points, or as a specific collection of paradigms. Science education and discovery can also be enhanced by linking stories and facts to the map that highlight content and relationships between scientific paradigms.

This map will be on display at the NYPL Science, Industry, and Business Library, New York, as part of the "Places & Spaces: Mapping Science" exhibition, from April 3rd - August 31st, 2006.


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.


724
2003 computer graphics by Jean-Pierre Eckmann

This project was originally produced by Jean-Pierre Eckmann for the IAMP Conference 2003 in Lisbon. The concept was later pursued by Sid Redner, from Boston University, who showed that the network of scientific papers, connected by citations, has a power law degree distribution. In a test of this concept papers from the Mathematical Physics Archive were examined for reciprocal citation of the authors, yielding the preceding graph, where colors indicate areas of obvious curvature that were then checked for content. The strongest curvature is the area in red, statistical mechanics, which is reasonable given the nature of the database. This result emerged from the analysis that did not use scientific field as a parameter in generating the clusters.


633
computer graphics (interactive) by Modern Language Association

Number and percentage of speakers per language in the entire US.

The MLA Language Map is intended for use by students, teachers, and anyone interested in learning about the linguistic and cultural composition of the United States. The MLA Language Map uses data from the 2000 United States census to display the locations and numbers of speakers of thirty languages and three groups of less commonly spoken languages in the United States. The census data are based on responses to the question, "Does this person speak a language other than English at home?" The Language Map illustrates the concentration of language speakers in zip codes and counties. The Data Center provides census data about over three hundred languages spoken in the United States, including actual numbers and percentages of speakers.

Map instructions:

View an interactive map showing the numbers of speakers of thirty-three languages and language groups. Click the map to zoom in on a region. Add or remove county and city names, rivers and lakes, and highways. A bar graph beneath the map provides the actual numbers of speakers by state; for numbers of speakers by zip code, town, city, or county, use the Data Center.


686
200603 computer graphics (RRDtool) by Alex Rivoltella

Simply parse of SNMPget from Vendor OID. The graph display the actual volume of transactions for MMS submitions, from 3 differents devices, such as, Phone, VAS and MM4 (others operator).




652
computer graphics by Graphviz - Graph Visualization Software

The graph represents dependencies between modifications to a large program. Because testing such programs is difficult and expensive, the graph was made to discover which subsets of modifications might be tested separately by understanding or even eliminating a few key dependencies.


899
2003 computer graphics by T.J. Jankun-Kelly, Kwan-Liu Ma

Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed for situations where visual information such as images is also present at each node and must be displayed. MoireGraphs intents to address this need. MoireGraphs combine a focus+context radial graph layout with a suite of interaction techniques (focus strength changing, radial rotation, level highlighting, secondary foci, animated transitions and node information) to assist in the exploration of graphs with visual nodes. The method is scalable to hundreds of displayed visual nodes.

Source: IEEE Computer Science Press 2003


105
1913 print by Henry Gwyn Jeffreys Moseley (1887-1915), England

Discovery of the concept of atomic number, based largely on graphical analysis (a plot of serial numbers of the elements vs. square root of frequencies from X-ray spectra) The linear relations showed that the periodic table was explained by atomic number rather than, as had been supposed, atomic weight, and predicted the existence of several yet-undiscovered elements.

Moseley, H. (1913). The high frequency spectra of the elements. Philosophical Magazine, 26:1024-1034. (Part II, 27:1914, pp.703-).


958
2004 computer graphics by Fahri Ozkaramanli, Ozhan Binici

Musicmap is an application for exploring album relationships based on Amazon's similarity results. The application consumes Amazon e-commerce service's music information for searching music and finding similarities between albums and displaying the results through a force directed graph.

With Musicmap, one can visualize their map of music taste and discover new albums that are similar to already known ones.

Registration is not necessary for using Musicmap, however, registration is completely free and registered users can save and load their maps or add comments to albums.


173
1981 print by New York Times

Newspapers and magazines usually choose simplicity over detail, because it is hard to show much information in a single, comprehensible display. A collection of truly bad examples from the popular media are shown on our Darts pages. Here, the attention to detail, and to graphic design are evident.

This graph, from the New York Times (Jan. 11, 1981, p. 32; Tufte (1983), p. 30) shows--- both valiantly, and sucessfully--- 2200 numbers which summarize the trends and patterns in weather in New York City in 1980. The three aligned charts show temperature, precipitation, and relative humidity. In the graph of temperature, the area is filled between the daily low and daily high.

What makes this graph successful, in spite of the large amount of information presented are (a) clear visual comparisons between the 1980 data and the long-run average, (b) clear textual labels, (c) visual segregation between the three series. For example, it is easy to see that March and April were about of normal temperature, but a lot wetter.


1072
2006 computer graphics by Issac Trotts, Shawn Mikula

BrainMaps.org is an interactive zoomable high-resolution digital brain atlas and virtual microscope that is based on more than 10 million megapixels of scanned images of serial sections of both primate and non-primate brains and that is integrated with a high-speed database for querying and retrieving data about brain structure and function over the internet. Currently featured are complete brain atlas datasets for various species, including Macaca mulatta, C. aethiops, Felis catus, and Mus musculus.

On their website one can find a suite of desktop applications for interacting with and analyzing BrainMaps.org data. One of this applications (featured here) is Nodes3D, a 3D graph visualization program written by Issac Trotts in consultation with Shawn Mikula, in the labs of Edward G. Jones.


764
2005 computer graphics by Timothy M. O'Brien

Timothy O'Brien used Python and GraphViz to generate this astonishing visualization of his 1st and 2nd level of connections on the O'Reilly Connection social networking site. The red highlighted connections are from Tim O'Reilly to other people, and, predictably, he's at the center of the activity.

The graph was created by crawling FOAF (Friend Of A Friend) documents from Timothy's O'Reilly Connection profile and then obtaining the FOAF documents of people associated with him. The results were then stored in a neato format and visualized using graphviz neato.


20
1350 print by Nicole Oresme (Bishop of Lisieus) (1323-1382), France

Proto-bar graph (of a theoretical function), and development of the logical relation between tabulating values, and graphing them (pre-dating Descartes). Oresme proposed the use of a graph for plotting a variable magnitude whose value depends on another, and, implicitly, the idea of a coordinate system- Nicole Oresme (Bishop of Lisieus).

Oresme, N. (1482). Tractatus de latitudinibus formarum. Padova. BL: IA 3Q024.

Oresme, N. (1968). Nicole Oresme and the Medieval Geometry of Qualities and Motions: A Treatise on the Uniformity and Difformity Known as Tractatus de Configrationibus Qualitatum et Motuum . Madison WI: University of Wisconsin Press. Tr.: M. Clagget.


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.


102
1873 print by R. A. Fisher, c.1955, after Josiah Willard Gibbs (1839-1903), USA

Graphical methods applied to explain fundamental relations in thermodynamics; this includes diagrams of entropy vs. temperature (where work or heat is proportional to area), and the first use of trilinear coordinates (graphs of (x,y,z) where x+y+z=constant).

Bumstead, H. A. (ed.) (1961). The Scientific Papers of J. Willard Gibbs . New York: Dover Publications, Inc. (an unabridged republication of the work originally published by Longmans, Green and Company in 1906).

Gibbs, J. W. (1873). Graphical methods in the thermodynamics of fluids. Transactions of the Connecticut Academy of Arts and Sciences, 2:309-342. Reprinted in Bumstead (above).

Gibbs, J. W. (1873). A method of geometrical representation of the thermodynamic properties of substances by means of surfaces. Transactions of the Connecticut Academy of Arts and Sciences, 2:382-404. Reprinted in Bumstead (above).


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).


847
computer graphics by Linyuan Lu

Large sparse graphs refer to graphs that can be used to model very large scale distributed networks that arise in internet computing and biological applications. Analyzing these graphs and understanding their properties is an area of research that combines techniques from probabilistic combinatorics and classical graph theory.

This image portraits a random generated power law graph of size 5000. The vertices are uniformly distributed in the unit square.


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.


643
computer graphics (Graphviz) by Graphviz - Graph Visualization Software

This is the dynamic profile of a sort program, generated from the 'gprof' tool. Nodes represent functions and edges represent function calls. They are colored according to gprof's estimate of the time spent within a given function and the time charged to a given call site. The colors are encoded as hue-saturation-brightness triples. We have found it advantageous to vary both hue and saturation to draw attention to hot spots, rather than present a baffling rainbow of colors.


855
2002 computer graphics by Gary Bader, Christopher Hogue

The recent abundance of genome sequence data has brought an urgent need for systematic proteomics to decipher the encoded protein networks that dictate cellular function. To date, generation of large-scale protein?protein interaction maps has relied on the yeast two-hybrid system, which detects binary interactions through activation of reporter gene expression. With the advent of ultrasensitive mass spectrometric protein identification methods, it is feasible to identify directly protein complexes on a proteome-wide scale. In this paper, published in Nature magazine, the authors report, using the budding yeast Saccharomyces cerevisiae as a test case, an example of this approach, which they term high-throughput mass spectrometric protein complex identification (HMS-PCI). Beginning with 10% of predicted yeast proteins as baits, they detected 3,617 associated proteins covering 25% of the yeast proteome. Numerous protein complexes were identified, including many new interactions in various signaling pathways and in the DNA damage response.

The graph shown here, drawn with Pajek software, proves that the connectivity distribution of the HMS-PCI data set follows a power law, as observed for other large-scale biological networks.


832
2002 computer graphics by Alex Adai

LGL (Large Graph Layout) is a compendium of software applications for making the visualization of large networks and trees tractable. LGL was specifically motivated by the need to make the visualization and exploration of large biological networks more accessible.

The website contains a rich gallery with a collection of different graphs and trees generated by LGL from different sources of biological data.

This image represents a Protein Homology Graph - 32,727 Proteins with 1,206,654 Edges. Color coded is based on layout hierarchy.


834
2002 computer graphics by Alex Adai

LGL (Large Graph Layout) is a compendium of software applications for making the visualization of large networks and trees tractable. LGL was specifically motivated by the need to make the visualization and exploration of large biological networks more accessible.

The website contains a rich gallery with a collection of different graphs and trees generated by LGL from different sources of biological data.

This image portraits the Protein Homology Network in an impressive visualization. The network summarizes the results of aprox. 92 billion pairwise amino acid sequence alignments between 289,069 proteins from 90 genomes. The final network is composed of 27,325 connected sets summing to 7,940,873 edges. An edge is colored blue if it connectes 2 proteins from the same species, and red if it connects 2 proteins from 2 different species. If that information is not available the edges are colored based on layout hierarchy.


856
2005 computer graphics by (unknown)

This graph is a view of a protein-interaction-network in Huntington's disease (HD). As the authors explain: Within the last two years we have applied the automated two-hybrid system for the identification of protein-protein interactions involved in HD. Using this method, a network of protein-protein interactions involved in Huntington's disease including 188 protein-protein interactions were found (left images). Protein interactions were verified by in vitro binding experiments, co-immunoprecipitations and co-localization studies. The network permitted the functional annotation of 16 uncharacterized proteins and lead to the discovery of GIT1, a G protein-coupled receptor kinase interacting protein, crucial for Huntington's disease pathogenesis. Currently, the automated yeast two-hybrid system is used to identify the partner proteins of human disease proteins. We propose that the understanding of protein-protein networks of human diseases will help to identify novel targets for therapeutic intervention.


988
2005 computer graphics by SM Douglas, GT Montelione, M Ger

PubNet is a utility that accepts as input up to two PubMed queries, and returns as output a network graph (in multiple image formats) based on user-specified node and edge selection properties. PubMed is a search system offered by the United States National Library of Medicine as part of the Entrez system. It provides a means of searching the MEDLINE database.

The resulting nodes from PubNet output represent data items associated with publications returned by the queries (such as paper ids, author names, and databank ids), and edges represent instances of shared properties. PubNet can be used to visualize a variety of relationships, such as the degree to which two authors collaborate or the MeSH Term relatedness of publications with PDB ids. The visualization is done with the aid of aiSee visualization software.

The particular image on the left is the result of two queries: Mark+Mike.


642
computer graphics (Graphviz) by Graphviz - Graph Visualization Software (drawn using twopi)

A real-world network containing 300 sites over 40 countries. The diagram was made to trace network incidents and to support maintenance. Original names and other details were obfuscated for anonymity. (This was not an AT&T network!) Drawn using twopi.


239
computer graphics (SAS) by Robert Allison

Robert Allison created this two-level, zoomable version with interactive tooltips, as a lovely "proof-of-concept" example. He used SAS/GRAPH map data sets for the map information, and PROC GMAP to draw the map, using the SAS/GRAPH annotate facility to overlay Minard's data on the map. The interactive zooming and tooltips make use of the SAS ODS facility.

How he did it:

http://www.math.yorku.ca/SCS/Gallery/minard/allison/minard_info.htm


240
computer graphics (SAS) by Robert Allison

Robert Allison created this two-level, zoomable version with interactive tooltips, as a lovely "proof-of-concept" example. He used SAS/GRAPH map data sets for the map information, and PROC GMAP to draw the map, using the SAS/GRAPH annotate facility to overlay Minard's data on the map. The interactive zooming and tooltips make use of the SAS ODS facility.


235
1999 computer graphics by Wilkinson

In Chapter 15 of The Grammar of Graphics, Wilkinson (1999) describes the encoding of the information from Minard's graphic according to his graph grammar. This is notable because the specification for the graph is declarative (what the graph consists of) rather than procedural (how to draw it).


231
computer graphics (SAGE) by Sage Visualization Group, Carnegie Mellon University

This graph, from the Visualization and Intelligent Interfaces group at CMU is one re-design, attempting to link the information about temperature directly to the path and strength of Napoleon's army, emphasizing their interrelations more directly. The (X,Y) coordinates are still map-based (latitude and longitude).

"The use of color clearly shows the heat wave during the advance and the steady decline in temperature through the retreat. The exception, a spell of temperatures above freezing, is clearly visible when the retreating army is between the cities of Krasnyj and Bobr."

Sage Visualization Group, Carnegie Mellon University:

http://www.cs.cmu.edu/~sage/


234
1993 computer graphics (Mathematica) by Shaw and Tigg

In Chapter 4 of Applied Mathematica: Getting Started, Getting it Done, Shaw and Tigg (1993) describe a Mathematica function, NapoleonicMarchOnMoscowAndBackAgainPlot[] to re-create a close approximation to Minard's graphic.

A simpler function, Minard[] in the file Minard.m draws the same graph.


943
2005 computer graphics by Ciro Cattuto

Ciro Cattuto wrote a simple piece of code that builds and visualizes a network of inferred semantic relations among the tags that Flickr users attach to their photos. He wrote a Python script that collects tagging info for the public photos of a given user. It does so by using FlickrClient, a Python interface to the Flickr API. The collected information is analyzed using this simple idea: if the presence of tag X and the presence of tag Y are statistically correlated, then X and Y must be somehow "semantically related".

The script focuses on the 50 most used tags of a given user. It loops over pairs of tags and uses a simple correlation heuristic to decide whether two tags are related or not. A graph is built by connecting related tags (nodes) with links (edges). Frequency information is used to measure the strength of a link and a simple conditional probability analysis is used to guess the link orientation, so that "less general" tags point to "more general" ones. The resulting partially directed graph is stored in DOT format and handed over to Graphviz (neato) for visualization.

Nodes correspond to tags, red nodes are the 10 most frequently used tags for the given user, label size increases with tag frequency, and thick edges represent statistically strong links. In this visualization model, strong links act as "elastic strings" pulling nodes close to each other: the closer two nodes are, the stronger is their correlation. Weak links are not shown, in an attempt to keep the graph readable.


1050
2006 computer graphics by Dietmar Offenhuber, Gerhard Dirm

SemaSpace is a fast and easy to use graph editor for large knowledge networks, specially designed for the application in non technical sciences and the arts. It creates interactive graph layouts in 2d and 3d by means of a flexible algorithm. The system is powerful enough for the calculation of complex networks and can incorporate additional data such as images, sounds and full texts.

In this case SemaSpace is mapping Ars electronica social network, containing all projects and people involved in Ars Electronica between 1996 and 2003 (data from the Ars Electronica database).


567
2006 computer graphics by Dietmar Offenhuber and Gerhard Dirmoser

2006-05-24: SemaSpace - Graph editor for large knowledge networks

From InfoVis:Wiki

SemaSpace - Graph editor for large knowledge networks

[Offenhuber and Dirmoser, 2006]

SemaSpace is a fast and easy to use graph editor for large knowledge networks, specially designed for the application in non technical sciences and the arts. It creates interactive graph layouts in 2d and 3d by means of a flexible algorithm. The system is powerful enough for the calculation of complex networks and can incorporate additional data such as images, sounds and full texts.

[Offenhuber and Dirmoser, 2006]

Details: http://residence.aec.at/didi/FLweb/

[Offenhuber and Dirmoser, 2006] Dietmar Offenhuber and Gerhard Dirmoser, SemaSpace, Retrieved at: May 24, 2006. http://residence.aec.at/didi/FLweb/


684
computer graphics (Pajek)

740
2003 computer graphics by Valdis Krebs

An airborne contagion, such as SARS or TB, spreads through human networks based on who comes in contact with whom, and how infectious and susceptible each party is. Multiple contacts play a role in the probability of infection.

Public health officials perform contact tracing to map the spread of the infection and manage its diffusion. The network on the left shows the spread of an airborne infectious disease. The map was created using actual contact data from the community in which the outbreak was happening. Black nodes are persons with clinical disease (and are potentially infectious), pink nodes represent exposed persons with incubating (or dormant) infection and are not infectious, green represent exposed persons with no infection and are not infectious. The infection status is unknown for the grey nodes.

Unfortunately the 'social butterfly' in this community, the black node in the center of the graph, is also the most infectious -- a super spreader.


154
2002 print by New York Times

Sometimes a map wants to be the forground rather than the background for a data display. Anamorphic maps deform the map for this purpose,This map from the New York Times shows the state of the U.S. presidential race from polls conducted before the 2000 election. In order to show the contribution of each state to a victory by Bush or Gore, each state is sized according to the number of votes it has in the Electoral College, with one square for each vote. A 5-level color scale distinguishes 'safe' from 'leaning', and a bar graph at the bottom shows the totals for all states.

Presented by Archie Tse in a session on Information Graphics at the 2002 Joint Statistical Meetings, Aug. 12, 2002.


69
1805 print by William Playfair (1759-1823), England

Invention of the pie chart, and circle graph, used to show part-whole relations.

Playfair, W. (1801). Statistical Breviary; Shewing, on a Principle Entirely New, the Resources of Every State and Kingdom in Europe . London: Wallis. Re-published in Wainer, H. and Spence, I. (eds.), The Commercial and Political Atlas and Statistical Breviary, 2005, Cambridge University Press, ISBN 0-521-85554-3.


468
computer graphics by James Wen

SurfSerf, shown opposite, is another helper application that produces a two dimension graph of your Web browsing. It shows you the structure of the sites you visited and how they are linked together. It is being developed by James Wen.


645
computer graphics (Graphviz) by Graphviz - Graph Visualization Software

A non-blocking switch network consisting of only 2-way splitters and selectors. This graph was created to illustrate the parallel edge feature.


86
1878 print by James Joseph Sylvester (1814-1897), England

The term "graph" introduced, referring to diagrams showing analogies between the chemical bonds in molecules and graphical representations of mathematical invariants (also coined the term "matrix").

Sylvester, J. J. (1878). On an application of the new atomic theory to the graphical representation of the invariants and covariants of binary quantics, with three appendices. American Journal of Mathematics, 1:64-128.


644
computer graphics (Graphviz) by Graphviz - Graph Visualization Software

A diagram of the relationships between objects in an SDH (Synchronous Digital Hierarchy) network. This graph was created to show a multiplicity of semantic relationships in a single graph.

In the graph file, the setting of the global page size, graph layout size, aspect ratio (to fill the allowed layout size) and centering means that the layout will be placed in a box that is precisely 7.5" wide by 7" high and centered on an 8.5x11 page. The default node is to draw nodes unlabeled. Subgraphs are employed to mark sets of nodes to be placed on the same rank (level) in the layout, and as local scopes for node or edge attribute initialization.


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.


852
computer graphics by H. Shiozawa, Y. Matsushita

The Natto View proposes an effective use of the third dimension, taking full advantage of the Z axis: drawing diagrams in two dimensions and reminding the third dimension for interactive manipulation.

The project is a set of 3D interactive visualizing techniques and provides dynamic focus+context operation for graph structure such as the World Wide Web. Information nodes, or HTML documents, are placed on the fundamental floor-plane in 3D space, and users can select and move arbitrary node with direct manipulation. As the user lifts a focused node up, the nodes to which it links are lifted up together, and thus complicated networks are disentangled dynamically. By three dimensional perspective technique, the user can view both details of information connections near the selected node and global context of the large information space like fisheye lens model. The differences of the Natto View from most of other graphical visualization are: It supports not only visualization but also interactive and dynamic manipulation on users' demand. It is a layout-independent method and thus suitable for dynamic enlargement of diagram such as incremental access to huge distributed information networks.


951
2003 computer graphics by (unknown)

Universite Tangente (UT) has produced some of the most amazing maps in an attempt to uncover major contemporary control systems. Mark Lombardi would truly be impressed by the level of detail and thought that went into some of the intricate network maps produced by UT. It's not only a great cartographic resource for understanding the current global issues, but also, a rich source of knowledge and history.

This map, entitled "The World Government", is an attempt to understand how world governance behaves, by analyzing its major contributors, from independent states, financial institutions, industrial firms, foundations, schools, universities, NGO's, international organizations, lobbyist groups, religious institutions, and others, in an endless network of influence. Dozens of icons represent each of these key players spread throughout the graph, while lines between them represent different types of ties. A special icon was created to characterize a percentage of property between elements.


799
2005 computer graphics by Jim Bumgardner

This graph is part of a series called Time Graphs. The project maps a large number of photographs from Flickr by time, in an attempt to use photos as datapoints in graphs (which in turn tell you something about the photos).

This diagram shows 15000 photos tagged with the word "sunset", taken throughout 2004. Their horizontal positions represent the day of the year the photo was taken. January is on the left, December is on the right. The vertical bars are the boundaries between months.

The vertical position represents the time of day the photo was taken, according to the EXIF data. The horizontal lines are hours, with the thick line in the middle representing 12 noon.

The deepest "dip" in the wave formed by the images is the Summer Solstice.


795
computer graphics by Martin Spernau

Java application that uses the Web API to produce graphs of related pages by running "similar-to" queries on Google. Google ranks search results partly based upon the number and importance of links pointing to a particular page. The TouchGraph Google Browser uses Google's database to determine and display the links between a URL that you enter and other pages on the web. The results are displayed in a graph that shows both inbound and outbound relationships between URLs.

Bill Koelzer has written a great feature on the TouchGraph GoogleBrowser in RealityTimes "Once you see your interconnected Web revealed to you on the Touchgraph GoogleBrowser, you will never be the same. This is because you will have actually seen that which you could only imagine before."

"TouchGraph provides a hands-on way to visualize networks of interrelated information. Networks are rendered as interactive graphs, which lend themselves to a variety of transformations. By engaging their visual image, a user is able to navigate through large networks, and to explore different ways of arranging the network's components on screen."

Similar applications have been created using TouchGraph, such as the Amazon Browser and LiveJournal Browser.


498
computer graphics (tracemap)

tracemap from Matrix.Net a is a Web-based geographical traceroute. The traces run from Alexa in California. The map shows a trace to UCL in London. Tracemap also produces a table of hops and a graph of the times for the trace.


177
1991 print by R. A. Fisher

Figure 3: A dotplot of the barley data showing yield against site and year given variety.

The figure is a Trellis display of data from an agricultural field trial of barley yields at six sites in Minnesota; ten varieties of barley were grown in each of two years. The data were presented by R. A. Fisher in The Design of Experiments and analyzed subsequently by many others.

William Cleveland's display of these data shows an apparent surprise missed by previous investigators, which occurs at the Morris site: For all other sites, 1931 produced a significantly higher overall yield than 1932. The reverse is true at Morris. But most importantly, the amount by which 1932 exceeds 1931 at Morris is similar to the amounts by which 1931 exceeds 1932 at the other sites. More displays, a statistical modeling of the data, and some background checks on the experiment led to the conclusion that the data are in error -- the years for Morris were inadvertently reversed. The background of the data, and analysis with Trellis are described in more detail in The Visual Design and Control of Trellis http://www.research.att.com/areas/stat/doc/95.8.color.ps).

The graph uses main effect ordering to arrange the 6 sites and 10 barley varieties from bottom to top according to increasing values of the median yields (collapsed over other factors). This greatly aids perception of trends in the data and makes the Morris data stand out as unusual.


937
2002 computer graphics by Patrick Vuarnoz

Tsunami is a visual prototype on the topic "visual thesaurus". The aim of this visual thesaurus is to avoid the resulting visual complexity of too many connecting lines between the term of interest and the describing terms, which interferes with the readability of the information. Instead it tries to reduce the complexity-problem by having all terms on a fix position within the system, which might be grouped by thematic regions. This allows to display other information, in this example the path a user takes and the terms he skipped while browsing the system.

The issue of overlapping edges in complex graphs is an ever-present concern in most network visualizations. In static graph representations, Mark Lombardi is a major reference by the cleanness of his drawings, where rarely there's any edge overlapping. Here, Patrick Vuarnoz, taking advantage of user interaction, explores a fresh approach to the problem, which with more matureness and avoiding excessive use of sound might derive in an important contribution.


649
computer graphics (Graphviz) by Graphviz - Graph Visualization Software

The fdp layout program supports edges between nodes and clusters and cluster-to-cluster. The syntax is fairly obvious. fdp is being actively worked on, so the probability of hitting a bug is higher than with neato. Also the quality of the layouts will be improving.


646
1984 computer graphics (Graphviz) by after Ian Darwin and Geoff Collyer

This is our earliest example file (Graphviz). The graph was originally hand-drawn by Ian Darwin and Geoff Collyer in 1984 and 1986, though we added to it a little.


794
computer graphics by Kevin Palfreyman

Palfreyman's work is about visualing information stores in the abstract sense: Urlgraph is a tool for visualizing the world around your web page. Similar to work done at XEROX PARC.


128
1957 print by Edgar Anderson, USA

Circular glyphs, with rays to represent multivariate data.

Anderson, E. (1957). A semigraphical method for the analysis of complex problems. Proceedings of the National Academy of Sciences, 13(3):923-927. Reprinted in Technometrics, 2:387-391 (August 1960).


1014
2003 computer graphics by Christian Langreiter

The goal of this project is to envision and implement compelling, useful and/or enlightening visualizations of the Vanilla snip/link structure. Vanilla is a simple, extensible hypertext system and framework for developing small-scale web applications written in REBOL.

The first incarnation of vanilla-vista uses TouchGraph, a Java framework for creating dynamic graph visualizations developed by Alex Shapiro. On langreiter.com, one can experience vanilla-vista in many ways throughout the site by clicking on a particular icon whenever one can spot it (e.g. at the upper right in the header of snips).

A very interesting application of vanilla-vista (available at langreiter.com) is visualizing Google sets, in particular when mapping the relationships and sphere of influence of a particular person, such as Isaac Newton, Plato, Galileo, or Frank Sinatra. Once the initial graph has loaded, you can wander further by double-clicking on a node (which loads the next few neighbouring nodes, should there be any). Be sure to right-click on nodes to see more options (like jumping to the node of interest in the browser).


807
computer graphics by Jeff Brown (MOAT - National Laboratory for Applied Network Research (NLANR))

This map represents a 3D model of the vBNS network, using the tool CICHLID,which connects universities and laboratories in the USA.

"A vertex-edge graph consists of two arrays: one of vertex structures, and one of edge structures. This corresponds closely to the abstract mathematical representation of a graph as G(V;E), except that the vertices and edges in Cichlid contain not only connectivity information, but also graphical attributes. Each vertex is defined by a VtxInfo structure, which contains a 3-D location vector, a relative size parameter, color information, and a drawing style hint. Each edge is defined by an EdgeInfo structure, which indicates the vertices where the edge terminates, the directionality of the edge, size, color, and style. The vertices are defined to exist in a 3-D coordinate space, which is declared ahead of time; this space is mapped to the final graphical representation. The edges are defined to connect pairs of vertices."


1064
2000 computer graphics by Martin Graham

Acknowledging that most of the efforts of tree structure visualization concentrate on visualising the structure and properties of just a single tree, Martin Graham's PhD premise was to develop a metaphor that allows users to explore the relations and properties of and across multiple tree structures.

With that in mind, from 2000 onward, Martin Graham and his colleagues developed a series of graph visualizations of overlapping taxonomic data. Overlapping hierarchies could be switched on/off with colour indicating relationships in a particular hierarchy. Eventually they moved to a multiple tree format as a preferred visualisation after feedback from users.


925
2005 computer graphics by Franck Ghitalla, Guilhem Fouetil

This visualization reflects the impact of blogs and websites in swinging public opinion on the May referendum about European Constitution in France. The goal of this study was to better understand the political debate on the Web and how it is structured in terms of sites correlations.

Taking as treating starting point ten sites of the referendum, the authors repatriated more than 12.000 sites and 2.500.000 pages. After an extensive automated filtering process seeking for words or expressions in connection with the debate, 295 sites were selected and classified in either sites of Yes or sites of No. The No campaign set up 161 of the 295 sites focusing on the constitutional debate, helping redress a bias towards the Yes campaign in the mainstream media. The No vote eventually won the referendum on May 29 with a 55 per cent majority.

It is the community of No which is densest, 76% of its bonds are intercommunity against 52,5% for Yes. If one brings back these figures to the respective sizes of the communities and calculates the coefficient of opening for each community, there's a coefficient of opening 20% more significant for the community of Yes than for that of No.

In the depicted graph, red nodes denote the No sites while the blue ones reflect the Yes. Edges express relationships (linkage) and the nodes' size represents the level of authority (popularity), in analogy to GoggleRank.


461
computer graphics by John Cugini

The image above is a VISVIP visualisation of a user path through a Web site. It was developed by John Cugini and colleagues in the Visualization and Virtual Reality Group at the National Institute of Standards and Technology, USA.




The user's path through the site is shown by the curving yellow line overlaid on the site structure. The length of time spent at each page is represented by the height of dotted line projecting up from the graph.


871
1999 computer graphics by J. Cugini, J. Scholtz

VISVIP is part of a tool set designed to assist usability engineers (UE) evaluate web-based applications. The purpose of VISVIP is to visualize data generated by the WebVIP tool. WebVIP allows the UE to instrument a website so as to produce a log of activity when an experimental subject uses the site to accomplish some task. The log is essentially a sequence of time-stamped URLs, indicating the user's path through the website.

VISVIP allows the UE to visualize such paths; it automatically lays out a 2D graph of the website. Each node of the graph represents a web page, and edges represent links between pages. Nodes are color-coded by type: blue for HTML, purple for directories, green for images, and so on. Because URLs tend to be long, a briefer nickname is generated for each page. The UE has several options to simplify the graph: nodes of a given type, or those not on or near a userpath, can be suppressed. Also, if a graph is highly interconnected, the UE can specify that the site be pictured as a tree emanating from a selected root node.


797
2004 computer graphics by Jeffrey Heer

Vizster is an interactive visualization tool for online social networks, allowing exploration of the community structure of social networking services such as friendster.com, tribe.net, and orkut. Such services provide means by which users can publicly articulate their mutual "friendship" in the form of friendship links, forming an undirected graph in which users are the nodes and friendship links are the edges. These services also allow users to describe themselves in a profile, including attributes such as age, marital status, sexual orientation, and various interests.

Vizster provides a visualization of such services, providing an interactive sociogram for exploring the links between network members. In addition to visualizing "friendship" linkages, Vizster supports a range of exploratory search features, providing visualization of the rich profile data characteristic of these services, features which traditional sociograms are not designed to communicate.


746
2001 computer graphics by Young Hyun

Walrus is an interactive visualization tool that allows the analyst to view massive graphs from any position. The graph is projected inside a 3D sphere using a special kind of space based hyperbolic geometry. This is a non-Euclidean space, which has useful distorting properties of making elements at the center of the display much larger than those on the periphery. You interact with the graph in Walrus by selecting a node of interest, which is smoothly moved into the center of the display, and that region of the graph becomes greatly enlarged, enabling you to focus on the fine detail. Yet the rest of the graph remains visible, providing valuable context of the overall structure. Hyperbolic space projection is commonly know as 'focus+context' in the field of information visualization and has been used to display all kinds of data that can be represented as large graphs in either two and three dimensions.


491
computer graphics by Young Hyun

This striking image is a 3D hyperbolic graph of Internet topology. They are created using the Walrus visualisation tool developed by Young Hyun at the Cooperative Association for Internet Data Analysis (CAIDA).




The underlying data on the topological structure of the Internet is gathered by skitter, a CAIDA tool for large-scale collection and analysis of Internet traffic path data.


492
computer graphics by Young Hyun

This striking image is a 3D hyperbolic graph of Internet topology. They are created using the Walrus visualisation tool developed by Young Hyun at the Cooperative Association for Internet Data Analysis (CAIDA).




The underlying data on the topological structure of the Internet is gathered by skitter, a CAIDA tool for large-scale collection and analysis of Internet traffic path data.


1045
2006 computer graphics by Sala

Everyday, we look at dozens of websites. The structure of these websites is defined in HTML, the lingua franca for publishing information on the web. Your browser's job is to render the HTML according to the specs (most of the time, at least). You can look at the code behind any website by selecting the "View source" tab somewhere in your browser's menu.

HTML consists of so-called tags, like the A tag for links, IMG tag for images and so on. Since tags are nested in other tags, they are arranged in a hierarchical manner, and that hierarchy can be represented as a graph. Using Processing Sala has written an application that visualizes any inputted URL as a graph as seen from these images. The first represents msn.com homepage while the second shows yahoo.com.

Sala used color to indicate the most used tags in the following way:

blue: for links (the A tag)
red: for tables (TABLE, TR and TD tags)
green: for the DIV tag
violet: for images (the IMG tag)
yellow: for forms (FORM, INPUT, TEXTAREA, SELECT and OPTION tags)
orange: for linebreaks and blockquotes (BR, P, and BLOCKQUOTE tags)
black: the HTML tag, the root node
gray: all other tags



575
20060525 computer graphics by Aharef Weblog

2006-05-29: Websites as graphs

From InfoVis:Wiki

Website as graph

Structure of http://www.infovis-wiki.net

[Aharef, 2006]

Everyday, we look at dozens of websites. The structure of these websites is defined in HTML, the lingua franca for publishing information on the web. Your browser's job is to render the HTML according to the specs (most of the time, at least). You can look at the code behind any website by selecting the "View source" tab somewhere in your browser's menu.

HTML consists of so-called tags, like the A tag for links, IMG tag for images and so on. Since tags are nested in other tags, they are arranged in a hierarchical manner, and that hierarchy can be represented as a graph. I've written a little app that visualizes such a graph, and here are some screenshots of websites that I often look at.

I've used some color to indicate the most used tags in the following way:

blue: for links (the A tag)

red: for tables (TABLE, TR and TD tags)

green: for the DIV tag

violet: for images (the IMG tag)

yellow: for forms (FORM, INPUT, TEXTAREA, SELECT and OPTION tags)

orange: for linebreaks and blockquotes (BR, P, and BLOCKQUOTE tags)

black: the HTML tag, the root node

gray: all other tags

[Aharef, 2006]

Details: http://www.aharef.info/2006/05/websites_as_graphs.htm

[Aharef, 2006] Aharef Weblog, Websites as graphs, Created at: May 25, 2006, Retrieved at: May 29, 2006, http://www.aharef.info/2006/05/websites_as_graphs.htm


992
computer graphics by Pedram Amini

Founded in June of 2005 as the brainchild of Pedram Amini, the Open Reverse Code Engineering community was created to foster a shared learning environment among researchers interested in the field of reverse engineering. OpenRCE aims to serve as a centralized resource for reverse engineers (currently heavily win32/security/malcode biased) by hosting files, blogs, forums articles and more.

The Win32 Call Chains database, initially contributed to OpenRCE by Pedram Amini, attempts to provide a useful and comprehensive interface to the function call trees of the main Microsoft Windows Dynamic Link Libraries (DLLs). The data-set was originally contructed during the development of a proof of concept Windows Intrusion Prevention System (IPS), similar to NAI Entercept and Okena/Cisco CSA.

The database is organized by each Windows Operating System version (2000, 2003 SE, XP) and can be easily browsed and searched. Within each OS version, there's an interactive Java visualization for every module which creates some of the most amazingly complex graphs. The first image shows the resulting graph of Windows XP SP2 GDI32 module, while the second represents the NETAPI32 module of the same OS.




70
1843 print by Léon Lalanne (1811-1892), France

Use of polar coordinates in a graph (frequency of wind directions).

Lalanne, L. (1845). Appendice sur la representation graphique des tableaux météorologiques et des lois naturelles en général. In L. F. Kaemtz (ed.), Cours Complet de Météorologie, pp. 1-35. Paulin. Translated and annotated by C. Martins.


647
computer graphics (Graphviz) by after Forrester

This is a graph from Forrester's book World Dynamics. It originally appeared as an example in the Messinger [sic], Rowe et al paper on the GRAB system. We (Graphviz) added "same rank" constraints to force a certain level assignment, to evaluate edge crossing avoidance heuristics.


139
1991 computer graphics (XGvis) by Andreas Buja, Deborah F. Swayne, Michael L. Littman, Nathaniel Dean

From 1991 to 1996, there was a spate of development and public distribution of highly interactive systems for data analysis and visualization, e.g., XGobi, ViSta by Deborah Swayne, Di Cook, Andreas Buja, and Forrest Young (1940-2006).

Buja, A., Asimov, D., Hurley, C., and McDonald, J. A. (1988). Elements of a viewing pipeline for data analysis. In William S. Cleveland and M. E. McGill (eds.), Dynamic Graphics for Statistics. Pacific Grove, CA: Brooks/Cole.

Swayne, D. F., Cook, D., and Buja, A. (1992). XGobi: Interactive dynamic graphics in the X Window System with a link to S. In Proceedings of the 1991 American Statistical Association Meetings, pp. ??-?? American Statistical Association.

Buja, A., Cook, D., and Swayne, D. F. (1996). Interactive high-dimensional data visualization. Journal of Computational and Graphical Statistics , 5 (1):78-99.

Swayne, D. F., Cook, D., and Buja, A. (1998). XGobi: Interactive dynamic data visualization in the X Window System. Journal of Computational and Graphical Statistics, 7(1):113-130.

Young, F. W. (1994). ViSta: The Visual Statistics System . Tech. Rep. RM 94-1, L.L. Thurstone Psychometric Laboratory, UNC.


833
2002 computer graphics by Alex Adai

LGL (Large Graph Layout) is a compendium of software applications for making the visualization of large networks and trees tractable. LGL was specifically motivated by the need to make the visualization and exploration of large biological networks more accessible.

The website contains a rich gallery with a collection of different graphs and trees generated by LGL from different sources of biological data.

This image represents a zoomed region of the Yeast Protein Interaction Map in 3D (VRML)