<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Graph Commons - Medium]]></title>
        <description><![CDATA[Platform for mapping, analyzing, publishing data-networks - Medium]]></description>
        <link>https://medium.com/graph-commons?source=rss----f5f8dfd35edb---4</link>
        <image>
            <url>https://cdn-images-1.medium.com/proxy/1*TGH72Nnw24QL3iV9IOm4VA.png</url>
            <title>Graph Commons - Medium</title>
            <link>https://medium.com/graph-commons?source=rss----f5f8dfd35edb---4</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Thu, 09 Apr 2026 05:45:19 GMT</lastBuildDate>
        <atom:link href="https://medium.com/feed/graph-commons" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com" rel="hub"/>
        <item>
            <title><![CDATA[Exciting News from Graph Commons and Happy 2020!]]></title>
            <link>https://medium.com/graph-commons/exciting-news-from-graph-commons-and-happy-2020-d1846f4ec6bc?source=rss----f5f8dfd35edb---4</link>
            <guid isPermaLink="false">https://medium.com/p/d1846f4ec6bc</guid>
            <category><![CDATA[data-visualization]]></category>
            <category><![CDATA[big-data]]></category>
            <category><![CDATA[systems-thinking]]></category>
            <category><![CDATA[ashoka]]></category>
            <category><![CDATA[data-science]]></category>
            <dc:creator><![CDATA[Burak Arikan]]></dc:creator>
            <pubDate>Fri, 20 Dec 2019 12:48:54 GMT</pubDate>
            <atom:updated>2019-12-20T12:51:59.193Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*y-UWeXuy-RShfo2vgfAWUQ.jpeg" /><figcaption>Ashoka Fellow Induction Ceremony, European Changemaker Summit, Barcelona, November 2019</figcaption></figure><p>I am thrilled to announce that I joined the global <a href="https://www.ashoka.org/">Ashoka</a> fellowship network for social entrepreneurship. Ashoka is the world’s first and largest platform for social entrepreneurs with 3500 fellows from 93 countries around the world. This engagement puts our work with Graph Commons on a whole new level as it will enable our team to focus more on our system changing strategies and priorities.</p><p>When it comes to technology, we usually engage with the question of <em>how</em>. In my most recent talk at the <a href="https://ecms.ashoka.org/">European Changemaker Summit</a> in Barcelona, I presented the question of <em>why</em>; why work on a project like Graph Commons.</p><p>Today, it is news to no user of digital technologies that we are being tracked and mapped whether we are using them for our work, or pleasure; with or without consent. The monopolies of such tech platforms create thick data maps of all our activities and preferences. However, we have no access to those cartographies created by the data we provide; all we get at the end of the day are some petty personalized recommendations. The massive data accumulation in the hands of the few, in other words, serves surveillance capitalism instead of smart use of technologies for good. As users, therefore, we find ourselves in a severe data asymmetry; while these platforms know everything about us, we know very little about how they work, what their real interests are, what they collect, or how they use the accumulated data. This situation has consequences not only in manipulation of our everyday personal behavior, but also in our collective decisions as societies, hence the election frauds we see around the world.</p><p>Efforts in creating alternatives run up against the inertia of these infrastructures; an inertia that relies on network effects, which lock us in and consolidate power in a single platform or product. By now, we know that withdrawal does not work, negation does not work, acceleration does not work. As McKenzie Wark writes, “we need to build new infrastructures within the ruins of the old.” [1]</p><p>What if, instead of capturing a social graph like Facebook, a knowledge graph like Google, a transportation graph like Uber, or a music graph like Spotify, <em>we enable building graph commons, an equitable network of graphs owned and controlled fully and collectively by those who create it. </em>This was and still is the idea we started to build on Graph Commons more than 5 years ago.</p><p>Over 30,000 members on 5 continents use Graph Commons to transform their own data into interactive network maps and untangle complex relations that impact them and their communities. <a href="https://graphcommons.com/graphs/19663d8d-6ceb-4431-83af-bc4e33d61174">Global Climate Change Deniers Network</a>, <a href="https://graphcommons.com/graphs/0a79deca-46a2-48e9-9d90-326b20aa6e9e">The Jeffrey Epstein Network</a>, <a href="https://codeofacquisitions.org/">Code of Acquisitions</a>, <a href="https://graphcommons.com/graphs/a5f158c2-9d58-4745-9fe5-97bc9d86dac4">Syrian Refugees Support Network</a>, <a href="https://graphcommons.com/graphs/6a993e34-d8b0-4425-83ce-67c3560429e7">Decentralized Governance Network</a> are some recent public trending graphs created collaboratively. There are many other use cases such as ecosystem mapping, impact mapping, organizational analysis, content curation, network analysis of blockchain activities, business strategies, investments, industry-specific knowledge graphs, and mapping of policies. These graphs help communities or teams to be on the same page about a complex issue by providing a holistic picture while also allowing exploration of specific paths and patterns between entities. Network maps enable us to discover hidden opportunities, and to see what issues are more central and urgent, which ones are in the periphery. The cluster analysis provides insight about the organic groups that are not visible otherwise. <em>The bridges between those clusters reveal possibilities of solidarity and partnerships among groups who work on seemingly separate issues.</em></p><p>In 2020, we will make the Graph Commons system more robust, develop the most requested features (such as synchronized data integration with productivity tools), and create deep and strong partnerships with communities we serve. We also work on a brand new infrastructure to enable equitable interoperability among separate graph data by different initiatives.</p><p>The value offered by Graph Commons and its social impact increase together with the community and we are grateful to you for that! We hope 2020 to be the year of sustainable growth, solidarity, and transforming impact. I wish you a happy and peaceful new year.</p><p><em>[1] The Vectoralist Class, Part Two. McKenzie Wark, 2016</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=d1846f4ec6bc" width="1" height="1" alt=""><hr><p><a href="https://medium.com/graph-commons/exciting-news-from-graph-commons-and-happy-2020-d1846f4ec6bc">Exciting News from Graph Commons and Happy 2020!</a> was originally published in <a href="https://medium.com/graph-commons">Graph Commons</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Accountability in decentralized networks: The MolochDAO Case]]></title>
            <link>https://medium.com/graph-commons/accountability-in-decentralized-networks-the-molochdao-case-c28a0b3dd942?source=rss----f5f8dfd35edb---4</link>
            <guid isPermaLink="false">https://medium.com/p/c28a0b3dd942</guid>
            <category><![CDATA[ethereum]]></category>
            <category><![CDATA[dao]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[governance]]></category>
            <category><![CDATA[moloch]]></category>
            <dc:creator><![CDATA[Burak Arikan]]></dc:creator>
            <pubDate>Sat, 17 Aug 2019 21:54:54 GMT</pubDate>
            <atom:updated>2019-08-18T11:00:11.902Z</atom:updated>
            <content:encoded><![CDATA[<h3><strong>Accountability in Decentralized Networks: The MolochDAO Case</strong></h3><p>This article investigates the dynamics of membership growth and voting in MolochDAO, a decentralized autonomous organization for collectively coordinating funds to support Ethereum development. Examining the voting activity in MolochDAO, we identified a tactical voting scheme that leaves it susceptible to manipulation. Because voter turnout will likely never be 100% and voting dynamics may deviate from protocol incentives, we should study empirical data wherever available and use those learnings to guide our protocol designs.</p><p>The level of participation in collective decision making is a dynamic metric that affects the security of plutocratic governance systems, where voting is not “one person, one vote”, but weighted by the token holdings of each account. When voting turnout is low, the powerful accounts — token holders with an outsized proportion of total supply — can significantly swing the numbers. This article examines this risk, particularly in MolochDAO, and suggests potential remedies.</p><h3><strong>DAO Basics</strong></h3><p>A decentralized autonomous organization (DAO) is an organization whose decision-making processes are transparent and enforced programmatically by a blockchain rather than a central authority.</p><p>After the tragic failure of the first DAO on Ethereum in 2016, several new DAO projects emerged. DAOs are typically used for collective fund coordination to support projects within the blockchain ecosystem, but the potential for DAOs to serve as new social coordination tools goes far beyond finance (Kei Kreutler’s talk “<a href="https://www.youtube.com/watch?v=3ImfNllRecI">Autonomous ecologies at a distance</a>” presents a good summary). Today, to start a DAO for your community you can design and implement the smart contract logic directly using best practices on the blockchain of choice, fork and redeploy an existing one such as <a href="https://github.com/MolochVentures/moloch">MolochDAO</a>, which is considered a minimum viable DAO because of its simplicity, or you can use a service such as Aragon or DAO Stack.</p><h3><strong>MolochDAO Membership Growth</strong></h3><blockquote><em>MolochDAO works because it has off-chain reputation within Ethereum community. —</em><a href="https://www.youtube.com/watch?v=YgEXImQLoq4"><em> Ameen Soleimani</em></a></blockquote><p>The MolochDAO smart contract on Ethereum was <a href="https://medium.com/molochdao/moloch-summoning-guide-12a2a288e0ff">deployed on Feb 14th 2019</a> and 22 founding members each donated 100 ETH for a total of 2,200 ETH (330K USD at the time). As of August 12th 2019, MolochDAO has 71 members. To become a member you have to know an existing member who can submit a membership application on your behalf, tribute some amount of ETH to the MolochDAO funding pool, and then have the members vote you in.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*WpGwL5IHroMto1Hq7zpTzA.png" /><figcaption><a href="https://graphcommons.com/graphs/15afce70-0dff-4d65-a59e-4ea8e9b7d62e?auto=true"><em>MolochDAO Beneficiary Graph</em></a><em> </em>presents the “Proposer -&gt; Proposal -&gt; Beneficiary” relationships.<em> Data captured on Aug 12th.</em></figcaption></figure><p>While these are early data points, we have analyzed the MolochDAO proposal activity. To join MolochDAO, an existing member (Proposer) creates a proposal to add an Ethereum account as a member (Beneficiary). The above graph is built based on all the passed proposals using the <em>Proposer -&gt; Proposal -&gt; Beneficiary</em> relationship. So far we observe that the membership growth is centralized, that is, a single account has proposed most new members. Yet from the periphery of the beneficiary graph above we see new member proposals are emerging. In the long run, we may observe a <a href="https://en.wikipedia.org/wiki/Barab%C3%A1si%E2%80%93Albert_model">preferential attachment</a> pattern in the growth of the membership network, where most new members are proposed by the most connected nodes, which further reinforces their influence.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*N684nyLdTd81DXT--jpODQ.png" /><figcaption><a href="https://graphcommons.com/graphs/15afce70-0dff-4d65-a59e-4ea8e9b7d62e?auto=true&amp;show=analysis"><em>The distribution of share ownership</em></a><em> among MolochDAO members.</em></figcaption></figure><p>From the plot of membership shares above we see Vitalik Buterin and Joseph Lubin each have 1000 shares, ten times the voting power of most members. One account (Jez San from FunFair) has 250 shares, 52 accounts have 100 shares, and few accounts have around 10 shares.</p><h3><strong>MolochDAO Voting Turnout</strong></h3><p>The voting activity in MolochDAO is concentrated around the MolochDAO founders, Ethereum Foundation, Consensys, and Fun Fair, meaning they are the most active participants in proposal voting so far.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*pXh-G_5HCqfcP-tQT5k1lg.png" /><figcaption><a href="https://graphcommons.com/graphs/385f320a-63c8-4e6d-98d8-8ab386c0a5ef/selection/358a6623-f7eb-412e-b11e-2807261aa94b?auto=true&amp;show=analysis-cluster"><em>MolochDAO Voting Graph</em></a><em> presents the active clusters in proposal voting. Data captured on Aug 12th, 2019.</em></figcaption></figure><p>The voter turnout rate affects the relative power distribution and security risk. In theory, if Buterin and Lubin both vote NO on a proposal, a minimum of 20 accounts, each with 100 shares voting YES, will be required to counter it. However, given the current turnout rates (max 30%), it is unlikely the remaining members will be able to gather support to oppose a Buterin + Lubin voting block.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*JNTiTxeY_BfUIUcj2HV66w.png" /><figcaption><a href="https://graphcommons.com/graphs/385f320a-63c8-4e6d-98d8-8ab386c0a5ef/selection/358a6623-f7eb-412e-b11e-2807261aa94b?auto=true&amp;show=analysis-cluster"><em>The distribution of voter turnout</em></a><em> across all MolochDAO proposals.</em></figcaption></figure><h3><strong>Adaptive Quorum Biasing for the low voter turnout problem</strong></h3><p>Like MolochDAO, Polkadot uses a token-weighted voting system. However, to counter the low voter turnout problem, Polkadot proposes the <a href="https://medium.com/polkadot-network/a-walkthrough-of-polkadots-governance-486555a056e0">Adaptive Quorum Biasing</a> scheme, in which the supermajority required for a referendum to pass changes as a function of percent voter turnout.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*mdA9xZJ_c3Xv4osx" /><figcaption><a href="https://medium.com/polkadot-network/a-walkthrough-of-polkadots-governance-486555a056e0">Polkadot’s Adaptive Quorum Biasing</a></figcaption></figure><blockquote>A positive turnout bias requires a heavy supermajority of aye votes to carry at low turnouts, but as turnout increases towards 100%, it becomes a simple majority-carries as above. We call this a “positive” turnout bias because the required margin of ayes increases as turnout increases.</blockquote><blockquote>A negative turnout bias requires a heavy supermajority of nay votes to reject at low turnouts, but as turnout increases towards 100%, it becomes a simple majority-carries as above. We call this a “negative” turnout bias because the required margin of nays increases as turnout increases.</blockquote><p>If MolochDAO had an adaptive quorum schema in its voting system, then the low turnout rates around 30% would require higher majority to pass a proposal.</p><h3><strong>Time-lock voting for the token-weighted voting problem</strong></h3><p>To limit the problem of large holders having outsized influence, a common problem in all share-based governance systems, Polkadot introduces the notion of time-lock voting, an approach that allows token holders to increase the weight of their vote by locking their shares for a certain amount of time after voting has ended, trading opportunity cost for increased voting power.</p><blockquote>With this mechanism, a voter with five tokens willing to lock them up only for the minimum allowed duration would have the same number of votes as a voter with only one token happy to have it locked for the maximum amount of time.</blockquote><p>If MolochDAO had time-lock voting, then, even with a low voter turnout, opposing a Vitalik + Lubin voting block (assuming they lock their tokens for the minimum allowed duration) would take the remaining members to lock their shares for the maximum amount of time.</p><h3><strong>Conclusion</strong></h3><p>Although these solutions to the problems of low voter turnout and weighted voting are game-theoretically sound, there are no guarantees in reality. As the number of participants grow and the system increases in complexity, information asymmetry can impede members making sense of, and coordinating around proposals.</p><p>Reducing information asymmetry for members can be achieved by tracking critical metrics, including explanations and visualizations of voting data. Furthermore, <a href="https://twitter.com/arikan/status/1070799595922513920">network topology measurements of on-chain activity could be natively supported in blockchains</a> and integrated into governance mechanisms. In the end, learning from our experience and continuing to improve our social coordination tools in ways that enfranchise and enable a broad community is how we progress toward more equitable governance in decentralized networks.</p><p><em>Data modeling, visualization, and analysis are done using </em><a href="https://graphcommons.com/"><em>Graph Commons</em></a><em>. Data sourced from </em><a href="https://thegraph.com/"><em>TheGraph</em></a><em>.</em></p><p><em>Thanks to </em><a href="https://twitter.com/hxrts"><em>Sam Hart</em></a><em> for conversations and editing which contributed to this post.</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=c28a0b3dd942" width="1" height="1" alt=""><hr><p><a href="https://medium.com/graph-commons/accountability-in-decentralized-networks-the-molochdao-case-c28a0b3dd942">Accountability in decentralized networks: The MolochDAO Case</a> was originally published in <a href="https://medium.com/graph-commons">Graph Commons</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Workshop: Build Your Own Blockchain with Substrate]]></title>
            <link>https://medium.com/graph-commons/workshop-build-your-own-blockchain-with-substrate-5ec8993f290a?source=rss----f5f8dfd35edb---4</link>
            <guid isPermaLink="false">https://medium.com/p/5ec8993f290a</guid>
            <category><![CDATA[polkadot]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[meetup]]></category>
            <category><![CDATA[workshop]]></category>
            <category><![CDATA[substrate]]></category>
            <dc:creator><![CDATA[Burak Arikan]]></dc:creator>
            <pubDate>Fri, 03 May 2019 21:15:39 GMT</pubDate>
            <atom:updated>2019-05-03T21:15:39.376Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*14g4N4XQbiPnRo6gJLYWIA@2x.png" /></figure><p>We are organizing a Substrate workshop with Parity Technologies at New Lab in New York on Sunday May 12th, 2019.</p><p>Substrate is an open-source modular framework for building blockchains, and is the backbone of the upcoming Polkadot network. Substrate provides the means for building high-performance specialized blockchains that can connect to Polkadot, a multi-chain platform that addresses blockchain governance, interoperability, and scalability issues. With Substrate you can develop blockchains without rewriting the fundamentals and benefit from a collection of modules.</p><p>In this workshop, you will learn how to build your first custom blockchain using Substrate. More particularly, you will learn how to build a custom Crypto Collectables “DAppchain” during this live working session. We will walk you through the end-to-end process for setting up your working environment, going through the basics of the run-time development, and finally building a game from the ground up.</p><p>By the end of this workshop, you will have all the tools and knowledge needed to build a custom blockchain using Substrate!</p><p><strong>Workshop is free, and seats are limited, RSVP here:</strong><br><a href="https://www.meetup.com/meetup-group-eEMURxBh/events/261105483/">https://www.meetup.com/meetup-group-eEMURxBh/events/261105483/</a></p><p>The workshop will be followed with a <strong>Polkadot Meetup</strong>, where Polkadot founders and other teams building with Substrate will present. <br><a href="https://www.meetup.com/meetup-group-eEMURxBh/events/261105680/">https://www.meetup.com/meetup-group-eEMURxBh/events/261105680/</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5ec8993f290a" width="1" height="1" alt=""><hr><p><a href="https://medium.com/graph-commons/workshop-build-your-own-blockchain-with-substrate-5ec8993f290a">Workshop: Build Your Own Blockchain with Substrate</a> was originally published in <a href="https://medium.com/graph-commons">Graph Commons</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Design Thinking Blockchains Workshop, Istanbul]]></title>
            <link>https://medium.com/graph-commons/design-thinking-blockchains-workshop-istanbul-ba1b4dab3f3c?source=rss----f5f8dfd35edb---4</link>
            <guid isPermaLink="false">https://medium.com/p/ba1b4dab3f3c</guid>
            <category><![CDATA[türkçe]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[entrepreneurship]]></category>
            <category><![CDATA[workshop]]></category>
            <category><![CDATA[design-thinking]]></category>
            <dc:creator><![CDATA[Burak Arikan]]></dc:creator>
            <pubDate>Tue, 24 Apr 2018 10:07:49 GMT</pubDate>
            <atom:updated>2018-04-30T10:04:00.088Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*BZG1F26W7oHZkndRIhlnqg.png" /></figure><h4>Blockchain teknolojisinin temellerini anlamak ve açtığı yeni fırsatları keşfetmek için bir günlük workshop 5 Mayıs Cumartesi ATÖLYE İstanbul’da.</h4><p><a href="https://graphcommons.com">Graph Commons</a> ve <a href="http://projectinteractions.com/">Project Interactions</a> ekipleri tarafından geliştirilen “Design Thinking Blockchains” metodunun kullanılacağı bir tam günlük workshop <strong>5 Mayıs Cumartesi</strong> günü <a href="https://atolye.io">ATÖLYE</a> ev sahipliğinde gerçekleştirilecek.</p><p>Workshop Başvurusu (yer sınırlıdır):<br><a href="http://bit.ly/design-thinking-blockchains-workshop-tr"><strong>http://bit.ly/design-thinking-blockchains-workshop-tr</strong></a></p><p>Herkes Bitcoin, Ethereum, kriptoparalar, tokenlar ve ICO (“Initial Coin Offering”) ile fonlanmakta olan projeler hakkında konuşuyor. Peki tüm bu projelerin gerçekleşmesini sağlayan blokzincirleri aslında nasıl çalışıyor? Akıllı sözleşmeler, dijital para alışverişinin ötesinde yeni nesil uygulamaları nasıl sağlıyor? Merkezi sistemlerin hakimiyetini kaybedeceği bir dünyada yeni fırsatları keşfetmek için nasıl yaratıcı düşünebilir ve yeni kripto-projeleri geliştirebiliriz?</p><p>Workshop 3 bölümden olıuşuyor:</p><p><strong>1. Kavrayış </strong>— Temel blokzinciri kavramları ve işleyişi görsel anlatımlar, gerçek hayattan örnekler, örnek uygulamalar, ve interaktif araçlar ile adım adım ders olarak konu uzmanları tarafından anlatılacak.</p><p><strong>2. Uygulama</strong>— Katılımcılar gruplar halinde istedikleri bir sektörü yakından inceleyecek, temel aktörleri haritalayarak içgörüler çıkartacak ve gayrimerkeziyet fırsatlarını belirleyecek. Bu aşamada tasarım düşüncesi yöntemleri, paydaş analizi, ağ modelleme, deneyim haritası yöntemlerini birleştiren “Design Thinking Blockchains” metodunu öğrenilecek ve kullanılacak.</p><p><strong>3. Sunumlar &amp; Tartışma</strong> — Her grup kendi çalışmasını sunacak, atölye yürütüclerinden ve katılımcılardan geri bildirimler ile tartışma yapılacak.</p><p>Çalışmanın konuları:</p><ul><li>Gayrimerkeziyetin prensipleri</li><li>Diijtal imzalar</li><li>Kriptografik hash fonksiyonları</li><li>Dağıtık Hesap Defteri Teknolojisi</li><li>“Proof of Work” ve mutabakat mekanizmaları</li><li>Mining ve Validation</li><li>Teşvik modelleri</li><li>Ağ etkileri</li><li>Akıllı sözleşmeler</li></ul><p><strong>Kimler katılmalı</strong></p><ul><li><strong>Girişimciler ya da yeni bir girişim düşünenler.</strong> Trendlerin ötesinde temel yapıları anlamak ve kendi projelerinde blokzinciri kullanmak isteyenler.</li><li><strong>Yatırımcılar ya da yatırımcı olmak isteyenler.</strong> Kirpto-varlıkları borsadaki pazar/fiyat dinamiklerinin ötesinde anlamak ve değerlendirmek isteyenler.</li><li><strong>Yaratıcı düşünen tasarımcı, programcı, ya da iş geliştirenler.</strong> Blokzincirini temelden anlayarak kolları sıvamak isteyenler.</li></ul><p><em>*Blok zinciri ya da programlama konusunda deneyim şart değildir.</em></p><p><strong>Neler öğreneceğiz</strong></p><p>Çalışma katılımcılara blokcinzicir alanında güçlü bir temel, yaratıcı bir vizyon, ve pratik beceriler kazandırmak amacıyla tasarlanmıştır. Bu atölyeden sonra katılımcılar şunlara sahip olacaktır:</p><ul><li>Blokzinciri teknolojisinin nasıl çalıştığını kavramak.</li><li>Kendi alanında gayri-merkeziyetin etkilerini anlamak ve tespit edebilmek.</li><li>Design thinking yöntemlerini blokzinciri ile uygulayarak gayri-merkezi sistemler modellemek ve analiz etmek.</li><li>Yeni bir kripto-varlık ya da blokzinciri uygulaması kurgulamayı adım adım yapabilmek.</li><li>Gelecekte blokzinciri ile geliştirilen yeni uygulamaları gürültünün arasından görebilmek, anlamak ve konumlandırabilmek.</li></ul><p><strong>Yer, Tarih, Süre ve Kayıt</strong></p><p>5 Mayıs Cumartesi 10:00–18:00</p><p>ATÖLYE</p><p>Adres: Tarihi Bomonti Bira Fabrikası Silahşör Cad. Birahane Sok. No: 1 Şişli, İstanbul</p><p>Workshop ücreti kişi başı 350 TL, öğrenciler için 150 TL (KDV dahil)</p><p><em>*Katılımcı kontenjanı 60 kişi ile sınırlı olup, öncelikli işlem esasına göre kontenjan imkânı verilecektir.</em></p><p><em>*Blok zinciri ya da programlama konusunda deneyim şart değildir.</em></p><p><em>*ATÖLYE’de çay, kahve ve atıştırma servisi olacaktır.</em></p><p><em>*Workshop dili Türkçe olacaktır.</em></p><p>Workshop başvurusu:<br><a href="http://bit.ly/design-thinking-blockchains-workshop-tr"><strong>http://bit.ly/design-thinking-blockchains-workshop-tr</strong></a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=ba1b4dab3f3c" width="1" height="1" alt=""><hr><p><a href="https://medium.com/graph-commons/design-thinking-blockchains-workshop-istanbul-ba1b4dab3f3c">Design Thinking Blockchains Workshop, Istanbul</a> was originally published in <a href="https://medium.com/graph-commons">Graph Commons</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Design Thinking for Blockchains Workshop]]></title>
            <link>https://medium.com/graph-commons/design-thinking-for-blockchains-workshop-113bb780a7f7?source=rss----f5f8dfd35edb---4</link>
            <guid isPermaLink="false">https://medium.com/p/113bb780a7f7</guid>
            <category><![CDATA[design-thinking]]></category>
            <category><![CDATA[bitcoin]]></category>
            <category><![CDATA[cryptocurrency]]></category>
            <category><![CDATA[workshop]]></category>
            <category><![CDATA[blockchain]]></category>
            <dc:creator><![CDATA[Graph Commons]]></dc:creator>
            <pubDate>Thu, 15 Feb 2018 22:06:21 GMT</pubDate>
            <atom:updated>2018-04-16T13:49:49.153Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*6fQGODYLmGqbZjYonmsxTA.png" /></figure><h4>Understand the fundamentals of blockchain technology and explore its radical potential for new opportunities. Sunday, March 4, New Lab, Brooklyn, NY</h4><p>One-day workshop, co-hosted by <a href="https://graphcommons.com">Graph Commons</a> and <a href="http://projectinteractions.com/">Project Interactions</a>, on creative and critical use of blockchain technology and what it means for entrepreneurial minds, curious investors, and creators. How do blockchains <em>actually</em> work to achieve decentralization? How do smart contracts enable new generation of applications beyond digital money exchange? How do we think and build creatively to explore new opportunities in a world after decentralization?</p><p>Register for the workshop here (limited seats): <br><a href="http://bit.ly/blockchain-design-thinking-workshop">http://bit.ly/blockchain-design-thinking-workshop</a></p><p>The workshop will be conducted in three parts:</p><ol><li><strong>Understand</strong> — We will start with a lecture introducing the core blockchain ideas through step-by-step visual explanations and real-world examples. We will provide interactive tools for participants to reinforce their understanding of complex concepts.</li><li><strong>Create</strong> — We will divide into smaller groups and facilitate a rapid deep-dive into selected domains to extract insights and identify decentralization opportunities. We will utilize hands-on design thinking methods including user/stakeholder analysis, network modelling, journey mapping, and brainstorming.</li><li><strong>Present &amp; Discuss</strong> — We will conclude with each group presenting their work, feedback from facilitators and discussion with all participants.</li></ol><p>Topics include:</p><ul><li>Principles of Decentralization</li><li>Digital Signatures</li><li>Cryptographic Hash Functions</li><li>Distributed Ledger Technology</li><li>Proof of Work</li><li>Mining / Validation</li><li>Consensus Mechanisms</li><li>Incentive Models</li><li>Network Effects</li><li>Smart Contracts</li></ul><p><em>* No programming or prior blockchain experience required.</em><br><em>* Morning coffee and lunch will be available.</em></p><p><strong>Who should attend</strong></p><ul><li><strong>Entrepreneurial minds</strong>, who think beyond the hype and are interested in building a systemic perspective to start projects or organizations in their domains.</li><li><strong>Curious investors</strong>, who would like to build a foundational understanding of crypto assets beyond stock market dynamics to inform their investment aspirations.</li><li><strong>Creative technologists</strong>, designers, developers, and hackers who are looking for a well-grounded starting point to get their hands dirty.</li></ul><p><strong>What will you learn</strong></p><p>We designed the workshop to help participants establish a strong foundation, a creative perspective, and practical methods. After this workshop, you will be able to:</p><ul><li>Identify the implications of decentralization that are most relevant to you.</li><li>Hypothesize the impact of blockchains on your life, expertise, and business domain in an informed way.</li><li>Apply hands-on design thinking methods to model and analyze decentralized systems.</li><li>See through the hype/noise around blockchains and learn to process upcoming innovations.</li><li>Walk through the steps for envisioning a new crypto asset / blockchain application.</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*sDJRsCjKZ4KMlSZLPm-4rA.jpeg" /></figure><p><strong>Venue</strong></p><p>The workshop will take place in <a href="https://newlab.com/">New Lab</a>, a creative technology hub in Brooklyn Navy Yard, whose residents include entrepreneurs in AI, connected devices, nanotechnology, robotics, urban tech, and more.</p><p><strong>Design Thinking for Blockchains Workshop<br></strong>Sunday, March 4th, 2018 <br>New Lab, Brooklyn, NY</p><p>Register for the workshop here (limited seats): <br><a href="http://bit.ly/blockchain-design-thinking-workshop">http://bit.ly/blockchain-design-thinking-workshop</a></p><p>We’d love to hear your feedback, let us know if you have any questions or comments at <a href="mailto:contact@graphcommons.com">workshop@graphcommons.com</a>.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=113bb780a7f7" width="1" height="1" alt=""><hr><p><a href="https://medium.com/graph-commons/design-thinking-for-blockchains-workshop-113bb780a7f7">Design Thinking for Blockchains Workshop</a> was originally published in <a href="https://medium.com/graph-commons">Graph Commons</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[One activity feed for everyone]]></title>
            <link>https://medium.com/graph-commons/one-activity-feed-for-everyone-9569e386ac2a?source=rss----f5f8dfd35edb---4</link>
            <guid isPermaLink="false">https://medium.com/p/9569e386ac2a</guid>
            <category><![CDATA[data-visualization]]></category>
            <category><![CDATA[civictech]]></category>
            <category><![CDATA[big-data]]></category>
            <category><![CDATA[data-science]]></category>
            <category><![CDATA[social-media]]></category>
            <dc:creator><![CDATA[Graph Commons]]></dc:creator>
            <pubDate>Tue, 23 Jan 2018 16:44:44 GMT</pubDate>
            <atom:updated>2018-01-23T17:17:04.547Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*5mWD7If8ayz8YWHSakyhug.jpeg" /></figure><p>Each day <a href="https://graphcommons.com">Graph Commons</a> members map data-networks about a variety of topics. This activity is highly creative and fundamentally different than traditional network science use cases (e.g., fraud analysis, security intelligence, social networks). We’ve been curating our homepage to highlight some of these inspiring data projects ranging from the <a href="https://graphcommons.com/graphs/ee4a43a2-3189-4f82-879c-960344332ea6">mapping of Trump’s cabinet</a>, to <a href="https://graphcommons.com/graphs/bce3e757-6529-4148-a3f9-3c83167c109d">partnerships on energy corridors</a>, to <a href="https://medium.com/graph-commons/analyzing-the-npm-dependency-network-e2cf318c1d0d">dependencies of software packages</a>, to <a href="https://graphcommons.com/getartistspaid">power relations in the art world</a>. However, this activity has been more intense than we can keep up with.</p><p>Today, we are excited to announce the feed, displaying recent activities on Graph Commons. Within the feed, you can easily engage with graphs or stories that spark your interest: explore and share nodes, start a conversation by adding a comment, or simply click ‘recommend’ to express your support for creators. As you scroll down the feed, you will be inspired by the creative possibilities of network data mapping.</p><p>In most social media, activity feeds are arranged to capture a larger portion of your attention real-estate<em> </em>in order to maximize advertising revenue. The algorithms control what you see, creating filter bubbles. On Graph Commons, the feed displays all public activities ordered chronologically, for everyone in the same order. There is no black-box algorithm behind the scenes optimized for your attention. It’s <a href="https://graphcommons.com">one activity feed for everyone</a>.</p><p>For paid plans, the activity around your private graphs will be visible only to you and your collaborators.</p><p>We hope that you will spend some time browsing these graphs and creating new ones. Feel free to share anything you create or find.</p><p>In addition to the activity feed, we’ve released the following new features.</p><h3>Secondary node labels</h3><p>You can display a key node property along with the node name to make your graph more informative at first glance. For example, if your nodes have “year” property, you can display them along with the node name.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*dbwFukJDuYvW6IdnEiRLDQ.png" /><figcaption>In Carto Panel, “Year” property is set as the secondary display name, rendering “2013&quot; below the node name.</figcaption></figure><h3>Custom edge names</h3><p>You can distinguish the edges from one another by displaying a custom property of the edge. For example, your edge type could be labeled as “AFFILIATED” while it may also have “role” properties as “Board member”, “Advisor”, “Investor”. You can choose it as the rendered display name.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*iBvXi10EQq7dWvw9o90nRA.png" /><figcaption>In the Carto Panel, “Role” property is set as the display name for the edge type “AFFILIATED”.</figcaption></figure><h3>Node hover card</h3><p>While browsing the nodes on a graph, you may want to get more information about a node at a glance. So, when you wait on a node for a few seconds, a hover card displays the image and description of the node.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*RaVfTnHFiGMAog1bU00MLg.png" /></figure><p>Follow <a href="https://twitter.com/graphcommons">@graphcommons</a> on Twitter, read <a href="https://medium.com/graph-commons">our journal</a>, join our <a href="https://graphcommons.com/slack">Slack chat channel</a> for discussions. We’d love to hear your feedback at <a href="mailto:contact@graphcommons.com">contact@graphcommons.com</a>.</p><p><em>Photo: </em><a href="http://www.flickr.com/photos/x-ray_delta_one/3816770796/"><em>1963… lady, bubble, river — Melvin Sokolovsky</em></a><em> by James Vaughan. Reproduced under a Creative Commons (CC) License.</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=9569e386ac2a" width="1" height="1" alt=""><hr><p><a href="https://medium.com/graph-commons/one-activity-feed-for-everyone-9569e386ac2a">One activity feed for everyone</a> was originally published in <a href="https://medium.com/graph-commons">Graph Commons</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Finding organic clusters in complex data-networks]]></title>
            <link>https://medium.com/graph-commons/finding-organic-clusters-in-your-complex-data-networks-5c27e1d4645d?source=rss----f5f8dfd35edb---4</link>
            <guid isPermaLink="false">https://medium.com/p/5c27e1d4645d</guid>
            <category><![CDATA[data-science]]></category>
            <category><![CDATA[network-science]]></category>
            <category><![CDATA[machine-learning]]></category>
            <category><![CDATA[storytelling]]></category>
            <category><![CDATA[design]]></category>
            <dc:creator><![CDATA[Graph Commons]]></dc:creator>
            <pubDate>Tue, 17 Oct 2017 16:17:56 GMT</pubDate>
            <atom:updated>2017-10-18T16:13:48.938Z</atom:updated>
            <content:encoded><![CDATA[<p>A common task for a data scientist is to identify clusters in a given data set. The idea is to simply find groups of objects that have more connections or similarities to one another than they do to outsiders. In the study of networks, we use clustering to recognize communities within large groups of connections.</p><p>Typically, a force-directed layout algorithm organizes a network map, makes patterns visually comprehensible, but it cannot identify and mark the clusters. Furthermore, in large network maps, the high level of detail overwhelms our senses. To be able to precisely examine its patterns, we need quantitative views of the data contained in the network. While there are a variety of data clustering methods in machine learning, the <a href="https://en.wikipedia.org/wiki/Louvain_Modularity">Louvain Modularity</a> algorithm works well particularly for large data-networks. It detects tightly knit groups characterized by a relatively high density of ties. Beyond the visual realm, you can use a Louvain clustering algorithm to partition a many million-node online social network onto different machines.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/600/1*TD5wvDU0iFgIm1gqmJ3fKA.gif" /><figcaption>Clustering the network map of an ecosystem in <a href="https://graphcommons.com">Graph Commons</a></figcaption></figure><p>Once the network clusters are detected, the identified groups of nodes can be given distinct color and names, so they are clearly differentiated and together provide a summary of the larger network. We can label a cluster based on the commonalities of its nodes or the most central nodes found in the grouping.</p><p>In <a href="https://graphcommons.com">Graph Commons</a>, you can use clustering on your data-networks using the Analysis bar. You first click on the “Run Clustering” button, then set the resolution of how much granular clusters the algorithm should identify. Once the clusters are found, they are automatically labelled based on the most connected node in the cluster. However, we strongly recommend that you to rename these communities yourself to highlight what these communities specify in your context. Finally, you can view the list of all the nodes that belongs to a certain cluster and download it as a CSV file.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*VUVEdOsje-sNgC-lvQimvA.gif" /><figcaption>Clustering the network map of <a href="https://graphcommons.com/graphs/21cc69ad-86d7-489d-99ac-524a3aeb15b8">Istanbul Creative Hubs</a>.</figcaption></figure><h4>Cluster labels on the network map</h4><p>In Graph Commons, you’ll notice the cluster labels are also placed on the map visually. You can move them around and change their size in order to make the network more readable.</p><p>When you mouse over a cluster label, it will be highlighted, this way you can clearly see its boundaries and where it is located the larger picture. Cluster labels on the map provide an overview for a complex network that is otherwise hard to grasp visually.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1014/1*huqDS6D5nbpNl6RiBItYnQ.png" /></figure><h4>Bridges between clusters</h4><p>Within the clusters of a complex network, we often see few nodes making connections to other clusters besides their neighbouring nodes, whose connections are only local, within their immediate cluster. Those nodes that are bridging connections among multiple clusters have high betweenness centrality. Such bridging nodes between two or more clusters become distinctly visible with the help of the network layout algorithms.</p><p>If we are analyzing a social network, these bridging people are well-positioned to be information brokers, since they have access to information flowing in other clusters. They are the ones who carry the gossip from one group of people to another. They are in a position to combine variety of knowledge and ideas found in multiple groups. On the other hand, bridging nodes have more likelihood of being a single point of failure. If a bridge person disappears, those formerly connected communities would disconnect.</p><h4>Telling stories with network clusters</h4><p>A network map is a powerful medium to visualize and analyze relations at scale. It doesn’t present a single story, but a world with multiple possible narratives. At first glance, a giant hair-ball of a network can be, for the non-expert, confusing, intimidating, or just illegible. Not everyone has the facility to read a network map and use algorithmic interfaces to filter and navigate. So we created the <a href="https://medium.com/graph-commons/introducing-stories-for-graphs-58f184254480">Stories feature on Graph Commons</a>, to allow you to tell simple interactive narratives from complex data maps.</p><p>You can use cluster views in your stories to narrate interesting patterns in your data, through a visual interface that mimics the movements of a camera across your graph. Beginning with the familiar narrative flow of a story, you can reach more people, and introduce them to the tools that will allow them to engage with your data.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Ndfdh_4b4SeirSpto01-8Q.png" /><figcaption>Sharing and commenting a network map on Graph Commons. <a href="https://graphcommons.com/graphs/8da5327d-7829-4dfe-b60b-4c0bda956b2a?show=share&amp;auto=true">Try it yourself</a>.</figcaption></figure><h4>Sharing your cluster analysis</h4><p>The goal of Graph Commons is to support quality data publishing, in addition to intuitive mapping and analysis of data networks, so we developed <a href="https://medium.com/graph-commons/sharing-graphs-has-never-been-easier-434f1502c7fa">features to annotate and share your network maps</a>. You can add visual annotations to any public graph, deep-link to your findings, and share them as rich social media posts. When you share, people come and provide feedback and generate new discussions around your work.</p><p>Sharing cluster-view of your network map often generates the most feedback, because your audience may not be familiar with the particular data points you have, but when they see the cluster labels, it makes sense and they start engaging with your work.</p><p>Clustering is a powerful method for analysis and story telling with your data. You can use Graph Commons to apply clustering in your data-networks and make sense of the complex issues that matters to you and to your communities.</p><p>We welcome feedback on your experience on using Graph Commons. Please send your thoughts to <a href="mailto:contact@graphcommons.com">contact@graphcommons.com</a>. Follow <a href="https://twitter.com/graphcommons">@graphcommons</a>, read <a href="https://medium.com/graph-commons">our journal</a>, join our <a href="https://graphcommons.com/slack">Slack chat channel</a>.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5c27e1d4645d" width="1" height="1" alt=""><hr><p><a href="https://medium.com/graph-commons/finding-organic-clusters-in-your-complex-data-networks-5c27e1d4645d">Finding organic clusters in complex data-networks</a> was originally published in <a href="https://medium.com/graph-commons">Graph Commons</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Workshop: Creative and Critical Use of Complex Networks]]></title>
            <link>https://medium.com/graph-commons/workshop-creative-and-critical-use-of-complex-networks-c62691f368bd?source=rss----f5f8dfd35edb---4</link>
            <guid isPermaLink="false">https://medium.com/p/c62691f368bd</guid>
            <category><![CDATA[civictech]]></category>
            <category><![CDATA[data-science]]></category>
            <category><![CDATA[social-network-analysis]]></category>
            <category><![CDATA[open-data]]></category>
            <category><![CDATA[data-visualization]]></category>
            <dc:creator><![CDATA[Burak Arikan]]></dc:creator>
            <pubDate>Mon, 16 Oct 2017 15:15:30 GMT</pubDate>
            <atom:updated>2017-10-16T16:19:37.947Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*uITxoVhXoI8GSA0yUrqnVQ.jpeg" /></figure><p>Saturday Oct 21, 2017 4pm–7pm<br><strong>Radical Networks<br></strong>315 Ten Eyck St, Brooklyn, NY</p><p>Workshop tickets: Full price $25 Students $17.50<br><a href="https://www.eventbrite.com/e/radical-networks-tickets-38618435781">https://www.eventbrite.com/e/radical-networks-tickets-38618435781</a></p><p>We are organizing a network mapping workshop at the <a href="http://radicalnetworks.org/">Radical Networks</a> conference on Oct 21st. Radical Networks is a community conference &amp; arts festival for creative, critical, and alternative applications of Internet technology.</p><p>This workshop focuses on the use of complex networks through mapping and analysis in order to expand your thinking about the network as a creative and critical medium. You will start from hands-on drawing exercises and gradually build complex compositions using the <a href="https://graphcommons.com">Graph Commons</a> platform for collaborative mapping, analyzing, and publishing data-networks. The workshop asks how to extract models from complex systems, how to read those networks with methods such as centrality and cluster analysis, and also includes practice-based work sketching diagrams, editing graph data, and more. As a workshop participant, you will gain creative skills for modeling and analyzing networks, raise new questions and explore answers with your complex data, which would then inform your decisions.</p><p>Please bring your laptop!</p><p>This workshop is organized by <a href="https://burak-arikan.com">Burak Arikan</a> &amp; <a href="http://zeynoustun.com/">Zeyno Ustun</a>.</p><p>View the <a href="https://blog.graphcommons.com/workshops/">Workshop Archive</a> for past participants’ work.</p><p>View the <a href="http://radicalnetworks.org/program">Radical Networks conference program</a>.</p><h4><strong>About Graph Commons</strong></h4><p>Graph Commons is a collaborative platform for mapping, analyzing and publishing data-networks. It empowers people and organizations to transform their data into interactive maps and untangle complex relations that impact them and their communities. Graph Commons members have been using the platform for data research, investigative journalism, strategizing, organizational analysis, civic activism, archival exploration, and art curating.</p><p>For any questions or comments <a href="mailto:contact@graphcommons.com">contact@graphcommons.com</a>. Follow <a href="https://twitter.com/graphcommons">@graphcommons</a> on Twitter, <a href="https://medium.com/u/b5efaa0f77b4">Graph Commons</a> on Medium, join our chat channel on <a href="https://graphcommons.com/slack">Slack</a>.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=c62691f368bd" width="1" height="1" alt=""><hr><p><a href="https://medium.com/graph-commons/workshop-creative-and-critical-use-of-complex-networks-c62691f368bd">Workshop: Creative and Critical Use of Complex Networks</a> was originally published in <a href="https://medium.com/graph-commons">Graph Commons</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Introducing Stories for Graphs]]></title>
            <link>https://medium.com/graph-commons/introducing-stories-for-graphs-58f184254480?source=rss----f5f8dfd35edb---4</link>
            <guid isPermaLink="false">https://medium.com/p/58f184254480</guid>
            <category><![CDATA[journalism]]></category>
            <category><![CDATA[civictech]]></category>
            <category><![CDATA[open-data]]></category>
            <category><![CDATA[storytelling]]></category>
            <category><![CDATA[big-data]]></category>
            <dc:creator><![CDATA[Graph Commons]]></dc:creator>
            <pubDate>Sun, 25 Jun 2017 17:56:37 GMT</pubDate>
            <atom:updated>2017-06-25T18:13:12.131Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Qj27lRoiHEX8VjhM6dvQnA.gif" /></figure><p>We are excited to announce a new feature, <a href="https://graphcommons.com/stories">Stories on Graph Commons</a>.</p><p>A network map, or a graph, is a powerful medium to visualize and analyze relations at scale. It doesn’t present a single story, but multiple possible narratives. At first glance, a giant hair-ball of a graph can be, for the non-expert, confusing, intimidating, or just illegible. Not everyone has the facility to read a network map and use algorithmic interfaces to filter and navigate. So we created the Stories feature, to allow you to tell simple narratives from complex data maps.</p><p>As of today, you can start creating interactive slideshows to tell dynamic stories from your graphs. You can narrate interesting patterns, actors, paths and clusters in your data, through a visual interface that mimics the movements of a camera across your graph. Beginning with the familiar narrative flow of a story, you can reach more people, and introduce them to the tools that will allow them to engage with your graphs. It looks great on mobile browsers too!</p><p>Explore the stories below and <a href="https://graphcommons.com/me">try the interactive tutorial</a> to begin making your own stories.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/768/1*PxH7isoxbiU2jV3rl97U-g.jpeg" /><figcaption><a href="https://graphcommons.com/stories/cd2c6279-2dbc-4ea9-b746-033d45ea9a02">NGO responses to the climate change policies in Europe</a></figcaption></figure><h3><a href="https://graphcommons.com/stories/cd2c6279-2dbc-4ea9-b746-033d45ea9a02"><strong>NGO responses to the climate change policies in Europe</strong></a></h3><p>Who is opposing or supporting the EU climate change policies. <br>8-slide story by SIMPOL Project, Financial Systems Simulation &amp; Policy Modelling at University of Zurich.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/960/1*DPadJ_sE2VQVGPgFOpasKQ.jpeg" /><figcaption><a href="https://graphcommons.com/stories/1f1ee53b-86d2-46da-a194-444b82bb769f">ATÖLYE’s multidisciplinary community curation</a></figcaption></figure><h3><a href="https://graphcommons.com/stories/1f1ee53b-86d2-46da-a194-444b82bb769f">ATÖLYE’s multidisciplinary community curation</a></h3><p>Sector-based curation that enhances creative production amongst our community. 9-slide story by ATÖLYE, Transdisciplinary Innovation Platform in Istanbul.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/600/1*ndMskkG3xuflPeqOBBk_vg.jpeg" /><figcaption><a href="https://graphcommons.com/stories/0ff1cce8-7f5b-4111-936a-ba5e2aa1a446">The power broker of the Erdogan family</a></figcaption></figure><h3><a href="https://graphcommons.com/stories/0ff1cce8-7f5b-4111-936a-ba5e2aa1a446">The power broker of the Erdogan family</a></h3><p>Erdogan’s brother-in-law ties the family to the Azeri SOCAR conglomerate. 11-slide story by L’Espresso Magazine, Italy’s prominent weekly and Italian partner of ICIJ.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*k7JOlOtsHw16s3ERevkO1A.png" /><figcaption><a href="https://graphcommons.com/stories/8de49ba6-68b4-4d8b-af6b-6336e7520742">Major ISIS attacks in Turkey</a></figcaption></figure><h3><a href="https://graphcommons.com/stories/8de49ba6-68b4-4d8b-af6b-6336e7520742">Major ISIS attacks in Turkey</a></h3><p>This story tracks the major attacks committed by ISIS from among the 88 attacks by 9 different terror organizations since 2011. 5-slide story by 140journos, new media journalism from Turkey.</p><p>We welcome feedback on your experience. Please send your thoughts to <a href="mailto:contact@graphcommons.com">contact@graphcommons.com</a>. Follow <a href="https://twitter.com/graphcommons">@graphcommons</a>, read <a href="https://medium.com/graph-commons">our journal</a>, join our <a href="https://graphcommons.com/slack">Slack chat channel</a> for discussions.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=58f184254480" width="1" height="1" alt=""><hr><p><a href="https://medium.com/graph-commons/introducing-stories-for-graphs-58f184254480">Introducing Stories for Graphs</a> was originally published in <a href="https://medium.com/graph-commons">Graph Commons</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Sharing graphs has never been easier]]></title>
            <link>https://medium.com/graph-commons/sharing-graphs-has-never-been-easier-434f1502c7fa?source=rss----f5f8dfd35edb---4</link>
            <guid isPermaLink="false">https://medium.com/p/434f1502c7fa</guid>
            <category><![CDATA[data-visualization]]></category>
            <category><![CDATA[social-media]]></category>
            <category><![CDATA[journalism]]></category>
            <category><![CDATA[data-science]]></category>
            <category><![CDATA[social-network]]></category>
            <dc:creator><![CDATA[Burak Arikan]]></dc:creator>
            <pubDate>Thu, 06 Apr 2017 16:58:29 GMT</pubDate>
            <atom:updated>2019-05-03T20:11:27.672Z</atom:updated>
            <content:encoded><![CDATA[<p>We are excited to announce the <strong>new sharing experience on Graph Commons</strong>.</p><p>Graph Commons is a collaborative platform for mapping, analyzing and publishing data networks. It empowers people and organizations to transform their data into interactive maps and untangle complex relations that impact them and their communities. Whether you use data mapping for investigative journalism, archival exploration, or content curating you’d want to have your audience engage with your published data. The goal of Graph Commons is to support quality data publishing, in addition to intuitive mapping and analysis of data networks, so we hope that this new sharing feature flourishes meaningful discussions around your work.</p><p>As of today, you can add visual annotations to any public graph, deep-link to your findings from rich social media posts, and make high resolution prints.</p><h3>Comment with a view</h3><p>Select an area on the graph and add your thoughts. Give feedback, share links, and generate new discussions.</p><p><em>Tip: In a comment, use # to reference nodes and @ to mention members.</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Ndfdh_4b4SeirSpto01-8Q.png" /><figcaption><a href="https://graphcommons.com/graphs/8da5327d-7829-4dfe-b60b-4c0bda956b2a?show=share&amp;auto=true">Try the sharing feature on the graph “Discover IoT Initiatives”</a></figcaption></figure><p>Graph comments, listed on the right bar, are commonly used for giving feedback, sharing links, and flourishing new discussions. Comments with captured images are useful for annotating the graph. Again, you can mention (@ sign) other users and provide linked references (with # sign) to nodes on the graph.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*HOHLDwnfViwqLQcIecklGQ.png" /><figcaption><a href="https://graphcommons.com/graphs/a5f158c2-9d58-4745-9fe5-97bc9d86dac4?show=share&amp;auto=true">View comments on the graph “Syrian Refugees and NGOs in Turkey”</a></figcaption></figure><h3>High resolution prints</h3><p>Download your selection or the entire graph as a PDF file to make beautiful posters. It enables you to print high resolution images, so a giant graph that does not fit to your LCD screen can be printed on a large canvas.</p><p><em>Tip: Open the PDF file in a design tool to modify for your needs.</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*mVmwoXC82JB6dtO0EgAq-A.jpeg" /><figcaption>Photograph of the <a href="http://graphcommons.com/hubs/mulksuzlestirme">Networks of Dispossession</a> wall print at the MAXXI Museum in Rome. The print file is generated using <a href="https://graphcommons.com">Graph Commons</a>.</figcaption></figure><h3>Deep-linking to nodes</h3><p>Select a node and share its link. Your audience will directly land on the shared node highlighted on the graph.</p><p><em>Tip: Shift+drag to select a group of nodes.</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*N5SCntxr-pU19bu_Lmr0Lg.png" /><figcaption><a href="https://graphcommons.com/graphs/ee4a43a2-3189-4f82-879c-960344332ea6/selection/8681a7ef-fae1-4650-a8b0-3e01f2ad3e09?auto=true">Open the Rex Tillerson node card in the “Trump Network”</a></figcaption></figure><p>Deep-linking allows you directly reference any node in a graph using its permalink, which is displayed on your browser address bar when you click on a node.</p><h3>Rich social media posts</h3><p>Instantly share a compelling argument supported by graph data, automatically displayed as a rich social media card on Twitter and Facebook.</p><p><em>Tip: Embed an interactive graph on Medium by pasting its URL into your post.</em></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/508/1*I9AKhmdTi4sEBR19P8Yp6Q.png" /><figcaption>Shared graph comment on Twitter Card Validator</figcaption></figure><p>We hope the new sharing experience generates meaningful discussions around your data maps. We welcome feedback on your experience, it will help us refine the platform further for everybody. Please send all suggestions, questions and comments to <a href="mailto:contact@graphcommons.com">contact@graphcommons.com</a> we’d love to hear from you.</p><p>Follow <a href="https://twitter.com/graphcommons">@graphcommons</a> on Twitter for a daily dose of network arts and sciences, read <a href="https://medium.com/graph-commons">our publication on Medium</a>, join our <a href="https://graphcommons.com/slack">Slack chat channel</a> for discussions.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=434f1502c7fa" width="1" height="1" alt=""><hr><p><a href="https://medium.com/graph-commons/sharing-graphs-has-never-been-easier-434f1502c7fa">Sharing graphs has never been easier</a> was originally published in <a href="https://medium.com/graph-commons">Graph Commons</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>