Sampling regular graphs and a peer-to-peer network
From MaRDI portal
Recommendations
- Sampling Regular Graphs and a Peer-to-Peer Network
- A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs
- The switch Markov chain for sampling irregular graphs (extended abstract)
- The flip Markov chain and a randomising P2P protocol
- scientific article; zbMATH DE number 6783443
Cited in
(20)- The switch Markov chain for sampling irregular graphs and digraphs
- The flip Markov chain for connected regular graphs
- Sampling hypergraphs with given degrees
- Uniform generation of spanning regular subgraphs of a dense graph
- Scalable Uniform Graph Sampling by Local Computation
- A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network
- Short cycle distribution in random regular graphs recursively generated by pegging
- scientific article; zbMATH DE number 1743766 (Why is no real title available?)
- Network-ensemble comparisons with stochastic rewiring and von Neumann entropy
- New classes of degree sequences with fast mixing swap Markov chain sampling
- The flip Markov chain and a randomising P2P protocol
- On Mixing and Edge Expansion Properties in Randomized Broadcasting
- Sampling Regular Graphs and a Peer-to-Peer Network
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Sampling binary contingency tables with a greedy start
- On the bias of traceroute sampling
- On the bias of traceroute sampling
- Time- and communication-efficient overlay network construction via gossip
- Towards communication-efficient Peer-to-Peer networks
- A randomized algorithm for the joining protocol in dynamic distributed networks
This page was built for publication: Sampling regular graphs and a peer-to-peer network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921768)
