English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this paper we consider a simple model of random graph process with {\ithard} copying as follows: At each time step $t$, with probability $0<\alpha\leq1$ a new vertex $v_t$ is added and $m$ edges incident with $v_t$ are added inthe manner of {\it preferential attachment}; or with probability $1-\alpha$ anexisting vertex is copied uniformly at random. In this way, while a vertex withlarge degree is copied, the number of added edges is its degree and thus thenumber 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 ofvertices of degree $k$.

The Degree Sequence of a Scale-Free Random Graph Process with Hard Copying