<?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>Computational Legal Studies™ &#187; physics</title>
	<atom:link href="http://computationallegalstudies.com/tag/physics/feed/" rel="self" type="application/rss+xml" />
	<link>http://computationallegalstudies.com</link>
	<description></description>
	<lastBuildDate>Sat, 19 May 2012 21:05:14 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<xhtml:meta xmlns:xhtml="http://www.w3.org/1999/xhtml" name="robots" content="noindex" />
		<item>
		<title>Prediction of Emerging Technologies Based on Analysis of the U.S. Patent Citation Network  [ via Peter Erdi and UMich EECS ]</title>
		<link>http://computationallegalstudies.com/2012/03/07/prediction-of-emerging-technologies-based-on-analysis-of-the-u-s-patent-citation-network-via-peter-erdi-and-umich-eecs/</link>
		<comments>http://computationallegalstudies.com/2012/03/07/prediction-of-emerging-technologies-based-on-analysis-of-the-u-s-patent-citation-network-via-peter-erdi-and-umich-eecs/#comments</comments>
		<pubDate>Wed, 07 Mar 2012 16:04:55 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[complex systems]]></category>
		<category><![CDATA[network analysis]]></category>
		<category><![CDATA[patents]]></category>
		<category><![CDATA[physics]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=7869</guid>
		<description><![CDATA[Dr. Peter Erdi is one of the leading scholars studying the path of innovation as revealed through the U.S. Patent Citation network.  Above is his most recent talk &#8211; Prediction of Emerging Technologies Based on Analysis of the U.S. Patent &#8230; <a href="http://computationallegalstudies.com/2012/03/07/prediction-of-emerging-technologies-based-on-analysis-of-the-u-s-patent-citation-network-via-peter-erdi-and-umich-eecs/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.eecs.umich.edu/cse/dm_11_video/erdi.mp4"><img class="alignnone size-full wp-image-7870" title="Screen shot 2012-03-07 at 10.43.00 AM" src="http://computationallegalstudies.com/wp-content/uploads/2012/03/Screen-shot-2012-03-07-at-10.43.00-AM.jpg" alt="" width="892" height="551" /></a></p>
<p><strong><a href="http://people.kzoo.edu/~perdi/">Dr. Peter Erdi</a></strong> is one of the leading scholars studying the path of innovation as revealed through the U.S. Patent Citation network.  Above is his most recent talk &#8211; Prediction of Emerging Technologies Based on Analysis of the U.S. Patent Citation Network</p>
<p><em>For some of his additional work please see</em>:<strong><a href="http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1413290"><br />
Patent Citation Networks Revisited: Signs of a Twenty-First Century Change?</a></strong>, North Carolina Law Review (2009).<strong><a href="http://works.bepress.com/katherine_strandburg/5/"><br />
Modeling Innovation by a Kinetic Description of the Patent Citation System</a></strong>, Physica A (2007)<em></em><strong><a href="http://papers.ssrn.com/sol3/papers.cfm?abstract_id=958949"><br />
Law and the Science of Networks: An Overview and an Application to the &#8216;Patent Explosion&#8217;</a></strong>, Berkeley Technology Law Journal (2007).</p>
<p>[Note: Load Time for the Video above is a bit slow]</p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2012/03/07/prediction-of-emerging-technologies-based-on-analysis-of-the-u-s-patent-citation-network-via-peter-erdi-and-umich-eecs/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
<enclosure url="http://www.eecs.umich.edu/cse/dm_11_video/erdi.mp4" length="66625601" type="video/mp4" />
		</item>
		<item>
		<title>Benoît B. Mandelbrot: Fractals in Science, Engineering and Finance (Roughness and Beauty) [via MIT World]</title>
		<link>http://computationallegalstudies.com/2011/12/26/benoit-b-mandelbrot-fractals-in-science-engineering-and-finance-roughness-and-beauty-via-mit-world/</link>
		<comments>http://computationallegalstudies.com/2011/12/26/benoit-b-mandelbrot-fractals-in-science-engineering-and-finance-roughness-and-beauty-via-mit-world/#comments</comments>
		<pubDate>Mon, 26 Dec 2011 17:43:35 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[fractals]]></category>
		<category><![CDATA[Law as a Complex System]]></category>
		<category><![CDATA[physics]]></category>
		<category><![CDATA[positive legal theory]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=7460</guid>
		<description><![CDATA[Many of you are aware of my obsession (here) (here) (here) with fractals, power law distributions, etc. and their role in understanding a variety of phenomena.  In this spirit, I recently came across this video on MIT World from the &#8230; <a href="http://computationallegalstudies.com/2011/12/26/benoit-b-mandelbrot-fractals-in-science-engineering-and-finance-roughness-and-beauty-via-mit-world/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p><center><object classid="clsid:d27cdb6e-ae6d-11cf-96b8-444553540000" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=9,0,0,0" width="481" height="361" id="Main" align="middle"><param name="allowScriptAccess" value="always" /><param name="movie" value="http://mitworld.mit.edu/flash/player/Main.swf?host=cp58255.edgefcs.net&#038;flv=mitw-00235-mandelbrot-27nov01&#038;preview=http://mitworld.mit.edu//uploads/mitwstillalt00235mandelbrot27nov01.jpg" /><param name="quality" value="high" /><param name="bgcolor" value="#000000" /><embed src="http://mitworld.mit.edu/flash/player/Main.swf?host=cp58255.edgefcs.net&#038;flv=mitw-00235-mandelbrot-27nov01&#038;preview=http://mitworld.mit.edu//uploads/mitwstillalt00235mandelbrot27nov01.jpg" quality="high" bgcolor="#000000" width="481" height="361" name="Main" align="middle" allowScriptAccess="always" type="application/x-shockwave-flash" pluginspage="http://www.macromedia.com/go/getflashplayer" /></object></center></p>
<p>Many of you are aware of my obsession (<strong><a href="http://computationallegalstudies.com/2011/05/13/how-long-is-the-coastline-of-the-law-additional-thoughts-on-the-fractal-nature-of-legal-systems-repost/">here</a></strong>) (<strong><a href="http://computationallegalstudies.com/2009/08/12/power-laws-preferential-attachment-and-positive-legal-theory-part-2/">here</a></strong>) (<strong><a href="http://computationallegalstudies.com/2009/07/15/power-laws-preferential-attachment-and-positive-legal-theory-part-1/">here</a></strong>) with<strong> <a href="http://en.wikipedia.org/wiki/Fractal">fractals</a></strong>, <strong><a href="http://en.wikipedia.org/wiki/Power_law">power law distributions</a></strong>, etc. and their role in understanding a variety of phenomena.  In this spirit, I recently came across this video on MIT World from the late <cite></cite><strong><a href="http://en.wikipedia.org/wiki/Benoit_Mandelbrot">Benoît B. Mandelbrot</a></strong><em>.  It is well worth the watch &#8211; enjoy!</em></p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2011/12/26/benoit-b-mandelbrot-fractals-in-science-engineering-and-finance-roughness-and-beauty-via-mit-world/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Physicist Cuts Plane Boarding Time in Half [via CNet &amp; Hacker News]</title>
		<link>http://computationallegalstudies.com/2011/08/31/physicist-cuts-plane-boarding-time-in-half-via-cnet-hacker-news/</link>
		<comments>http://computationallegalstudies.com/2011/08/31/physicist-cuts-plane-boarding-time-in-half-via-cnet-hacker-news/#comments</comments>
		<pubDate>Wed, 31 Aug 2011 04:06:29 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[complex systems]]></category>
		<category><![CDATA[physics]]></category>
		<category><![CDATA[the future]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=6766</guid>
		<description><![CDATA[&#8220;&#8230; Steffen considered various methods, such as boarding people in blocks, at random, and in window seats first. He set up a model using an algorithm based on the Monte Carlo optimization method used in statistics and mathematics. He found &#8230; <a href="http://computationallegalstudies.com/2011/08/31/physicist-cuts-plane-boarding-time-in-half-via-cnet-hacker-news/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p><center><iframe width="480" height="390" src="http://www.youtube.com/embed/o9-XjEI8VmA" frameborder="0" allowfullscreen></iframe></center><br />
&#8220;&#8230; Steffen considered various methods, such as boarding people in blocks, at random, and in window seats first. He set up a model using an algorithm based on the Monte Carlo optimization method used in statistics and mathematics. He found that the most efficient boarding method is to board alternate rows at a time, beginning with the window seats on one side, then the other, minimizing aisle interference. The window seats are followed by alternate rows of middle seats, then aisle seats. He also found that boarding at random is faster that boarding by blocks.&#8221; Coverage over at <a href="http://news.cnet.com/8301-17938_105-20099450-1/physicist-cuts-plane-boarding-time-in-half/">C-Net</a></p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2011/08/31/physicist-cuts-plane-boarding-time-in-half-via-cnet-hacker-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Information Efficiency and Financial Stability</title>
		<link>http://computationallegalstudies.com/2011/08/29/information-efficiency-and-financial-stability/</link>
		<comments>http://computationallegalstudies.com/2011/08/29/information-efficiency-and-financial-stability/#comments</comments>
		<pubDate>Mon, 29 Aug 2011 16:19:07 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[economics]]></category>
		<category><![CDATA[financial crisis]]></category>
		<category><![CDATA[physics]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=6750</guid>
		<description><![CDATA[From the abstract: &#8220;The authors study a simple model of an asset market with informed and non-informed agents. In the absence of non-informed agents, the market becomes information efficient when the number of traders with different private information is large &#8230; <a href="http://computationallegalstudies.com/2011/08/29/information-efficiency-and-financial-stability/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p style="text-align: justify;"><a href="http://www.economics-ejournal.org/economics/journalarticles/2010-20"><img class="aligncenter size-full wp-image-6751" src="http://ec2-107-21-222-181.compute-1.amazonaws.com/wp-content/uploads/2011/08/Screen-shot-2011-08-29-at-12.11.32-PM.jpg" alt="" width="583" height="452" /></a></p>
<p style="text-align: justify;">From the abstract: &#8220;The authors study a simple model of an asset market with informed and non-informed agents. In the absence of non-informed agents, the market becomes information efficient when the number of traders with different private information is large enough. Upon introducing non-informed agents, the authors find that the latter contribute significantly to the trading activity if and only if the market is (nearly) information efficient. This suggests that information efficiency might be a necessary condition for bubble phenomena—induced by the behavior of non-informed traders—or conversely that throwing some sands in the gears of financial markets may curb the occurrence of bubbles.&#8221;  [ <strong><a href="http://paul.kedrosky.com/">HT: Paul Kedrosky</a></strong> ]</p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2011/08/29/information-efficiency-and-financial-stability/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Can Math Beat Financial Markets? [ via Scientific American ]</title>
		<link>http://computationallegalstudies.com/2011/08/17/can-math-beat-financial-markets-via-scientific-american/</link>
		<comments>http://computationallegalstudies.com/2011/08/17/can-math-beat-financial-markets-via-scientific-american/#comments</comments>
		<pubDate>Thu, 18 Aug 2011 03:56:03 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[financial crisis]]></category>
		<category><![CDATA[markets]]></category>
		<category><![CDATA[physics]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=6657</guid>
		<description><![CDATA[]]></description>
			<content:encoded><![CDATA[<p style="text-align: center;"><a href="http://www.scientificamerican.com/article.cfm?id=can-math-beat-financial-markets"><img class="aligncenter size-full wp-image-6664" title="Math v. Financial Markets" src="http://ec2-107-21-222-181.compute-1.amazonaws.com/wp-content/uploads/2011/08/Screen-shot-2011-08-17-at-11.50.23-PM1.jpg" alt="" width="560" height="435" /></a></p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2011/08/17/can-math-beat-financial-markets-via-scientific-american/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Controllability of Complex Networks [via Nature]</title>
		<link>http://computationallegalstudies.com/2011/05/18/controllability-of-complex-networks-via-nature/</link>
		<comments>http://computationallegalstudies.com/2011/05/18/controllability-of-complex-networks-via-nature/#comments</comments>
		<pubDate>Wed, 18 May 2011 16:58:57 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[complex systems]]></category>
		<category><![CDATA[network analysis]]></category>
		<category><![CDATA[physics]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=6055</guid>
		<description><![CDATA[Abstract: &#8220;The ultimate proof of our understanding of natural or technological systems is reflected in our ability to control them. Although control theory offers mathematical tools for steering engineered and natural systems towards a desired state, a framework to control &#8230; <a href="http://computationallegalstudies.com/2011/05/18/controllability-of-complex-networks-via-nature/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p style="text-align: justify;"><a href="http://www.nature.com/nature/journal/v473/n7346/full/nature10011.html"><img class="size-full wp-image-6056 aligncenter" title="Screen shot 2011-05-18 at 12.55.02 PM" src="http://ec2-107-21-222-181.compute-1.amazonaws.com/wp-content/uploads/2011/05/Screen-shot-2011-05-18-at-12.55.02-PM.jpg" alt="" width="581" height="329" /></a></p>
<p style="text-align: justify;">Abstract: &#8220;The ultimate proof of our understanding of natural or technological  systems is reflected in our ability to control them. Although control  theory offers mathematical tools for steering engineered and natural  systems towards a desired state, a framework to control complex  self-organized systems is lacking. Here we develop analytical tools to  study the controllability of an arbitrary complex directed network,  identifying the set of driver nodes with time-dependent control that can  guide the system’s entire dynamics. We apply these tools to several  real networks, finding that the number of driver nodes is determined  mainly by the network’s degree distribution. We show that sparse  inhomogeneous networks, which emerge in many real complex systems, are  the most difficult to control, but that dense and homogeneous networks  can be controlled using a few driver nodes. Counterintuitively, we find  that in both model and real systems the driver nodes tend to avoid the  high-degree nodes.&#8221;</p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2011/05/18/controllability-of-complex-networks-via-nature/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>David Christian: Big History [ TED 2011 ]</title>
		<link>http://computationallegalstudies.com/2011/04/19/david-christian-big-history-ted-2011/</link>
		<comments>http://computationallegalstudies.com/2011/04/19/david-christian-big-history-ted-2011/#comments</comments>
		<pubDate>Tue, 19 Apr 2011 05:25:25 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[complex systems]]></category>
		<category><![CDATA[physics]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=5894</guid>
		<description><![CDATA[]]></description>
			<content:encoded><![CDATA[<p><center><object width="446" height="326"><param name="movie" value="http://video.ted.com/assets/player/swf/EmbedPlayer.swf"></param><param name="allowFullScreen" value="true" /><param name="allowScriptAccess" value="always"/><param name="wmode" value="transparent"></param><param name="bgColor" value="#ffffff"></param><param name="flashvars" value="vu=http://video.ted.com/talk/stream/2011/Blank/DavidChristian_2011-320k.mp4&#038;su=http://images.ted.com/images/ted/tedindex/embed-posters/DavidChristian-2011.embed_thumbnail.jpg&#038;vw=432&#038;vh=240&#038;ap=0&#038;ti=1118&#038;lang=eng&#038;introDuration=15330&#038;adDuration=4000&#038;postAdDuration=830&#038;adKeys=talk=david_christian_big_history;year=2011;theme=peering_into_space;theme=technology_history_and_destiny;theme=unconventional_explanations;theme=the_rise_of_collaboration;theme=presentation_innovation;theme=a_taste_of_ted2011;event=A+Taste+of+TED2011;tag=big+bang;tag=cosmos;tag=education;tag=history;tag=humanity;tag=internet;tag=universe;tag=visualizations;&#038;preAdTag=tconf.ted/embed;tile=1;sz=512x288;" /><embed src="http://video.ted.com/assets/player/swf/EmbedPlayer.swf" pluginspace="http://www.macromedia.com/go/getflashplayer" type="application/x-shockwave-flash" wmode="transparent" bgColor="#ffffff" width="446" height="326" allowFullScreen="true" allowScriptAccess="always" flashvars="vu=http://video.ted.com/talk/stream/2011/Blank/DavidChristian_2011-320k.mp4&#038;su=http://images.ted.com/images/ted/tedindex/embed-posters/DavidChristian-2011.embed_thumbnail.jpg&#038;vw=432&#038;vh=240&#038;ap=0&#038;ti=1118&#038;lang=eng&#038;introDuration=15330&#038;adDuration=4000&#038;postAdDuration=830&#038;adKeys=talk=david_christian_big_history;year=2011;theme=peering_into_space;theme=technology_history_and_destiny;theme=unconventional_explanations;theme=the_rise_of_collaboration;theme=presentation_innovation;theme=a_taste_of_ted2011;event=A+Taste+of+TED2011;tag=big+bang;tag=cosmos;tag=education;tag=history;tag=humanity;tag=internet;tag=universe;tag=visualizations;"></embed></object></center></p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2011/04/19/david-christian-big-history-ted-2011/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>&#8220;Peak Data&#8221; or &#8220;The Capacity Crunch&#8221; [From Science]</title>
		<link>http://computationallegalstudies.com/2010/10/19/peak-data-or-the-capacity-crunch-from-science-2/</link>
		<comments>http://computationallegalstudies.com/2010/10/19/peak-data-or-the-capacity-crunch-from-science-2/#comments</comments>
		<pubDate>Tue, 19 Oct 2010 18:31:52 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[physics]]></category>
		<category><![CDATA[the future]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=5259</guid>
		<description><![CDATA[From this week&#8217;s issue of Science comes Filling the Light Pipe by David J. Richardson. This is an important article highlighting a serious challenge facing the both the scientific and policy community. From the abstract: &#8220;It has been a landmark &#8230; <a href="http://computationallegalstudies.com/2010/10/19/peak-data-or-the-capacity-crunch-from-science-2/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.sciencemag.org/cgi/content/summary/330/6002/327"><img class="aligncenter size-full wp-image-5260" title="capacitycrunch" src="http://ec2-107-21-222-181.compute-1.amazonaws.com/wp-content/uploads/2010/10/capacitycrunch1.jpg" alt="" width="600" height="298" /></a></p>
<p style="text-align: justify;">From this week&#8217;s issue of <a href="http://www.sciencemag.org/cgi/content/summary/330/6002/327"><strong>Science</strong></a> comes <a href="http://www.sciencemag.org/cgi/content/summary/330/6002/327"><strong>Filling the Light Pipe</strong></a> by David J. Richardson. This is an important article highlighting a serious challenge facing the both the scientific and policy community.</p>
<p style="text-align: justify;">From the abstract: &#8220;It has been a landmark year for the field of optical telecommunications, with the award of the 2009 Nobel Prize to Charles Kao for his insight in the mid-1960s that the future of communications lay in single-mode silica-based optical fibers (<em>1</em>) as well as the 50th anniversary of the first demonstration of the laser—both key technologies responsible for the development of the global-scale communications networks of today (<em>2</em>). Recently, however, a growing realization has emerged within the telecommunications industry that the end of the phenomenal growth in optical fiber communication capacity is within sight. At this year&#8217;s Optical Fiber Communication Conference (OFC 2010), several groups reported results within a factor of <img src="http://www.sciencemag.org/math/sim.gif" border="0" alt="~" />2 of the ultimate capacity limits of existing optical fiber technology. Without <span style="text-decoration: underline;">radical innovation</span> in our physical network infrastructure—that is, improvements in the key physical properties of transmission fibers and the optical amplifiers that we rely on to transmit data over long distances—we face what has been widely referred to as a &#8220;<span style="text-decoration: underline;">capacity crunch</span>&#8221; that could severely constrain future Internet growth, as well as having social and political ramifications.&#8221;</p>
<p style="text-align: justify;">[HT to <a href="http://paul.kedrosky.com/archives/2010/10/peak_data_appro.html"><strong>Paul Kedrosky</strong></a>]</p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2010/10/19/peak-data-or-the-capacity-crunch-from-science-2/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>&#8220;A Taxonomy of Networks&#8221; New Paper on the Physics arXiv</title>
		<link>http://computationallegalstudies.com/2010/07/02/a-taxonomy-of-networks-new-paper-on-the-physics-arxiv/</link>
		<comments>http://computationallegalstudies.com/2010/07/02/a-taxonomy-of-networks-new-paper-on-the-physics-arxiv/#comments</comments>
		<pubDate>Fri, 02 Jul 2010 09:47:36 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[network analysis]]></category>
		<category><![CDATA[physics]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=4540</guid>
		<description><![CDATA[An exciting new paper entitled &#8220;A Taxonomy of Networks&#8221; by Jukka-Pekka Onnela, Daniel J. Fenn, Stephen Reid, Mason A. Porter, Peter J. Mucha, Mark D. Fricker &#38; Nick S. Jones just hit the Physics arXiv.  I wanted to flag it &#8230; <a href="http://computationallegalstudies.com/2010/07/02/a-taxonomy-of-networks-new-paper-on-the-physics-arxiv/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p style="text-align: center;"><a href="http://arxiv.org/abs/1006.5731"><img class="size-full wp-image-4541 aligncenter" title="Taxonomy of Networks" src="http://ec2-107-21-222-181.compute-1.amazonaws.com/wp-content/uploads/2010/07/Picture-2.jpg" alt="" width="532" height="380" /></a></p>
<p style="text-align: justify;">An exciting new paper entitled &#8220;<a href="http://arxiv.org/abs/1006.5731"><strong>A Taxonomy of Networks</strong></a>&#8221; by <a href="http://www.jponnela.com/"><strong>Jukka-Pekka Onnela</strong></a>, <a href="http://people.maths.ox.ac.uk/fenn/"><strong>Daniel J. Fenn</strong></a>, <a href="http://younoodle.com/people/stephen_reid"><strong>Stephen Reid</strong></a>, <a href="http://people.maths.ox.ac.uk/~porterm/"><strong>Mason A. Porter</strong></a>, <a href="http://www.amath.unc.edu/Faculty/mucha/"><strong>Peter J. Mucha</strong></a>, <a href="http://dps.plants.ox.ac.uk/plants/Staff/MarkFricker.aspx"><strong>Mark D. Fricker</strong></a><strong> </strong>&amp; <a href="http://www.physics.ox.ac.uk/systems/jones.htm"><strong>Nick S. Jones</strong></a> just hit the <a href="http://arxiv.org/"><strong>Physics arXiv</strong></a>.  I wanted to flag it for anyone who might be interested.</p>
<p style="text-align: justify;">Here is the abstract: &#8220;The study of networks has grown into a substantial interdisciplinary endeavor across the natural, social, and information sciences. Yet there have been very few attempts to investigate the interrelatedness of the different classes of networks studied by different disciplines. Here, we introduced a framework to establish a taxonomy of networks from various origins. The provision of this family tree not only helps understand the kinship of networks, but also facilitates the transfer of empirical analysis, theoretical modeling, and conceptual developments across disciplinary boundaries. The framework is based on probing the mesoscopic properties of networks, an important source of heterogeneity for their structure and function. Using our method, we computed a taxonomy for 752 individual networks and a separate taxonomy for 12 network classes. We also computed three within-class taxonomies for political, fungal, and financial networks, and found them to be insightful in each case.&#8221;</p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2010/07/02/a-taxonomy-of-networks-new-paper-on-the-physics-arxiv/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Andrew Lo: Physics Envy Can Kill You [Via Paul Kedrosky]</title>
		<link>http://computationallegalstudies.com/2010/06/30/andrew-lo-physics-envy-can-kill-you-via-paul-kedrosky/</link>
		<comments>http://computationallegalstudies.com/2010/06/30/andrew-lo-physics-envy-can-kill-you-via-paul-kedrosky/#comments</comments>
		<pubDate>Wed, 30 Jun 2010 18:43:27 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[computational social science]]></category>
		<category><![CDATA[finance]]></category>
		<category><![CDATA[financial crisis]]></category>
		<category><![CDATA[physics]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=4534</guid>
		<description><![CDATA[]]></description>
			<content:encoded><![CDATA[<p><center>
<div><object id="Main" classid="clsid:d27cdb6e-ae6d-11cf-96b8-444553540000" width="481" height="361" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=6,0,40,0"><param name="align" value="middle" /><param name="allowScriptAccess" value="always" /><param name="quality" value="high" /><param namAe="bgcolor" value="#000000" /><param name="src" value="http://mitworld.mit.edu/flash/player/Main.swf?host=cp58255.edgefcs.net&amp;flv=mitw-01283-sloan-bttc-10-econ-physics-lo-05jun2010&amp;preview=http://mitworld.mit.edu//uploads/mitwstill01283sloanbttc10econphysicslo05jun2010.jpg" /><param name="name" value="Main" /><embed id="Main" type="application/x-shockwave-flash" width="481" height="361" src="http://mitworld.mit.edu/flash/player/Main.swf?host=cp58255.edgefcs.net&amp;flv=mitw-01283-sloan-bttc-10-econ-physics-lo-05jun2010&amp;preview=http://mitworld.mit.edu//uploads/mitwstill01283sloanbttc10econphysicslo05jun2010.jpg" name="Main" bgcolor="#000000" quality="high" allowscriptaccess="always" align="middle"></embed></object></div>
<p></center></p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2010/06/30/andrew-lo-physics-envy-can-kill-you-via-paul-kedrosky/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Claude Shannon &#8211; Father of Information Theory</title>
		<link>http://computationallegalstudies.com/2010/06/17/claude-shannon-father-of-information-theory/</link>
		<comments>http://computationallegalstudies.com/2010/06/17/claude-shannon-father-of-information-theory/#comments</comments>
		<pubDate>Thu, 17 Jun 2010 04:01:49 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[information theory]]></category>
		<category><![CDATA[physics]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=4434</guid>
		<description><![CDATA[This summer in the Complex Systems Advanced Academic Workshop we are devoting attention to information theory.  In collecting some materials about Claude Shannon, I came across the above video and thought I would share it with others.  Here is the &#8230; <a href="http://computationallegalstudies.com/2010/06/17/claude-shannon-father-of-information-theory/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p><center><object classid="clsid:d27cdb6e-ae6d-11cf-96b8-444553540000" width="445" height="364" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=6,0,40,0"><param name="allowFullScreen" value="true" /><param name="allowscriptaccess" value="always" /><param name="src" value="http://www.youtube.com/v/z2Whj_nL-x8&amp;hl=en_US&amp;fs=1&amp;color1=0x006699&amp;color2=0x54abd6&amp;border=1" /><param name="allowfullscreen" value="true" /><embed type="application/x-shockwave-flash" width="445" height="364" src="http://www.youtube.com/v/z2Whj_nL-x8&amp;hl=en_US&amp;fs=1&amp;color1=0x006699&amp;color2=0x54abd6&amp;border=1" allowscriptaccess="always" allowfullscreen="true"></embed></object></center></p>
<p style="text-align: justify;">This summer in the <a href="http://www.cscs.umich.edu/CSAAW/"><strong>Complex Systems Advanced Academic Workshop</strong></a> we are devoting attention to <a href="http://en.wikipedia.org/wiki/Information_theory"><strong>information theory</strong></a>.  In collecting some materials about Claude Shannon, I came across the above video and thought I would share it with others.  Here is the description &#8230; &#8220;Considered the founding father of the electronic communication age, <a href="http://en.wikipedia.org/wiki/Claude_Shannon"><strong>Claude Shannon&#8217;s</strong></a> work ushered in the Digital Revolution. This fascinating program explores his life and the major influence his work had on today&#8217;s digital world through interviews with his friends and colleagues.&#8221;</p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2010/06/17/claude-shannon-father-of-information-theory/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Distance Measures for Dynamic Citation Networks &#8212; Slides from Political Networks Conference &#8212; Duke 2010</title>
		<link>http://computationallegalstudies.com/2010/05/21/distance-measures-for-dynamic-citation-networks-slides-from-political-networks-conference-duke-2010/</link>
		<comments>http://computationallegalstudies.com/2010/05/21/distance-measures-for-dynamic-citation-networks-slides-from-political-networks-conference-duke-2010/#comments</comments>
		<pubDate>Fri, 21 May 2010 18:19:12 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[computational legal studies]]></category>
		<category><![CDATA[judicial citation network]]></category>
		<category><![CDATA[network analysis]]></category>
		<category><![CDATA[physics]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=4289</guid>
		<description><![CDATA[Sinks Method Paper Presentation @ Duke Political Networks Conference 2010 View more presentations from Daniel Katz.]]></description>
			<content:encoded><![CDATA[<p><center>
<div style="width:425px" id="__ss_7543841"><strong style="display:block;margin:12px 0 4px"><a href="http://www.slideshare.net/Danielkatz/sinks-method-paper-presentation-duke-political-networks-conference-2010" title="Sinks Method Paper Presentation @ Duke Political Networks Conference 2010">Sinks Method Paper Presentation @ Duke Political Networks Conference 2010</a></strong><object id="__sse7543841" width="425" height="355"><param name="movie" value="http://static.slidesharecdn.com/swf/ssplayer2.swf?doc=sinkspresent-110407005256-phpapp01&#038;stripped_title=sinks-method-paper-presentation-duke-political-networks-conference-2010&#038;userName=Danielkatz" /><param name="allowFullScreen" value="true"/><param name="allowScriptAccess" value="always"/><embed name="__sse7543841" src="http://static.slidesharecdn.com/swf/ssplayer2.swf?doc=sinkspresent-110407005256-phpapp01&#038;stripped_title=sinks-method-paper-presentation-duke-political-networks-conference-2010&#038;userName=Danielkatz" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="355"></embed></object>
<div style="padding:5px 0 12px">View more presentations from <a href="http://www.slideshare.net/Danielkatz">Daniel Katz</a>.</div>
</div>
<p></center></p>
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2010/05/21/distance-measures-for-dynamic-citation-networks-slides-from-political-networks-conference-duke-2010/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>NetSci 2010 &#8212; MIT Media Lab</title>
		<link>http://computationallegalstudies.com/2010/05/11/netsci-2010-mit-media-lab/</link>
		<comments>http://computationallegalstudies.com/2010/05/11/netsci-2010-mit-media-lab/#comments</comments>
		<pubDate>Tue, 11 May 2010 22:00:54 +0000</pubDate>
		<dc:creator>Daniel Martin Katz</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[computational legal studies]]></category>
		<category><![CDATA[computational social science]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[network analysis]]></category>
		<category><![CDATA[physics]]></category>

		<guid isPermaLink="false">http://computationallegalstudies.com/?p=4231</guid>
		<description><![CDATA[Tomorrow is the first day of presentations at NetSci2010. Our paper will presented in AM Network Measures Panel.  Anyway, for those interested in leveraging network science to study the dynamics of large social and physical systems &#8212; the conference promises a &#8230; <a href="http://computationallegalstudies.com/2010/05/11/netsci-2010-mit-media-lab/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p style="text-align: justify;"><a href="http://www.netsci2010.net/"><img class="aligncenter size-full wp-image-4232" title="NetSci 2010" src="http://ec2-107-21-222-181.compute-1.amazonaws.com/wp-content/uploads/2010/05/Picture-5.jpg" alt="" width="509" height="338" /></a></p>
<p style="text-align: justify;">Tomorrow is the first day of presentations at <a href="http://www.netsci2010.net/"><strong>NetSci2010</strong></a>. Our paper will presented in AM Network Measures Panel.  Anyway, for those interested in leveraging network science to study the dynamics of large social and physical systems &#8212; the conference promises a fantastic lineup of speakers. Check out <a href="http://netsci2010.net/NetSci2010_MASTER-Conference.pdf"><strong>the program!</strong></a></p>
<p style="text-align: justify;">
]]></content:encoded>
			<wfw:commentRss>http://computationallegalstudies.com/2010/05/11/netsci-2010-mit-media-lab/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Minified using apc
Page Caching using apc
Database Caching 3/16 queries in 0.004 seconds using apc
Object Caching 1061/1094 objects using apc

Served from: computationallegalstudies.com @ 2012-05-22 10:50:40 -->
