On uniform sampling simple directed graph realizations of degree sequences
نویسنده
چکیده
Choosing a uniformly sampled simple directed graph realization of a degree sequence has many applications, in particular in social networks where self-loops are commonly not allowed. It has been shown in the past that one can perform a Markov chain arc-switching algorithm to sample a simple directed graph uniformly by performing two types of switches: a 2-switch and a directed 3-cycle reorientation. This paper discusses under what circumstances a directed 3-cycle reorientation is required. In particular, the class of degree sequences where this is required is a subclass of the directed 3-cycle anchored degree sequences. An important implication of this result is a reduced Markov chain algorithm that uses only 2-switches.
منابع مشابه
New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling
In network modeling of complex systems one is often required to sample random realizations of networks that obey a given set of constraints, often in form of graph measures. A much studied class of problems targets uniform sampling of simple graphs with given degree sequence or also with given degree correlations expressed in the form of a joint degree matrix. One approach is to use Markov chai...
متن کاملUniform sampling of undirected and directed graphs with a fixed degree sequence
Many applications in network analysis require algorithms to sample uniformly at random from the set of all graphs with a prescribed degree sequence. We present a Markov chain based approach which converges to the uniform distribution of all realizations for both the directed and undirected case. It remains an open challenge whether these Markov chains are rapidly mixing. For the case of directe...
متن کاملEfficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet modeling. Existing graph sampling methods are either link-swap based (Markov-Chain Monte Carlo algorithms) or stub-matching based (the Configuration Model). Both t...
متن کاملOn Fractional Realizations of Graph Degree Sequences
We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope; we characterize degree sequences for which each polytope vertex corresponds to a simple graph realization. These include the degree sequences of threshold and pseudo-split graphs, and we characterize their re...
متن کاملA Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs
One of the simplest ways to decide whether a given finite sequence of positive integers can arise as the degree sequence of a simple graph is the greedy algorithm of Havel and Hakimi. This note extends their approach to directed graphs. It also studies cases of some simple forbidden edge-sets. Finally, it proves a result which is useful to design an MCMC algorithm to find random realizations of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0912.3834 شماره
صفحات -
تاریخ انتشار 2009