Pages that link to "Item:Q2921768"
From MaRDI portal
The following pages link to Sampling regular graphs and a peer-to-peer network (Q2921768):
Displaying 18 items.
- A randomized algorithm for the joining protocol in dynamic distributed networks (Q952446) (← links)
- The switch Markov chain for sampling irregular graphs and digraphs (Q1704570) (← links)
- The flip Markov chain for connected regular graphs (Q1720312) (← links)
- Sampling hypergraphs with given degrees (Q1981695) (← links)
- Uniform generation of spanning regular subgraphs of a dense graph (Q2335698) (← links)
- Scalable Uniform Graph Sampling by Local Computation (Q3006147) (← links)
- A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network (Q3497747) (← links)
- Short cycle distribution in random regular graphs recursively generated by pegging (Q3608313) (← links)
- (Q4529259) (← links)
- Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy (Q4609600) (← links)
- New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling (Q4643313) (← links)
- The flip markov chain and a randomising P2P protocol (Q5170311) (← links)
- On Mixing and Edge Expansion Properties in Randomized Broadcasting (Q5387757) (← links)
- Sampling Regular Graphs and a Peer-to-Peer Network (Q5437233) (← links)
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems (Q5892351) (← links)
- Sampling binary contingency tables with a greedy start (Q5898351) (← links)
- On the bias of traceroute sampling (Q5899511) (← links)
- On the bias of traceroute sampling (Q5901111) (← links)
