- The Open Knowledge Network
- The Collective Awareness Platforms for Sustainability and Social Innovation (CAPS) are ICT systems leveraging the emerging "network effect" by combining open online social media, distributed knowledge creation and data from real environments (Internet of Things), in order to create new forms of social innovation. They are expected to support environmentally aware, grassroots processes and practices to share knowledge, to achieve changes in lifestyle, production and consumption patterns, and to set up more participatory democratic processes.
- Gephi is an open-source software for visualizing and analyzing large networks graphs. Gephi uses a 3D render engine to display graphs in real-time and speed up the exploration. Use Gephi to explore, analyse, spatialise, filter, cluterize, manipulate and export all types of graphs.
- Three-Toed Sloth Slow Takes from the Canopy (My Very Own Internet Tradition) June 15, 2007 « Reformatting in Progress | Main | Books to Read While the Algae Grow in Your Fur, May 2007 » So You Think You Have a Power Law — Well Isn't That Special? Regular readers who care about such things — I think there are about three of you — will recall that I have long had a thing about just how unsound many of the claims for the presence of power law distributions in real data are, especially those made by theoretical physicists, who, with some honorable exceptions, learn nothing about data analysis. (I certainly didn't.) I have even whined about how I should really be working on a paper about how to do all this right, rather than merely snarking in a weblog. As evidence that the age of wonders is not passed — and, more relevantly, that I have productive collaborators — this paper is now loosed upon the world: Aaron Clauset, CRS and M. E. J. Newman, "Power-law distributions in empirical data", arxiv:0706.1062, with code available in Matlab and R; forthcoming (2009) in SIAM Review Abstract: Power-law distributions occur in many situations of scientific interest and have significant consequences for our understanding of natural and man-made phenomena. Unfortunately, the empirical detection and characterization of power laws is made difficult by the large fluctuations that occur in the tail of the distribution. In particular, standard methods such as least-squares fitting are known to produce systematically biased estimates of parameters for power-law distributions and should not be used in most circumstances. Here we describe statistical techniques for making accurate parameter estimates for power-law data, based on maximum likelihood methods and the Kolmogorov-Smirnov statistic. We also show how to tell whether the data follow a power-law distribution at all, defining quantitative measures that indicate when the power law is a reasonable fit to the data and when it is not. We demonstrate these methods by applying them to twenty-four real-world data sets from a range of different disciplines. Each of the data sets has been conjectured previously to follow a power-law distribution. In some cases we find these conjectures to be consistent with the data while in others the power law is ruled out. The paper is deliberately aimed at physicists, so we assume some things that they know (like some of the mechanisms, e.g. critical fluctuations, which can lead to power laws), and devote extra detail to things they don't but which e.g. statisticians do know (such as how to find the cumulative distribution function of a standard Gaussian). In particular, we refrained from making a big deal about the need for an error-statistical approach to problems like this, but it definitely shaped our thinking. Aaron has already posted about the paper, but I'll do so myself anyway. Partly this is to help hammer the message home, and partly this is because I am a basically negative and critical man, and this sort of work gives me an excuse to vent my feelings of spite under the pretense of advancing truth (unlike Aaron and Mark, who are basically nice guys and constructive scholars). Here are the take-home points, none of which ought to be news, but which, taken together, would lead to a real change in the literature. (For example, half or more each issue of Physica A would disappear.) 1. Lots of distributions give you straight-ish lines on a log-log plot. True, a Gaussian or a Poisson won't, but lots of other things will. Don't even begin to talk to me about log-log plots which you claim are "piecewise linear". 2. Abusing linear regression makes the baby Gauss cry. Fitting a line to your log-log plot by least squares is a bad idea. It generally doesn't even give you a probability distribution, and even if your data do follow a power-law distribution, it gives you a bad estimate of the parameters. You cannot use the error estimates your regression software gives you, because those formulas incorporate assumptions which directly contradict the idea that you are seeing samples from a power law. And no, you cannot claim that because the line "explains" (really, describes) a lot of the variance that you must have a power law, because you can get a very high R^2 from other distributions (that test has no "power"). And this is without getting into the additional errors caused by trying to fit a line to binned histograms. It's true that fitting lines on log-log graphs is what Pareto did back in the day when he started this whole power-law business, but "the day" was the 1890s. There's a time and a place for being old school; this isn't it. 3. Use maximum likelihood to estimate the scaling exponent. It's fast! The formula is easy! Best of all, it works! The method of maximum likelihood was invented in 1922 [parts 1 and 2], by someone who studied statistical mechanics, no less. The maximum likelihood estimators for the discrete (Zipf/zeta) and continuous (Pareto) power laws were worked out in 1952 and 1957 (respectively). They converge on the correct value of the scaling exponent with probability 1, and they do so efficiently. You can even work out their sampling distribution (it's an inverse gamma) and so get exact confidence intervals. Use the MLEs! 4. Use goodness of fit to estimate where the scaling region begins. Few people pretend that the whole of their data-set follows a power law distribution; usually the claim is about the right or upper tail, the large values over some given threshold. This ought to raise the question of where the tail begins. Usually people find it by squinting at their log-log plot. Mark Handcock and James Jones, in one of the few worthwhile efforts here, suggested using Schwarz's information criterion. This isn't bad, but has trouble with with continuous data. Aaron devised an ingenious method which finds the empirically-best scaling region, by optimizing the Kolmogorov-Smirnov goodness-of-fit statistic; it performs slightly better than the information criterion. (Yes, one could imagine more elaborate semi-parametric approaches to this problem. Feel free to go ahead and implement them.) 5. Use a goodness-of-fit test to check goodness of fit. In particular, if you're looking at the goodness of fit of a distribution, use a statistic meant for distributions, not one for regression curves. This means forgetting about R^2, the fraction of variance accounted for by the curve, and using the Kolmogorov-Smirnov statistic, the maximum discrepancy between the empirical distribution and the theoretical one. If you've got the right theoretical distribution, KS statistic will converge to zero as you get more data (that's the Glivenko-Cantelli theorem). The one hitch in this case is that you can't use the usual tables/formulas for significance levels, because you're estimating the parameters of the power law from the data. (If you really want to see where the problem comes from, see Pollard, starting on p. 99.) This is why God, in Her wisdom and mercy, gave us the bootstrap. If the chance of getting data which fits the estimated distribution as badly as your data fits your power law is, oh, one in a thousand or less, you had better have some other, very compelling reason to think that you're looking at a power law. 6. Use Vuong's test to check alternatives, and be prepared for disappointment. Even if you've estimated the parameters of your parameters properly, and the fit is decent, you're not done yet. You also need to see whether other, non-power-law distributions could have produced the data. This is a model selection problem, with the complication that possibly neither the power law nor the alternative you're looking at is exactly right; in that case you'd at least like to know which one is closer to the truth. There is a brilliantly simple solution to this problem (at least for cases like this) which was first devised by Quang Vuong in a 1989 Econometrica paper: use the log-likelihood ratio, normalized by an estimate of the magnitude of the fluctuations in that ratio. Vuong showed that this test statistic asymptotically has a standard Gaussian distribution when the competing models are equally good; otherwise it will almost surely converge on picking out the better model. This is extremely clever and deserves to be much better known. And, unlike things like the fit to a log-log regression line, it actually has the power to discriminate among the alternatives. If you use sensible, heavy-tailed alternative distributions, like the log-normal or the Weibull (stretched exponential), you will find that it is often very, very hard to rule them out. In the two dozen data sets we looked at, all chosen because people had claimed they followed power laws, the log-normal's fit was almost always competitive with the power law, usually insignificantly better and sometimes substantially better. (To repeat a joke: Gauss is not mocked.) For about half the data sets, the fit is substantially improved by adding an exponential cut-off to the power law. (I'm too lazy to produce the necessary equations; read the paper.) This means that there is a characteristic scale after all, and that super-mega-enormous, as opposed to merely enormous, events are, indeed, exponentially rare. Strictly speaking, a cut-off power law should always fit the data better than a pure one (just let the cut-off scale go to infinity, if need be), so you need to be a little careful in seeing whether the improvement is real or just noise; but often it's real. 7. Ask yourself whether you really care. Maybe you don't. A lot of the time, we think, all that's genuine important is that the tail is heavy, and it doesn't really matter whether it decays linearly in the log of the variable (power law) or quadratically (log-normal) or something else. If that's all that matters, then you should really consider doing some kind of non-parametric density estimation (e.g. Markovitch and Krieger's [preprint]). Sometimes, though, you do care. Maybe you want to make a claim which depends heavily on just how common hugely large observations are. Or maybe you have a particular model in mind for the data-generating process, and that model predicts some particular distribution for the tail. Then knowing whether it really is a power law, or closer to a power law than (say) a stretched exponential, actually matters to you. In that case, you owe it to yourself to do the data analysis right. You also owe it to yourself to think carefully about whether there are other ways of checking your model. If the only testable prediction it makes is about the shape of the tail, it doesn't sound like a very good model, and it will be intrinsically hard to check it. Because this is, of course, what everyone ought to do with a computational paper, we've put our code online, so you can check our calculations, or use these methods on your own data, without having to implement them from scratch. I trust that I will no longer have to referee papers where people use GnuPlot to draw lines on log-log graphs, as though that meant something, and that in five to ten years even science journalists and editors of Wired will begin to get the message. Manual trackbacks: The Statistical Mechanic; Uncertain Principles; zs; LanguageLog; Science After Sunclipse; Philosophia Naturalis 11 (at Highly Allochthonous); Langreiter; blogs for industry ... blogs for the dead; Infectious Greed; No Free Lunch; Look Here First; TPMCafe; Science After Sunclipse; Cosmic Variance; Messy Matters Power Laws; Enigmas of Chance; Complexity Posted by crshalizi at June 15, 2007 13:00 | permanent link Three-Toed Sloth: Hosted, but not endorsed, by the Center for the Study of Complex Systems
- Brad Fitzpatrick recently wrote an elegant and important post about the Social Graph, a term used by Facebook to describe their social network. In his post, Fitzpatrick defines "social graph" as "the global mapping of everybody and how they're related". He went on to outline the problems with it, as well as a broad set of goals going forward. One problem is that currently you need to have different logins for different social networks. Another issue is portability and ownership of an individual's information, explicitly and implicitly revealed while using social networks. As was recently asserted in the Social...
- Think back to the last time you were in a crowded airport or bus terminal far from home. Did you consider that the person sitting next to you probably knew a friend of a friend of a friend of yours? In the 1960s, social psychologist Stanley Milgram’s “small world experiment” famously tested the idea that any two people in the world are separated by only a small number of intermediate connections, arguably the first experimental study to reveal the surprising structure of social networks. With the rise of modern computing, social networks are now being mapped in digital form, giving researchers the ability to study them on a much grander, even global, scale. Continuing this tradition of social network research, Facebook, in collaboration with researchers at the Università degli Studi di Milano, is today releasing two studies of the Facebook social graph. First, we measured how many friends people have, and found that this distribution differs significantly from previous studies of large-scale social networks. Second, we found that the degrees of separation between any two Facebook users is smaller than the commonly cited six degrees, and has been shrinking over the past three years as Facebook has grown. Finally, we observed that while the entire world is only a few degrees away, a user’s friends are most likely to be of a similar age and come from the same country. In our studies, performed earlier this year, we examined all 721 million active Facebook users (more than 10% of the global population), with 69 billion friendships among them. To date, these are the largest social network studies ever released.
- Its so fun to write oversimplified posts about such-and-such is dead. Not because its true. At best you can point out something is broken and alternatives are rising fast. But I wonder how the people behind the aging technology and...
- Einst erfand Delicious die "sozialen" Lesezeichen. Zuletzt stand der Dienst aber kurz vor dem Aus. Die Youtube-Gründer wollen ihn nun zum Twitter-Konkurrenten umbauen.
- Lately, we've been working hard to improve BibSonomy's social features. With the recent release we introduced another unique feature that was not announced until now. Following the intuition that secrets are always shared among best friends, our idea is to connect you to people who have the same login password for BibSonomy as you. This is an outstanding feature that other social networking sites lack up to now - usually, you only get buddies recommended by some black-box algorithm. Our solution is more targeted towards the idea that great minds think alike, and hence choose the same password. So if you have the same password as other users in BibSonomy, you'll see them in the sidebar in the new "your password buddies" section: Just have a look at your personal page to get to know your possible new buddies. Please note that it is possible that some of your password buddies have another password than you because of the possible hash collisions of the MD5 algorithm. Unfortunately we can not solve this issue because we don't store the plain text password, but we are working on an extension of the MD5 algorithm that produces no collisions. Happy secret sharing! Your BibSonomy team
- Twitter recently transitioned to OAuth, but the social network's implementation of the new authentication system has some serious flaws. Ars shows how easy it was to compromise the secret key of Twitter's own official client application for Android.
- The main research focus of the Social Computing Laboratory at HP Labs is harvesting the collective intelligence of groups of people to optimize the interaction between users and information. HP Labs is the advanced research center for Hewlett-Packard..

*Proceedings of the 2015 ACM Conference on Web Science,**New York, NY,**ACM,*(*2015*)*Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,**page 990--998.**New York, NY, USA,**ACM,*(*2008*)*Proc. VLDB Endow.**6(11):1126--1137*(*August 2013*)*Proceedings of the eighth International AAAI Conference on Weblogs and Social Media,**page 266--274.**AAAI,**AAAI Press,*(*June 2014*)*Proceedings of the 25th ACM Conference on Hypertext and Social Media,**page 285--290.**New York, NY, USA,**ACM,*(*2014*)*Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis,**page 26--35.**New York, NY, USA,**ACM,*(*2007*)- (
*2012*)*cite arxiv:1202.5469Comment: Wikimania 2009, 5th International Conference of the Wikimedia Community.* *Proceedings of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval,**page 839--840.**New York, NY, USA,**ACM,*(*2010*)*Proceedings of the Fourth ACM International Conference on Web Search and Data Mining,**page 565--574.**New York, NY, USA,**ACM,*(*2011*)*IEEE Transactions on Knowledge and Data Engineering**25(8):1801--1813*(*August 2013*)*Journal of the Association for Information Science and Technology**65(11):2195--2209*(*2014*)*Proceedings of the 20th International Conference on World Wide Web,**page 705--714.**New York, NY, USA,**ACM,*(*2011*)*Proceedings of the Third ACM International Conference on Web Search and Data Mining,**page 251--260.**New York, NY, USA,**ACM,*(*2010*)*Proceedings of the Sixth ACM International Conference on Web Search and Data Mining,**page 587--596.**New York, NY, USA,**ACM,*(*2013*)*Transactions on Intelligent Systems and Technology*(*2015*)*Nature News**512(7513):126--130*(*August 2014*)*Proceedings of the Fifth ACM International Conference on Web Search and Data Mining,**page 743--752.**New York, NY, USA,**ACM,*(*2012*)*Computers in Human Behavior**29(6):2134--2142*(*2013*)*Journal of Intelligent Information Systems**40(1):41--61*(*2013*)*Proceedings of the 14th International Conference on World Wide Web,**page 463--470.**New York, NY, USA,**ACM,*(*2005*)*Phys. Rev. E**64(1):016131*(*June 2001*)*Data Mining and Knowledge Discovery**24(3):555--583*(*2012*)*IEEE Transactions on Systems, Man, and Cybernetics: Systems,**43(3):673--688*(*May 2013*)*CoRR*(*January 2014*)*CoRR*(*2013*)*Semantic Web*(*2012*)*Proceedings of the SIGCHI Conference on Human Factors in Computing Systems,**page 593--600.**New York, NY, USA,**ACM,*(*2003*)*Journal of the American Society for Information Science and Technology**55(2):111--126*(*2004*)*Social Media Retrieval and Mining,**volume 387 of Communications in Computer and Information Science,**Springer,**Berlin/Heidelberg,*(*2013*)*Proceedings of the 22nd ACM international conference on Conference on information &\#38; knowledge management,**page 2381--2386.**New York, NY, USA,**ACM,*(*2013*)*Proceedings of the 13th ACM Conference on Electronic Commerce,**page 623--638.**New York, NY, USA,**ACM,*(*2012*)*Proceedings of the Fourth ACM International Conference on Web Search and Data Mining,**page 65--74.**New York, NY, USA,**ACM,*(*2011*)*Proceedings of the first ACM Conference on Online Social Networks,**page 213--222.**New York, NY, USA,**ACM,*(*2013*)*Proceedings of the 7th ACM conference on Recommender systems,**page 343--346.**New York, NY, USA,**ACM,*(*2013*)*cs.IR*(*2013*)*Proceedings of the 5th Annual ACM Web Science Conference,**page 191--194.**New York, NY, USA,**ACM,*(*2013*)*Proceedings of the 19th international conference on World wide web,**page 591--600.**New York, NY, USA,**ACM,*(*2010*)*PLoS ONE**5(1):e8694*(*January 2010*)*Proceedings of the National Academy of Sciences**105(4):1118--1123*(*2008*)*Advances in Data Analysis and Classification**5(2):129--145*(*2011*)*Scientific Reports*(*January 2013*)*Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences*(*2013*)*Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences*(*March 2013*)*Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences*(*March 2013*)*Wiley Series in Computational and Quantitative Social Science**John Wiley & Sons,**Hoboken,**2nd edition,*(*2012*)*Information Polity**15(1):51--71*(*January 2010*)*Mobile Networks and Applications**15(4):562--574*(*August 2010*)*Intelligent Systems Reference Library**Springer,**Berlin/Heidelberg,*(*2012*)*Proceedings of the SOCINFO,*(*2012*)*CoRR*(*September 2012*)