<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Annenberg Networks Network &#187; Add new tag</title>
	<atom:link href="http://ascnetworksnetwork.org/tag/add-new-tag/feed" rel="self" type="application/rss+xml" />
	<link>http://ascnetworksnetwork.org</link>
	<description>ascnetworksnetwork.org</description>
	<lastBuildDate>Wed, 01 Feb 2012 22:24:33 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Hot off the press: Distinguishing Influence Based Contagion from Homophily Driven Diffusion in Dynamic Networks</title>
		<link>http://ascnetworksnetwork.org/hot-off-the-press-distinguishing-influence-based-contagion-from-homophily-driven-diffusion-in-dynamic-networks</link>
		<comments>http://ascnetworksnetwork.org/hot-off-the-press-distinguishing-influence-based-contagion-from-homophily-driven-diffusion-in-dynamic-networks#comments</comments>
		<pubDate>Tue, 26 Jan 2010 23:07:58 +0000</pubDate>
		<dc:creator>Cindy</dc:creator>
				<category><![CDATA[Hot off the presses]]></category>
		<category><![CDATA[Add new tag]]></category>
		<category><![CDATA[Chat]]></category>
		<category><![CDATA[InstantMessaging]]></category>
		<category><![CDATA[Social Network]]></category>

		<guid isPermaLink="false">http://ascnetworksnetwork.org/?p=585</guid>
		<description><![CDATA[&#8220;Distinguishing Influence Based Contagion from Homophily Driven Diffusion in Dynamic Networks&#8221; PNAS
Sinan Aral, Lev Muchnik andArun Sundararajan
ABSTRACT:

&#8220;Node characteristics and behaviors are often correlated with the structure of social networks over time. While evidence of this type of assortative mixing and temporal clustering of behaviors among linked nodes is used to support claims of peer influence [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.pnas.org/content/106/51/21544.short">&#8220;Distinguishing Influence Based Contagion from Homophily Driven Diffusion in Dynamic Networks&#8221; <em>PNAS</em></a></p>
<p>Sinan Aral, Lev Muchnik andArun Sundararajan</p>
<p>ABSTRACT:</p>
<blockquote>
<p style="text-align: justify;">&#8220;Node characteristics and behaviors are often correlated with the structure of social networks over time. While evidence of this type of assortative mixing and temporal clustering of behaviors among linked nodes is used to support claims of peer influence and social contagion in networks, homophily may also explain such evidence. Here we develop a dynamic matched sample estimation framework to distinguish influence and homophily effects in dynamic networks, and we apply this framework to a global instant messaging network of 27.4 million users, using data on the day-by-day adoption of a mobile service application and users’ longitudinal behavioral, demographic, and geographic data. We find that previous methods overestimate peer influence in product adoption decisions in this network by 300–700%, and that homophily explains 50% of the perceived behavioral contagion. These findings and methods are essential to both our understanding of the mechanisms that drive contagions in networks and our knowledge of how to propagate or combat them in domains as diverse as epidemiology, marketing, development economics, and public health.&#8221;</p>
</blockquote>
<div class="zemanta-pixie" style="margin-top: 10px; height: 15px;"><a class="zemanta-pixie-a" title="Reblog this post [with Zemanta]" href="http://reblog.zemanta.com/zemified/94ccfcd8-ff61-4ead-8108-b3cb0dd15d21/"><img class="zemanta-pixie-img" style="border: medium none; float: right;" src="http://img.zemanta.com/reblog_e.png?x-id=94ccfcd8-ff61-4ead-8108-b3cb0dd15d21" alt="Reblog this post [with Zemanta]" /></a><span class="zem-script more-related pretty-attribution"><script src="http://static.zemanta.com/readside/loader.js" type="text/javascript"></script></span></div>
]]></content:encoded>
			<wfw:commentRss>http://ascnetworksnetwork.org/hot-off-the-press-distinguishing-influence-based-contagion-from-homophily-driven-diffusion-in-dynamic-networks/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Facebook PhD Research Fellowships</title>
		<link>http://ascnetworksnetwork.org/facebook-phd-research-fellowships</link>
		<comments>http://ascnetworksnetwork.org/facebook-phd-research-fellowships#comments</comments>
		<pubDate>Sun, 17 Jan 2010 20:35:33 +0000</pubDate>
		<dc:creator>Katya O.</dc:creator>
				<category><![CDATA[News from the Network]]></category>
		<category><![CDATA[Add new tag]]></category>
		<category><![CDATA[Cloud computing]]></category>
		<category><![CDATA[Data mining]]></category>
		<category><![CDATA[facebook]]></category>
		<category><![CDATA[fellowship]]></category>
		<category><![CDATA[Game theory]]></category>
		<category><![CDATA[Social Network]]></category>

		<guid isPermaLink="false">http://ascnetworksnetwork.org/?p=558</guid>
		<description><![CDATA[The  Facebook team shows commitment to academic research through a fellowship program for doctoral students.  This may turn into a particularly interesting project if  in addition to funding, the fellows also get access to the vast amount of data residing on the company&#8217;s servers.
 Facebook Fellowship Program
Every day Facebook confronts the most complex technical problems [...]]]></description>
			<content:encoded><![CDATA[<p>The  Facebook team shows commitment to academic research through a fellowship program for doctoral students.  This may turn into a particularly interesting project if  in addition to funding, the fellows also get access to the vast amount of data residing on the company&#8217;s servers.</p>
<blockquote><p><a href="http://www.facebook.com/careers/fellowship.php"> <strong>Facebook Fellowship Program</strong></a></p>
<p style="text-align: justify;">Every day Facebook confronts the most complex technical problems and we believe that close relationships with the academy will enable us to address many of these problems at a fundamental level and solve them. As part of our ongoing commitment to academic relations, we are pleased to announce the creation of the Facebook Fellowship program to support graduate students in the 2010-2011 school year.</p>
<p style="text-align: justify;"><span id="more-558"></span></p>
<p>We are interested in a wide range of academic topics, including the following topical areas:</p>
<p>* Internet Economics: auction theory and algorithmic game theory relevant to online advertising auctions.<br />
* <a class="zem_slink" title="Cloud computing" rel="wikipedia" href="http://en.wikipedia.org/wiki/Cloud_computing">Cloud Computing</a>: storage, databases, and optimization for computing in a massively distributed environment.<br />
* Social Computing: models, algorithms and systems around social networks, social media, social search and collaborative environments.<br />
* <a class="zem_slink" title="Data mining" rel="wikipedia" href="http://en.wikipedia.org/wiki/Data_mining">Data Mining</a> and Machine Learning: learning algorithms, feature generation, and evaluation methods to produce effective online and offline models of behavioral signals.<br />
* Systems: hardware, operating system, runtime, and language support for fast, scalable, efficient data centers.<br />
* Information Retrieval: search algorithms, information extraction, question answering, cross-lingual retrieval and multimedia retrieval</p></blockquote>
<h6 class="zemanta-related-title" style="font-size: 1em;">Related articles by Zemanta</h6>
<ul class="zemanta-article-ul">
<li class="zemanta-article-ul-li"><a href="http://www.techcrunch.com/2010/01/08/facebook-fellowship/">Facebook Launches Fellowship Program To Promote Social Computing Research</a> (techcrunch.com)</li>
<li class="zemanta-article-ul-li"><a href="http://trak.in/tags/business/2010/01/09/facebook-fellowships-for-computing-research-another-win-win-collaboration/">Facebook fellowships for computing research: another win-win collaboration?</a> (trak.in)</li>
<li class="zemanta-article-ul-li"><a href="http://www.insidefacebook.com/2010/01/08/facebook-announces-ph-d-fellowship-program/">Facebook Announces Ph.D. Fellowship Program</a> (insidefacebook.com)</li>
<li class="zemanta-article-ul-li"><a href="http://www.sfgate.com/cgi-bin/blogs/techchron/detail?blogid=19&amp;entry_id=54916">Facebook funding Ph.D fellowships</a> (sfgate.com)</li>
</ul>
<div class="zemanta-pixie" style="margin-top: 10px; height: 15px;"><a class="zemanta-pixie-a" title="Reblog this post [with Zemanta]" href="http://reblog.zemanta.com/zemified/4552a695-14b4-47e5-9c3c-c25647589802/"><img class="zemanta-pixie-img" style="border: medium none; float: right;" src="http://img.zemanta.com/reblog_e.png?x-id=4552a695-14b4-47e5-9c3c-c25647589802" alt="Reblog this post [with Zemanta]" /></a><span class="zem-script more-related pretty-attribution"><script src="http://static.zemanta.com/readside/loader.js" type="text/javascript"></script></span></div>
]]></content:encoded>
			<wfw:commentRss>http://ascnetworksnetwork.org/facebook-phd-research-fellowships/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

