Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees

DOI10.1080/15427951.2013.850455zbMath1465.05167arXiv1202.3071OpenAlexW2097625489MaRDI QIDQ4985358

Nelly Litvak, Remco van der Hofstad

Publication date: 23 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.3071

zbMATH Keywords

disassortative networksassortative networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items

Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions, Assortativity and bidegree distributions on Bernoulli random graph superpositions, Higher order assortativity in complex networks, Generating Maximally Disassortative Graphs with Given Degree Distribution, Optimal subgraph structures in scale-free configuration models, Assortativity in generalized preferential attachment models, Nonuniversality of weighted random graphs with infinite variance degree, Degree-degree distribution in a power law random intersection graph with clustering, Limit theorems for assortativity and clustering in null models for scale-free networks

Uses Software

• WebGraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rank correlation measures for non-continuous random variables
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Computing the nonnull asymptotic variance and the asymptotic relative efficiency of Spearman's rank correlation
• Copulas: Tales and facts (with discussion)
• Weighted sums of certain dependent random variables
• The degree sequence of a scale-free random graph process
• Critical behavior in inhomogeneous random graphs
• Statistical mechanics of complex networks
• An Inner-Outer Iteration for Computing PageRank
• The Statistical Mechanics of Complex Product Development: Empirical and Analytical Results
• The Probability That a Random Multigraph is Simple
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• A Brief History of Generative Models for Power Law and Lognormal Distributions
• A critical point for random graphs with a given degree sequence
• Probability Inequalities for Sums of Bounded Random Variables
• Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model
• On the properties of some nonparametric concordance measures in the discrete case
• Heavy-Tail Phenomena
• Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
• A NEW MEASURE OF RANK CORRELATION
• On Local Estimations of PageRank: A Mean Field Approach
• Networks