scientific article
From MaRDI portal
Publication:2921768
zbMath1297.05214MaRDI QIDQ2921768
Colin Cooper, Martin Dyer, Catherine Greenhill
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (11)
A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network ⋮ The switch Markov chain for sampling irregular graphs and digraphs ⋮ Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy ⋮ Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems ⋮ On Mixing and Edge Expansion Properties in Randomized Broadcasting ⋮ Sampling hypergraphs with given degrees ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ A randomized algorithm for the joining protocol in dynamic distributed networks ⋮ Short cycle distribution in random regular graphs recursively generated by pegging ⋮ Sampling binary contingency tables with a greedy start ⋮ Uniform generation of spanning regular subgraphs of a dense graph
This page was built for publication:
