Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Graph-Based Lossless Markov Lumpings   We use results from zero-error information theory to determine the set of
non-injective functions through which a Markov chain can be projected without
losing information. These lumping functions can be found by clique partitioning
of a graph related to the Markov chain. Lossless lumping is made possible by
exploiting the (sufficiently sparse) temporal structure of the Markov chain.
Eliminating edges in the transition graph of the Markov chain trades the
required output alphabet size versus information loss, for which we present
bounds.

13
The categories of this paper are: quant-ph
15
The categories of this paper are: nucl-ex
22
The categories of this paper are: chao-dyn
37
The categories of this paper are: supr-con
7
The categories of this paper are: hep-th
16
The categories of this paper are: stat
29
The categories of this paper are: funct-an
5
The categories of this paper are: gr-qc
0
The categories of this paper are: hep-ph
31
The categories of this paper are: ao-sci
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
36
The categories of this paper are: cmp-lg
27
The categories of this paper are: comp-gas
10
The categories of this paper are: q-bio
19
The categories of this paper are: eess