Approximate sampling and counting of graphs with near-regular degree intervals

Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A sequential algorithm for generating random graphs
Modified logarithmic Sobolev inequalities in discrete settings
Fast uniform generation of regular graphs
Random generation of combinatorial structures from a uniform distribution
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
The asymptotic number of labeled graphs with given degree sequences
Discrete convex analysis
The switch Markov chain for sampling irregular graphs and digraphs
The flip Markov chain for connected regular graphs
Asymptotic enumeration by degree sequence of graphs of high degree
Discrete polymatroids
Markov chain decomposition for convergence rate analysis
Towards random uniform sampling of bipartite graphs with given degree sequence
Sampling hypergraphs with given degrees
Half-graphs, other non-stable degree sequences, and the switch Markov chain
Lorentzian polynomials
The mixing time of switch Markov chains: a unified approach
Modified logarithmic Sobolev inequalities for some models of random walk
Logarithmic Sobolev inequalities for finite Markov chains
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
Recent Developments in Discrete Convex Analysis
Generating Random Networks and Graphs
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Approximating the Permanent
Uniform sampling of bipartite graphs with degrees in prescribed intervals
Uniform generation of random regular graphs of moderate degree
On multivariate Newton-like inequalities
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
Uniform generation of random graphs with power-law degree sequences
Generating Random Regular Graphs Quickly
Uniform Generation of Random Regular Graphs
Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices
Uniform Sampling Through the Lovász Local Lemma
A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
Sampling Regular Graphs and a Peer-to-Peer Network
Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
Sampling binary contingency tables with a greedy start
Generating random regular graphs
Sampling from the Gibbs Distribution in Congestion Games
Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
Approximate sampling of graphs with near-\(P\)-stable degree intervals

This page was built for publication: Approximate sampling and counting of graphs with near-regular degree intervals