Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Analysis of weighted networks   The connections in many networks are not merely binary entities, either
present or not, but have associated weights that record their strengths
relative to one another. Recent studies of networks have, by and large, steered
clear of such weighted networks, which are often perceived as being harder to
analyze than their unweighted counterparts. Here we point out that weighted
networks can in many cases be analyzed using a simple mapping from a weighted
network to an unweighted multigraph, allowing us to apply standard techniques
for unweighted graphs to weighted ones as well. We give a number of examples of
the method, including an algorithm for detecting community structure in
weighted networks and a new and simple proof of the max-flow/min-cut theorem.

26
The categories of this paper are: bayes-an
12
The categories of this paper are: nucl-th
34
The categories of this paper are: chem-ph
35
The categories of this paper are: mtrl-th
29
The categories of this paper are: funct-an
33
The categories of this paper are: plasm-ph
22
The categories of this paper are: chao-dyn
18
The categories of this paper are: econ
11
The categories of this paper are: hep-lat
27
The categories of this paper are: comp-gas
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
13
The categories of this paper are: quant-ph
23
The categories of this paper are: solv-int
2
The categories of this paper are: math