On the Swap-Distances of Different Realizations of a Graphical Degree Sequence

One of the first graph-theoretical problems to be given serious attention (in the 1950s) was the decision whether a given integer sequence is equal to the degree sequence of a simple graph (or graphical, for short). One method to solve this problem is the greedy algorithm of Havel and Hakimi, which...

Full description

Saved in:
Bibliographic Details
Published in:Combinatorics, probability & computing probability & computing, 2013-05, Vol.22 (3), p.366-383
Main Authors: Erdos, Peter L, Kiraly, Zoltan, Miklos, Istvan
Format: Article
Language:English
Subjects:
Combinatorial analysis
Computation
Graphs
Greedy algorithms
Sampling
Social networks
Transforms
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:One of the first graph-theoretical problems to be given serious attention (in the 1950s) was the decision whether a given integer sequence is equal to the degree sequence of a simple graph (or graphical, for short). One method to solve this problem is the greedy algorithm of Havel and Hakimi, which is based on the swap operation. Another, closely related question is to find a sequence of swap operations to transform one graphical realization into another of the same degree sequence. This latter problem has received particular attention in the context of rapidly mixing Markov chain approaches to uniform sampling of all possible realizations of a given degree sequence. (This becomes a matter of interest in the context of the study of large social networks, for example.) Previously there were only crude upper bounds on the shortest possible length of such swap sequences between two realizations. In this paper we develop formulae (Gallai-type identities) for the swap-distances of any two realizations of simple undirected or directed degree sequences. These identities considerably improve the known upper bounds on the swap-distances.
ISSN:0963-5483
1469-2163
DOI:10.1017/S0963548313000096