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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A Chung-Lu random graph is an inhomogeneous Erd\H{o}s-R\'enyi random graph inwhich vertices are assigned average degrees, and pairs of vertices areconnected by an edge with a probability that is proportional to the product oftheir average degrees, independently for different edges. We derive a centrallimit theorem for the principal eigenvalue and the components of the principaleigenvector of the adjacency matrix of a Chung-Lu random graph. Our derivationrequires certain assumptions on the average degrees that guaranteeconnectivity, sparsity and bounded inhomogeneity of the graph.

Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs