May 10, 2018 / / in cs updates on arXiv.org / with No comments /
We study the relaxation time in the random walk with jumps. The random walk with jumps combines random walk based sampling with uniform node sampling and improves the performance of network analysis and learning tasks. We derive various conditions under which the relaxation time decreases with the introduction of jumps.
Adapting control policies from simulation to reality using a pairwise loss. (arXiv:1807.10413v1 [cs.RO])Performance Analysis of User-centric Virtual Cell Dense Networks over mmWave Channels. (arXiv:1807.10396v1 [cs.IT])Entropic Latent Variable Discovery. (arXiv:1807.10399v1 [stat.ML])Perturbation Robust Representations of Topological Persistence Diagrams. (arXiv:1807.10400v1 [cs.CV])Witness Algebra and Anyon Braiding. (arXiv:1807.10414v1 [quant-ph])
0 comments:
Post a Comment