<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
"http://www.w3.org/TR/html4/loose.dtd">
<html >
<head><title>1.2.1.0 rank_occurrence.py</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<meta name="generator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)">
<meta name="originator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)">
<!-- html,index=2,3,4,5,next -->
<meta name="src" content="mammult_doc.tex">
<meta name="date" content="2015-10-19 16:26:00">
<link rel="stylesheet" type="text/css" href="mammult_doc.css">
</head><body
>
<!--l. 3--><div class="crosslinks"><p class="noindent">[<a
href="mammult_docsu27.html" >next</a>] [<a
href="mammult_docsu25.html" >prev</a>] [<a
href="mammult_docsu25.html#tailmammult_docsu25.html" >prev-tail</a>] [<a
href="#tailmammult_docsu26.html">tail</a>] [<a
href="mammult_docsu23.html#mammult_docsu26.html" >up</a>] </p></div>
<h5 class="subsubsectionHead"><a
id="x30-290001.2.1"></a><span
class="cmtt-10x-x-109">rank</span><span
class="cmtt-10x-x-109">_occurrence.py</span></h5>
<!--l. 3--><p class="noindent" ><span
class="cmbx-10x-x-109">NAME</span>
<!--l. 3--><p class="indent" > <span
class="cmbx-10x-x-109">rank</span><span
class="cmbx-10x-x-109">_occurrence.py </span>- compute the intersection of two rankings.
<!--l. 3--><p class="noindent" ><span
class="cmbx-10x-x-109">SYNOPSYS</span>
<!--l. 3--><p class="indent" > <span
class="cmbx-10x-x-109">rank</span><span
class="cmbx-10x-x-109">_occurrence.py </span><span
class="cmmi-10x-x-109"><</span><span
class="cmitt-10x-x-109">rank1</span><span
class="cmmi-10x-x-109">> <</span><span
class="cmitt-10x-x-109">rank2</span><span
class="cmmi-10x-x-109">> <</span><span
class="cmitt-10x-x-109">increment</span><span
class="cmmi-10x-x-109">></span>
<!--l. 14--><p class="noindent" ><span
class="cmbx-10x-x-109">DESCRIPTION</span>
<!--l. 14--><p class="indent" > Get two rankings <span
class="cmti-10x-x-109">rank1 </span>and <span
class="cmti-10x-x-109">rank2 </span>and compute the size of the <span
class="cmti-10x-x-109">k</span>-intersection,
i.e. the number of elements which are present in the first k positions of both
rankings, as a function of <span
class="cmti-10x-x-109">k</span>. The parameter <span
class="cmti-10x-x-109">increment </span>determines the distance
between two subsequent values of <span
class="cmti-10x-x-109">k</span>.
<!--l. 14--><p class="indent" > Each input file is a list of node IDs, one per line, where the first line contains
the ID of the highest ranked node.
<!--l. 22--><p class="noindent" ><span
class="cmbx-10x-x-109">OUTPUT</span>
<!--l. 22--><p class="indent" > The program prints on <span
class="cmtt-10x-x-109">stdout </span>a list of lines in the format:
<!--l. 22--><p class="indent" >   <span
class="cmti-10x-x-109">k num</span><span
class="cmti-10x-x-109">_k</span>
<!--l. 22--><p class="indent" > where <span
class="cmti-10x-x-109">num</span><span
class="cmti-10x-x-109">_k </span>is the number of nodes which are present in the first <span
class="cmti-10x-x-109">k </span>positions
of both rankings.
<!--l. 24--><p class="noindent" ><span
class="cmbx-10x-x-109">REFERENCE</span>
<!--l. 24--><p class="indent" > V. Nicosia, V. Latora, “Measuring and modeling correlations in multiplex
networks”, <span
class="cmti-10x-x-109">Phys. Rev. E </span><span
class="cmbx-10x-x-109">92</span>, 032805 (2015).
<!--l. 24--><p class="indent" > Link to paper: <a
href="http://journals.aps.org/pre/abstract/10.1103/PhysRevE.92.032805" class="url" ><span
class="cmtt-10x-x-109">http://journals.aps.org/pre/abstract/10.1103/PhysRevE.92.032805</span></a>
<!--l. 184--><div class="crosslinks"><p class="noindent">[<a
href="mammult_docsu27.html" >next</a>] [<a
href="mammult_docsu25.html" >prev</a>] [<a
href="mammult_docsu25.html#tailmammult_docsu25.html" >prev-tail</a>] [<a
href="mammult_docsu26.html" >front</a>] [<a
href="mammult_docsu23.html#mammult_docsu26.html" >up</a>] </p></div>
<!--l. 184--><p class="indent" > <a
id="tailmammult_docsu26.html"></a>
</body></html>