Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Complexity of Networks   Network or graph structures are ubiquitous in the study of complex systems.
Often, we are interested in complexity trends of these system as it evolves
under some dynamic. An example might be looking at the complexity of a food web
as species enter an ecosystem via migration or speciation, and leave via
extinction.
  In this paper, a complexity measure of networks is proposed based on the {\em
complexity is information content} paradigm. To apply this paradigm to any
object, one must fix two things: a representation language, in which strings of
symbols from some alphabet describe, or stand for the objects being considered;
and a means of determining when two such descriptions refer to the same object.
With these two things set, the information content of an object can be computed
in principle from the number of equivalent descriptions describing a particular
object.
  I propose a simple representation language for undirected graphs that can be
encoded as a bitstring, and equivalence is a topological equivalence. I also
present an algorithm for computing the complexity of an arbitrary undirected
network.

10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
11
The categories of this paper are: hep-lat
4
The categories of this paper are: cond-mat
12
The categories of this paper are: nucl-th
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex
19
The categories of this paper are: eess
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
25
The categories of this paper are: patt-sol
32
The categories of this paper are: atom-ph
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg