The Probability of Coincidence in Citation and Alphabetical Ordering an Exhaustive Analysis of the Rencontres Problem

This analysis explores the likelihood that a reference's original citation number, based on its initial position in the text, matches its final number after sorting the bibliography alphabetically. It models this as counting the fixed points in a random permutation—a classic problem in combinatorial probability known as the Rencontres or Hat-Check problem—assuming a uniform random order. Using the Principle of Inclusion-Exclusion, an exact probability mass function for the number of references (n) with exactly k matches is derived, based on derangements. The study reveals a key asymptotic result: as n grows, the distribution of matches quickly and strongly approaches a Poisson distribution with a mean of λ=1. This means that for typical bibliography sizes (n ≥ 10), the chance of any given number of matches becomes nearly independent of total references. Thus, the expected number of matches remains 1, regardless of the bibliography's length. The study also provides specific probabilities for at least k matches, computed via the Poisson approximation and involving the Incomplete Gamma Function. Notably, there is a 63.2% chance of at least one match, 26.4% for two or more, and 8.0% for three or more, indicating that multiple coincidences are rare. By distinguishing this from phenomena like the Birthday Paradox and highlighting its use in assessing shuffling algorithms and cryptographic security, the report presents a clear framework for understanding fixed-point matches in permutations. It concludes that despite the apparent randomness of reordering references, the number of matches follows a strict, predictable probabilistic law governed by the constant e.

Rencontres problem, Fixed points in permutations, Derangements, Poisson distribution, Citation ordering

1. Arratia, R., & Desalvo, S. (2016, June). Poisson and independent process approximation for random combinatorial structures with a given number of components, and near-universal behavior for low rank assemblies. ResearchGate. Retrieved December 31, 2025, from [Google Scholar] [Crossref]

2. https://www.researchgate.net/publication/303993076_Poisson_and_independent_process_approximation_for_random_combinatorial_structures_with_a_given_number_of_components_and_near-universal_behavior_for_low_rank_assemblies [Google Scholar] [Crossref]

3. Arratia, R., Barbour, A. D., & Tavaré, S. (2003, December). Logarithmic Combinatorial Structures: A Probabilistic Approach. ResearchGate. Retrieved December 31, 2025, from [Google Scholar] [Crossref]

4. https://www.researchgate.net/publication/240097339_Logarithmic_Combinatorial_Structures_a_Probabilistic_Approach [Google Scholar] [Crossref]

5. Brizzi, M., Nani, D., & Betti, L. (2021, December). Poisson distribution and process as a well-fitting pattern for counting variables in biologic models. International Journal of High Dilution Research. Retrieved December 31, 2025, from [Google Scholar] [Crossref]

6. https://www.researchgate.net/publication/357252061_Poisson_distribution_and_process_as_a_well-fitting_pattern_for_counting_variables_in_biologic_models [Google Scholar] [Crossref]

7. Diaconis, P., Fulman, J., & Guralnick, R. (2007, September). On fixed points of permutations. Journal of Algebraic Combinatorics. Retrieved December 31, 2025, from [Google Scholar] [Crossref]

8. https://www.researchgate.net/publication/1760933_On_fixed_points_of_permutations [Google Scholar] [Crossref]

9. Feller, W. (1968). An Introduction to Probability Theory and Its Applications (3rd ed.). Wiley. [Google Scholar] [Crossref]

10. Hashempour, M., Mohammadi, M., & Doostparast, M. (2025, December). Statistical Inference for Load-Sharing Systems with Heterogeneous Populations Using Sequential Order Statistics. ResearchGate. Retrieved December 31, 2025, from [Google Scholar] [Crossref]

11. https://www.researchgate.net/publication/398840264_Statistical_Inference_for_Load-Sharing_Systems_with_Heterogeneous_Populations_Using_Sequential_Order_Statistics [Google Scholar] [Crossref]

12. HASHIMOTO, Y., NUIDA, K., Shinagawa, K., INAMURA, M., & Hanaoka, G. (2018, September). Toward Finite-Runtime Card-Based Protocol for Generating a Hidden Random Permutation without Fixed Points. IEICE Transactions on Fundamentals of Electronics. Retrieved December 31, 2025, from https://www.researchgate.net/publication/327379955_Toward_Finite-Runtime_Card-Based_Protocol_for_Generating_a_Hidden_Random_Permutation_without_Fixed_Points [Google Scholar] [Crossref]

13. Kuba, M. (2025, February). A note on mixed Poisson distributions. ResearchGate. Retrieved December 31, 2025, from [Google Scholar] [Crossref]

14. https://www.researchgate.net/publication/388954982_A_note_on_mixed_Poisson_distributions [Google Scholar] [Crossref]

15. Lawrence, W. (2025, December). Theory of Derived Probability and Entanglement Compression. ResearchGate. Retrieved December 31, 2025, from [Google Scholar] [Crossref]

16. https://www.researchgate.net/publication/397000891_Theory_of_Derived_Probability_and_Entanglement_Compression [Google Scholar] [Crossref]

17. Lindo, A., & Sagitov, S. (2015, July). Asymptotic results for the number of Wagner's solutions to a generalised birthday problem. Statistics & Probability Letters. Retrieved December 31, 2025, from https://www.researchgate.net/publication/280243331_Asymptotic_results_for_the_number_of_Wagner's_solutions_to_a_generalised_birthday_problem [Google Scholar] [Crossref]

18. Mantalos, P., & Zografos, K. (2008, December). Interval estimation for a binomial proportion: A bootstrap approach. Journal of Statistical Computation and Simulation. Retrieved December 31, 2025, from https://www.researchgate.net/publication/243043021_Interval_estimation_for_a_binomial_proportion_A_bootstrap_approach [Google Scholar] [Crossref]

19. Pan, Q., Wang, Y., & Zeng, J. (2025, December 1). Counting permutations by alternating runs via Hetyei-Reiner trees. ResearchGate. Retrieved December 31, 2025, from [Google Scholar] [Crossref]

20. https://www.researchgate.net/publication/398721020_Counting_permutations_by_alternating_runs_viaHetyei-Reiner_trees [Google Scholar] [Crossref]

21. Pinsky, R. G. (2025, May). The inversion statistic in derangements and in other permutations with a prescribed number of fixed points. ResearchGate. Retrieved December 31, 2025, from https://www.researchgate.net/publication/391461367_The_inversion_statistic_in_derangements_and_in_other_permutations_with_a_prescribed_number_of_fixed_points [Google Scholar] [Crossref]

22. Riordan, J. (1958). An Introduction to Combinatorial Analysis. Wiley. [Google Scholar] [Crossref]

23. Ross, S. M. (2014). Introduction to Probability Models (11th ed.). Academic Press. [Google Scholar] [Crossref]

• Predictive Health Monitoring Systems for Electric Vehicle Powertrains Using Edge AI and CAN Bus Data
• Internship Portals: A Systematic Review of Current Platforms and Future Directions
• Towards Better Urban Mobility: A Comprehensive Assessment of Pedestrian Infrastructure in Naval, Biliran Province, Philippines
• An Affordable and Sustainable Efficient Color Sorting System Using Arduino and TCS3200 Sensor
• Financial Stress and Mobility Patterns: Implication for Transportation Policy Among Jeepney Passengers