DeepAI AI Chat
Log In Sign Up

Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades

by   Corrie Jacobien Carstens, et al.

Graph randomisation is an important task in the analysis and synthesis of networks. It is typically implemented as an iterative edge switching process swapping the endpoints of randomly selected edge pairs while maintaining the nodes' degrees. Curveball is a novel approach that considers the whole neighbourhoods of randomly drawn node pairs. It was shown that the underlying Markov chain converges to a uniform distribution, and experiments suggest that it requires less steps than the established edge switching process. We describe the first external memory Curveball algorithm EM-CB for simple undirected graphs and its internal memory counterpart IM-CB. Further, we introduce the notation of a global trade processing (almost) every node in a graph during a single super step, and show that global trades converge to a uniform distribution. We then discuss the parallel external memory algorithm EM-PGCB for global trades and give experimental evidence that EM-PGCB achieves the quality of the state-of-the-art external memory edge switching algorithm EM-ES nearly one order of magnitude faster.


page 1

page 2

page 3

page 4


Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees

The uniform sampling of simple graphs matching a prescribed degree seque...

Efficient Dispersion of Mobile Agents without Global Knowledge

We consider the dispersion problem for mobile agents. Initially, k agent...

Switching 3-edge-colorings of cubic graphs

The chromatic index of a cubic graph is either 3 or 4. Edge-Kempe switch...

A Markov chain on the solution space of edge-colorings of bipartite graphs

In this paper, we exhibit an irreducible Markov chain M on the edge k-co...

Edge Detection using Stationary Wavelet Transform, HMM, and EM algorithm

Stationary Wavelet Transform (SWT) is an efficient tool for edge analysi...

FUSED-PAGERANK: Loop-Fusion based Approximate PageRank

PageRank is a graph centrality metric that gives the importance of each ...