Assortativity and bidegree distributions on Bernoulli random graph superpositions
From MaRDI portal
(Redirected from Publication:5051201)
Abstract: A probabilistic generative network model with nodes and overlapping layers is obtained as a superposition of mutually independent Bernoulli random graphs of varying size and strength. When and are large and of the same order of magnitude, the model admits a sparse limiting regime with a tunable power-law degree distribution and nonvanishing clustering coefficient. In this article we prove an asymptotic formula for the joint degree distribution of adjacent nodes. This yields a simple analytical formula for the model assortativity, and opens up ways to analyze rank correlation coefficients suitable for random graphs with heavy-tailed degree distributions. We also study the effects of power laws on the asymptotic joint degree distributions.
Recommendations
Cites work
- A spatial web graph model with local influence regions
- Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions
- Assortativity and clustering of sparse random intersection graphs
- Clustering in a hyperbolic model of complex networks
- Community detection and stochastic block models: recent developments
- Convergence of rank based degree-degree correlations in random directed networks
- Correction methods for ties in rank correlations
- Degree and clustering coefficient in sparse random intersection graphs
- Degree-degree dependencies in directed networks with heavy-tailed degrees
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
- Epidemics on Random Graphs with Tunable Clustering
- Epidemics on random intersection graphs
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 5004850 (Why is no real title available?)
- scientific article; zbMATH DE number 5299204 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 5070369 (Why is no real title available?)
- Introduction to Random Graphs
- Moment-based parameter estimation in binomial random intersection graph models
- On local weak limit and subgraph counts for sparse random graphs
- On Random Intersection Graphs: The Subgraph Problem
- On rank correlation measures for non-continuous random variables
- On the largest component of a hyperbolic model of complex networks
- On the number of non-zero elements of joint degree vectors
- On the second largest component of random hyperbolic graphs
- Optimal Transport
- Ordinal Measures of Association
- Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
- Robustness of scale-free spatial networks
- Statistical mechanics of complex networks
- The phase transition in inhomogeneous random graphs
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- The Structure and Function of Complex Networks
- Two Models of Random Intersection Graphs and their Applications
Cited in
(2)
This page was built for publication: Assortativity and bidegree distributions on Bernoulli random graph superpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5051201)