Exact sampling of graphs with prescribed degree correlations

DOI10.1088/1367-2630/17/8/083052zbMath1454.05116arXiv1503.06725OpenAlexW3104242280MaRDI QIDQ5151598

Péter L. Erdős, K. E. Bassler, Charo I. del Genio, Zoltán Toroczkai, István Miklós

Publication date: 19 February 2021

Published in: New Journal of Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items

Half sampling on bipartite graphs ⋮ Neighborhood degree lists of graphs ⋮ Generating Maximally Disassortative Graphs with Given Degree Distribution ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ Network community detection using modularity density measures ⋮ Construction of Directed Assortative Configuration Graphs ⋮ Graphs with prescribed local neighborhoods of their universal coverings ⋮ An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem

Cites Work

• Unnamed Item
• Unnamed Item
• On realizations of a joint degree matrix
• Zero-one matrices with zero trace
• Generating simple random graphs with prescribed degree distribution
• A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
• Linear-time certifying algorithms for near-graphical sequences
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Relations between graphs and integer-pair sequences
• The asymptotic number of labeled graphs with given degree sequences
• Towards random uniform sampling of bipartite graphs with given degree sequence
• Complex networks: structure and dynamics
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• A remark on the existence of finite graphs
• Unbiased sampling of network ensembles
• Degree-based graph construction
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Switchings Constrained to 2-Connectivity in Simple Graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• A critical point for random graphs with a given degree sequence
• On the Swap-Distances of Different Realizations of a Graphical Degree Sequence
• Constructing and sampling directed graphs with given degree sequences
• A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
• Constructing and sampling graphs with a prescribed joint degree distribution
• Sampling Regular Graphs and a Peer-to-Peer Network
• Computing and Combinatorics
• A NEW MEASURE OF RANK CORRELATION