<s>
Disparity	O
filter	O
can	O
sufficiently	O
reduce	O
the	O
network	O
without	O
destroying	O
the	O
multi-scale	B-Algorithm
nature	O
of	O
the	O
network	O
.	O
</s>
<s>
k-core	B-Algorithm
decomposition	O
is	O
an	O
algorithm	O
that	O
reduces	O
a	O
graph	O
into	O
a	O
maximal	O
connected	O
subgraph	O
of	O
vertices	O
with	O
at	O
least	O
degree	O
k	O
.	O
This	O
algorithm	O
can	O
only	O
be	O
applied	O
to	O
unweighted	O
graphs	O
.	O
</s>
<s>
The	O
disparity	O
filter	O
algorithm	O
is	O
based	O
on	O
p-value	B-General_Concept
statistical	O
significance	O
test	O
of	O
the	O
null	O
model	O
:	O
For	O
a	O
given	O
normalized	O
weight	O
pij	O
,	O
the	O
p-value	B-General_Concept
αij	O
of	O
pij	O
based	O
on	O
the	O
null	O
model	O
is	O
given	O
by	O
which	O
reduces	O
to	O
.	O
</s>
