Sampling hypergraphs with given degrees
نویسندگان
چکیده
There is a well-known connection between hypergraphs and bipartite graphs, obtained by treating the incidence matrix of hypergraph as biadjacency graph. We use this to describe analyse rejection sampling algorithm for simple uniform with given degree sequence. Our uses, black box, an A graphs degrees, uniformly or nearly uniformly, in (expected) polynomial time. The expected runtime depends on graph A, probability that random degrees corresponds hypergraph. give some conditions sequence which guarantee bounded below positive constant.
منابع مشابه
Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees
A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For n ≥ 3, let r = r(n) ≥ 3 be an integer and let k = (k1, . . . , kn) be a vector of nonnegative integers, where each kj = kj(n) may depend on n. Let M = M(n) = ∑n j=1 kj for all n ≥ 3, and define the set I = {n ≥ 3 | r(n) divides ...
متن کاملAsymptotic enumeration of sparse uniform hypergraphs with given degrees
Let r ≥ 2 be a fixed integer. For infinitely many n, let k = (k1, . . . , kn) be a vector of nonnegative integers such that their sum M is divisible by r. We present an asymptotic enumeration formula for simple r-uniform hypergraphs with degree sequence k. (Here “simple” means that all edges are distinct and no edge contains a repeated vertex.) Our formula holds whenever the maximum degree kmax...
متن کاملSampling graphs with given degrees and other combinatorial families
Sampling from combinatorial families can be difficult. However, complicated families can often be embedded within larger, simpler ones, for which easy sampling algorithms are known. We take advantage of such a relationship to describe a sampling algorithm for the smaller family, via a Markov chain started at a random sample of the larger family. The utility of the method is demonstrated via sev...
متن کاملColoring Uniform Hypergraphs with Small Edge Degrees
The degree of an edge e in a hypergraph G is the number of other edges of G intersecting e, and the maximum edge degree of G is the maximum over the degrees of its edges. A natural question is: Which bound on the maximum edge degree of an r-uniform hypergraph G provides that G is k-colorable? The classical result in this direction belongs to Erdős and Lovász. In their seminal paper [2] (where t...
متن کاملCounting loopy graphs with given degrees
Let d = (d1, d2, . . . , dn) be a vector of nonnegative integers. We study the number of symmetric 0-1 matrices whose row sum vector equals d. While previous work has focussed on the case of zero diagonal, we allow diagonal entries to equal 1. Specifically, for D ∈ {1, 2} we define the set GD(d) of all n × n symmetric 0-1 matrices with row sums given by d, where each diagonal entry is multiplie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112566