Moments of Uniform Random Multigraphs with Fixed Degree Sequences

DOI10.1137/19M1288772zbMath1483.05154arXiv1909.09037OpenAlexW3093957239MaRDI QIDQ5037554

Philip Chodrow

Publication date: 1 March 2022

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

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

zbMATH Keywords

estimationMarkov chain Monte Carlorandom graphssocial networkscommunity structure

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Monte Carlo methods (65C05)

Related Items

Limitations of Chung Lu random graph generation

Cites Work

• Unnamed Item
• Maximum likelihood estimation in the \(\beta\)-model
• Random graphs with a given degree sequence
• A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs
• Fast uniform generation of regular graphs
• An efficient MCMC algorithm to sample binary matrices with fixed marginals
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Connected realizations of joint-degree matrices
• Connected components in random graphs with given expected degree sequences
• The mixing time of switch Markov chains: a unified approach
• Dual variational methods in critical point theory and applications
• Limit laws for self-loops and multiple edges in the configuration model
• Making multigraphs simple by a sequence of double edge swaps
• Mountain Passes and Saddle Points
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• Uniform generation of random regular graphs of moderate degree
• On Finding Graph Clusterings with Maximum Modularity
• An Exponential Family of Probability Distributions for Directed Graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Configuring Random Graph Models with Fixed Degree Sequences
• A critical point for random graphs with a given degree sequence
• Uncovering space-independent communities in spatial networks
• The number of graphs and a random graph with a given degree sequence
• Configuration models of random hypergraphs
• Clustering of sparse data via network communities—a prototype study of a large online market
• Fast unfolding of communities in large networks
• The switch Markov chain for sampling irregular graphs (Extended Abstract)
• The average distances in random graphs with given expected degrees
• Elements of Information Theory
• Computing and Combinatorics