TL;DR
This paper introduces an algorithm that estimates the number of walkers in an unknown graph by analyzing their return patterns to a specific point, advancing graph analysis techniques.
Contribution
The paper presents a novel algorithm for counting walkers in unknown graphs based on return observations, a new approach in graph analysis.
Findings
Successfully reconstructs walker counts from return data
Applicable to unknown graph structures
Advances methods in graph analysis
Abstract
We demonstrate an algorithm that reconstructs the number of walkers in an unknown graph from observations of their returns to a fixed point.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Advanced Bandit Algorithms Research · Data Management and Algorithms