Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A new graph perspective on max-min fairness in Gaussian parallel
  channels   In this work we are concerned with the problem of achieving max-min fairness
in Gaussian parallel channels with respect to a general performance function,
including channel capacity or decoding reliability as special cases. As our
central results, we characterize the laws which determine the value of the
achievable max-min fair performance as a function of channel sharing policy and
power allocation (to channels and users). In particular, we show that the
max-min fair performance behaves as a specialized version of the Lovasz
function, or Delsarte bound, of a certain graph induced by channel sharing
combinatorics. We also prove that, in addition to such graph, merely a certain
2-norm distance dependent on the allowable power allocations and used
performance functions, is sufficient for the characterization of max-min fair
performance up to some candidate interval. Our results show also a specific
role played by odd cycles in the graph induced by the channel sharing policy
and we present an interesting relation between max-min fairness in parallel
channels and optimal throughput in an associated interference channel.

14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
21
The categories of this paper are: adap-org
37
The categories of this paper are: supr-con
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
24
The categories of this paper are: dg-ga
18
The categories of this paper are: econ
0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
26
The categories of this paper are: bayes-an
16
The categories of this paper are: stat
10
The categories of this paper are: q-bio