Fraud detection for random walks

DOI10.4230/LIPICS.ITCS.2024.36MaRDI QIDQ6906399zbMATH OpenFDO

Authors Varsha Dani, Thomas P. Hayes, Seth Pettie, Jared Saia

Publication date 4 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2024.36

zbMATH Keywords

fraud detectionMarkov chainsrandom processes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Algorand: a secure and efficient distributed ledger
• Benford's law. Theory and applications
• Benford's law. Theory, the general law of relative quantities, and forensic fraud detection applications
• Biased random walks
• Byzantine Agreement in Expected Polynomial Time
• Byzantine agreement in polynomial time with near-optimal resilience
• Communities, Random Walks, and Social Sybil Defense
• Concentration of Measure for the Analysis of Randomized Algorithms
• Distributed computation in dynamic networks via random walks
• Fast Byzantine agreement in dynamic networks
• Fast Byzantine leader election in dynamic networks
• On Playing Golf with Two Balls
• Perfect information leader election in \(\log^*n+O(1)\) rounds
• Rotor walks and Markov chains
• Scalable leader election
• The Bitcoin Backbone Protocol: Analysis and Applications

This page was built for publication: Fraud detection for random walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906399)