otter2008’s diary

I am searching for weighted graphs. I found some in the sites below.

C. Elegans neural network: A directed, weighted network representing the neural network of C. Elegans. Data compiled by D. Watts and S. Strogatz and made available on the web here. Please cite D. J. Watts and S. H. Strogatz, Nature 393, 440-442 (1998). Original experimental data taken from J. G. White, E. Southgate, J. N. Thompson, and S. Brenner, Phil. Trans. R. Soc. London 314, 1-340 (1986).

Online Social Network 1899 nodes - Opsahl, T., Panzarasa, P., 2009. Clustering in weighted networks. Social Networks 31 (2), 155-163

Les Miserables: coappearance weighted network of characters in the novel Les Miserables. D. E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley, Reading, MA (1993).

Network data

Neural network:A directed, weighted network representing the neural network of C. Elegans. Data compiled by D. Watts and S. Strogatz and made available on the web here. Please cite D. J. Watts and S. H. Strogatz, Nature 393, 440-442 (1998). Original experimental data taken from J. G. White, E. Southgate, J. N. Thompson, and S. Brenner, Phil. Trans. R. Soc. London 314, 1-340 (1986).

Condensed matter collaborations 1999: weighted network of coauthorships between scientists posting preprints on the Condensed Matter E-Print Archive between Jan 1, 1995 and December 31, 1999. Please cite M. E. J. Newman, The structure of scientific collaboration networks, Proc. Natl. Acad. Sci. USA 98, 404-409 (2001).

Astrophysics collaborations: weighted network of coauthorships between scientists posting preprints on the Astrophysics E-Print Archive between Jan 1, 1995 and December 31, 1999. Please cite M. E. J. Newman, Proc. Natl. Acad. Sci. USA 98, 404-409 (2001).

High-energy theory collaborations: weighted network of coauthorships between scientists posting preprints on the High-Energy Theory E-Print Archive between Jan 1, 1995 and December 31, 1999. Please cite M. E. J. Newman, Proc. Natl. Acad. Sci. USA 98, 404-409 (2001).

KONECT - The Koblenz Network Collection

Wikipedia conflict: The edges in this network represent positive and negative conflicts between users of the English Wikipedia, for example users involved in an edit-war. A node represents a user and an edge represents a conflict between two users, with the edge sign representing positive and negative interactions. An example for a negative interaction would be when one user revert the edit of another user.

Unicode languages: This bipartite network denotes which languages are spoken in which countries. Nodes are countries and languages; edge weights denote the proportion (between zero and one) of the population of a given country speaking a given language. To quote the Unicode data description: "The main goal is to provide approximate figures for the literate, functional population for each language in each territory: that is, the population that is able to read and write each language, and is comfortable enough to use it with computers."

Dutch college: This directed network contains friendship ratings between 32 university freshmen who mostly did not know each other before starting university. Each student was asked to rate the other student at seven different time points. Note that the origin of the timestamps is not accurately known but the distance between two timestamps is correct. A node represents a student and an edge between two students shows that the left rated the right one The edge weights show how good their friendship is in the eye of the left node. The weight ranges from -1 for risk of getting into conflict to +3 for best friend.

Sampson: This directed network contains ratings between monks related to a crisis in a cloister (or monastery) in New English (USA) which lead to a departure of several of the monks. This dataset aggregates several available ratings ((dis)esteem, (dis)liking, positive/negative influence, praise/blame) into only one rating, which is positive if all original ratings were positive and negative if all original ratings were negative. If there were mixed opinions the rating has the value 0. A node represents a monk and an edge between two monks shows that the left monk rated the right monk.

Chess: These are results of chess games. Each node is a chess player, and a directed edge represents a game, with the white player having an outgoing edge and the black player having an ingoing edge. The weight of the edge represents the outcome (+1 white won, 0 draw, -1 black won). The dataset is anonymous: the identity of the players is unknown, and timestamps are approximate. Timestamps are given to a one month precision, and may have been shifted towards the future by an unknown amount.

Links

tnet - analysis of weighted, two-mode and longitudinal networks: http://opsahl.co.uk/tnet/content/view/15/27/

SNAP: Network datasets: Social circles

bitcoin-otc: 5881nodes, 35592edges, weighted, signed, directed, Bitcoin OTC web of trust network