Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks

Consider a random preferential attachment model $G(p)$ for network evolution that allows both node and edge arrivals. Starting with an arbitrary nonempty graph $G_0$, at each time step, there are two