Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Degree Sequence of a Scale-Free Random Graph Process with Hard
  Copying   In this paper we consider a simple model of random graph process with {\it
hard} copying as follows: At each time step $t$, with probability $0<\alpha\leq
1$ a new vertex $v_t$ is added and $m$ edges incident with $v_t$ are added in
the manner of {\it preferential attachment}; or with probability $1-\alpha$ an
existing vertex is copied uniformly at random. In this way, while a vertex with
large degree is copied, the number of added edges is its degree and thus the
number of added edges is not upper bounded. We prove that, in the case of
$\alpha$ being large enough, the model possesses a mean degree sequence as $
d_{k}\sim Ck^{-(1+2\alpha)}$, where $d_k$ is the limit mean proportion of
vertices of degree $k$.

6
The categories of this paper are: astro-ph
19
The categories of this paper are: eess
16
The categories of this paper are: stat
10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin
8
The categories of this paper are: hep-ex
5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
14
The categories of this paper are: math-ph
37
The categories of this paper are: supr-con
4
The categories of this paper are: cond-mat
30
The categories of this paper are: q-alg
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
20
The categories of this paper are: acc-phys
11
The categories of this paper are: hep-lat