Sophie

Sophie

distrib > Mageia > 4 > x86_64 > by-pkgid > e5ddaa4c8aef3b801d60a051db101461 > files > 1619

python-networkx-1.8.1-3.mga4.noarch.rpm



<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
  "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">


<html xmlns="http://www.w3.org/1999/xhtml">
  <head>
    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
    
    <title>degree_assortativity_coefficient &mdash; NetworkX 1.8.1 documentation</title>
    
    <link rel="stylesheet" href="../../_static/networkx.css" type="text/css" />
    <link rel="stylesheet" href="../../_static/pygments.css" type="text/css" />
    
    <script type="text/javascript">
      var DOCUMENTATION_OPTIONS = {
        URL_ROOT:    '../../',
        VERSION:     '1.8.1',
        COLLAPSE_INDEX: false,
        FILE_SUFFIX: '.html',
        HAS_SOURCE:  false
      };
    </script>
    <script type="text/javascript" src="../../_static/jquery.js"></script>
    <script type="text/javascript" src="../../_static/underscore.js"></script>
    <script type="text/javascript" src="../../_static/doctools.js"></script>
    <link rel="search" type="application/opensearchdescription+xml"
          title="Search within NetworkX 1.8.1 documentation"
          href="../../_static/opensearch.xml"/>
    <link rel="top" title="NetworkX 1.8.1 documentation" href="../../index.html" />
    <link rel="up" title="Assortativity" href="../algorithms.assortativity.html" />
    <link rel="next" title="attribute_assortativity_coefficient" href="networkx.algorithms.assortativity.attribute_assortativity_coefficient.html" />
    <link rel="prev" title="attribute_mixing_dict" href="networkx.algorithms.assortativity.attribute_mixing_dict.html" /> 
  </head>
  <body>
<div style="color: black;background-color: white; font-size: 3.2em; text-align: left; padding: 15px 10px 10px 15px">
NetworkX
</div>

    <div class="related">
      <h3>Navigation</h3>
      <ul>
        <li class="right" style="margin-right: 10px">
          <a href="../../genindex.html" title="General Index"
             accesskey="I">index</a></li>
        <li class="right" >
          <a href="../../py-modindex.html" title="Python Module Index"
             >modules</a> |</li>
        <li class="right" >
          <a href="networkx.algorithms.assortativity.attribute_assortativity_coefficient.html" title="attribute_assortativity_coefficient"
             accesskey="N">next</a> |</li>
        <li class="right" >
          <a href="networkx.algorithms.assortativity.attribute_mixing_dict.html" title="attribute_mixing_dict"
             accesskey="P">previous</a> |</li>
        <li><a href="http://networkx.github.com/">NetworkX Home </a> |&nbsp;</li>
        <li><a href="http://networkx.github.com/documentation.html">Documentation </a>|&nbsp;</li>
        <li><a href="http://networkx.github.com/download.html">Download </a> |&nbsp;</li>
        <li><a href="http://github.com/networkx">Developer (Github)</a></li>



          <li><a href="../index.html" >Reference</a> &raquo;</li>
          <li><a href="../pdf_reference.html" >Reference</a> &raquo;</li>
          <li><a href="../algorithms.html" >Algorithms</a> &raquo;</li>
          <li><a href="../algorithms.assortativity.html" accesskey="U">Assortativity</a> &raquo;</li> 
      </ul>
    </div>



      <div class="sphinxsidebar">
        <div class="sphinxsidebarwrapper">
  <h4>Previous topic</h4>
  <p class="topless"><a href="networkx.algorithms.assortativity.attribute_mixing_dict.html"
                        title="previous chapter">attribute_mixing_dict</a></p>
  <h4>Next topic</h4>
  <p class="topless"><a href="networkx.algorithms.assortativity.attribute_assortativity_coefficient.html"
                        title="next chapter">attribute_assortativity_coefficient</a></p>
<div id="searchbox" style="display: none">
  <h3>Quick search</h3>
    <form class="search" action="../../search.html" method="get">
      <input type="text" name="q" />
      <input type="submit" value="Go" />
      <input type="hidden" name="check_keywords" value="yes" />
      <input type="hidden" name="area" value="default" />
    </form>
    <p class="searchtip" style="font-size: 90%">
    Enter search terms or a module, class or function name.
    </p>
</div>
<script type="text/javascript">$('#searchbox').show(0);</script>
        </div>
      </div>

    <div class="document">
      <div class="documentwrapper">
        <div class="bodywrapper">
          <div class="body">
            
  <div class="section" id="degree-assortativity-coefficient">
<h1>degree_assortativity_coefficient<a class="headerlink" href="#degree-assortativity-coefficient" title="Permalink to this headline">¶</a></h1>
<dl class="function">
<dt id="networkx.algorithms.assortativity.degree_assortativity_coefficient">
<tt class="descname">degree_assortativity_coefficient</tt><big>(</big><em>G</em>, <em>x='out'</em>, <em>y='in'</em>, <em>weight=None</em>, <em>nodes=None</em><big>)</big><a class="headerlink" href="#networkx.algorithms.assortativity.degree_assortativity_coefficient" title="Permalink to this definition">¶</a></dt>
<dd><p>Compute degree assortativity of graph.</p>
<p>Assortativity measures the similarity of connections
in the graph with respect to the node degree.</p>
<table class="docutils field-list" frame="void" rules="none">
<col class="field-name" />
<col class="field-body" />
<tbody valign="top">
<tr class="field-odd field"><th class="field-name">Parameters :</th><td class="field-body"><p class="first"><strong>G</strong> : NetworkX graph</p>
<p><strong>x: string (&#8216;in&#8217;,&#8217;out&#8217;)</strong> :</p>
<blockquote>
<div><p>The degree type for source node (directed graphs only).</p>
</div></blockquote>
<p><strong>y: string (&#8216;in&#8217;,&#8217;out&#8217;)</strong> :</p>
<blockquote>
<div><p>The degree type for target node (directed graphs only).</p>
</div></blockquote>
<p><strong>weight: string or None, optional (default=None)</strong> :</p>
<blockquote>
<div><p>The edge attribute that holds the numerical value used 
as a weight.  If None, then each edge has weight 1.
The degree is the sum of the edge weights adjacent to the node.</p>
</div></blockquote>
<p><strong>nodes: list or iterable (optional)</strong> :</p>
<blockquote>
<div><p>Compute degree assortativity only for nodes in container. 
The default is all nodes.</p>
</div></blockquote>
</td>
</tr>
<tr class="field-even field"><th class="field-name">Returns :</th><td class="field-body"><p class="first"><strong>r</strong> : float</p>
<blockquote class="last">
<div><p>Assortativity of graph by degree.</p>
</div></blockquote>
</td>
</tr>
</tbody>
</table>
<div class="admonition-see-also admonition seealso">
<p class="first admonition-title">See also</p>
<p class="last"><a class="reference internal" href="networkx.algorithms.assortativity.attribute_assortativity_coefficient.html#networkx.algorithms.assortativity.attribute_assortativity_coefficient" title="networkx.algorithms.assortativity.attribute_assortativity_coefficient"><tt class="xref py py-obj docutils literal"><span class="pre">attribute_assortativity_coefficient</span></tt></a>, <a class="reference internal" href="networkx.algorithms.assortativity.numeric_assortativity_coefficient.html#networkx.algorithms.assortativity.numeric_assortativity_coefficient" title="networkx.algorithms.assortativity.numeric_assortativity_coefficient"><tt class="xref py py-obj docutils literal"><span class="pre">numeric_assortativity_coefficient</span></tt></a>, <tt class="xref py py-obj docutils literal"><span class="pre">neighbor_connectivity</span></tt>, <a class="reference internal" href="networkx.algorithms.assortativity.degree_mixing_dict.html#networkx.algorithms.assortativity.degree_mixing_dict" title="networkx.algorithms.assortativity.degree_mixing_dict"><tt class="xref py py-obj docutils literal"><span class="pre">degree_mixing_dict</span></tt></a>, <a class="reference internal" href="networkx.algorithms.assortativity.degree_mixing_matrix.html#networkx.algorithms.assortativity.degree_mixing_matrix" title="networkx.algorithms.assortativity.degree_mixing_matrix"><tt class="xref py py-obj docutils literal"><span class="pre">degree_mixing_matrix</span></tt></a></p>
</div>
<p class="rubric">Notes</p>
<p>This computes Eq. (21) in Ref. <a class="reference internal" href="#r134">[R134]</a> , where e is the joint
probability distribution (mixing matrix) of the degrees.  If G is
directed than the matrix e is the joint probability of the 
user-specified degree type for the source and target.</p>
<p class="rubric">References</p>
<table class="docutils citation" frame="void" id="r134" rules="none">
<colgroup><col class="label" /><col /></colgroup>
<tbody valign="top">
<tr><td class="label">[R134]</td><td><em>(<a class="fn-backref" href="#id1">1</a>, <a class="fn-backref" href="#id2">2</a>)</em> M. E. J. Newman, Mixing patterns in networks,
Physical Review E, 67 026126, 2003</td></tr>
</tbody>
</table>
<table class="docutils citation" frame="void" id="r135" rules="none">
<colgroup><col class="label" /><col /></colgroup>
<tbody valign="top">
<tr><td class="label"><a class="fn-backref" href="#id3">[R135]</a></td><td>Foster, J.G., Foster, D.V., Grassberger, P. &amp; Paczuski, M. 
Edge direction and the structure of networks, PNAS 107, 10815-20 (2010).</td></tr>
</tbody>
</table>
<p class="rubric">Examples</p>
<div class="highlight-python"><div class="highlight"><pre><span class="gp">&gt;&gt;&gt; </span><span class="n">G</span><span class="o">=</span><span class="n">nx</span><span class="o">.</span><span class="n">path_graph</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span>
<span class="gp">&gt;&gt;&gt; </span><span class="n">r</span><span class="o">=</span><span class="n">nx</span><span class="o">.</span><span class="n">degree_assortativity_coefficient</span><span class="p">(</span><span class="n">G</span><span class="p">)</span>
<span class="gp">&gt;&gt;&gt; </span><span class="k">print</span><span class="p">(</span><span class="s">&quot;</span><span class="si">%3.1f</span><span class="s">&quot;</span><span class="o">%</span><span class="n">r</span><span class="p">)</span>
<span class="go">-0.5</span>
</pre></div>
</div>
</dd></dl>

</div>


          </div>
        </div>
      </div>
      <div class="clearer"></div>
    </div>
    <div class="related">
      <h3>Navigation</h3>
      <ul>
        <li class="right" style="margin-right: 10px">
          <a href="../../genindex.html" title="General Index"
             >index</a></li>
        <li class="right" >
          <a href="../../py-modindex.html" title="Python Module Index"
             >modules</a> |</li>
        <li class="right" >
          <a href="networkx.algorithms.assortativity.attribute_assortativity_coefficient.html" title="attribute_assortativity_coefficient"
             >next</a> |</li>
        <li class="right" >
          <a href="networkx.algorithms.assortativity.attribute_mixing_dict.html" title="attribute_mixing_dict"
             >previous</a> |</li>
        <li><a href="http://networkx.github.com/">NetworkX Home </a> |&nbsp;</li>
        <li><a href="http://networkx.github.com/documentation.html">Documentation </a>|&nbsp;</li>
        <li><a href="http://networkx.github.com/download.html">Download </a> |&nbsp;</li>
        <li><a href="http://github.com/networkx">Developer (Github)</a></li>



          <li><a href="../index.html" >Reference</a> &raquo;</li>
          <li><a href="../pdf_reference.html" >Reference</a> &raquo;</li>
          <li><a href="../algorithms.html" >Algorithms</a> &raquo;</li>
          <li><a href="../algorithms.assortativity.html" >Assortativity</a> &raquo;</li> 
      </ul>
    </div>
    <div class="footer">
        &copy; Copyright 2013, NetworkX Developers.
      Last updated on Oct 23, 2013.
      Created using <a href="http://sphinx.pocoo.org/">Sphinx</a> 1.1.3.
    </div>
  </body>
</html>