3 papers
math.PR2024
Local limit of massive spanning forests on the complete graph
Matteo D'Achille, Nathanaël Enriquez, Paul Melotti
We identify the local limit of massive spanning forests on the complete graph. This generalizes a well-known theorem of Grimmett on the local limit of uniform spanning trees on the…
math.CO2015
A probabilistic Hadwiger-Nelson problem
Thomas Bourgeat, Marc Heinrich, Paul Melotti +1
If you color a table using k colors, and throw a needle randomly on it, for some proper definition, you get a certain probability that the endpoints will fall on different colors.…
cs.CV2014
New Algorithmic Approaches to Point Constellation Recognition
Thomas Bourgeat, Julien Bringer, Herve Chabanne +7
Point constellation recognition is a common problem with many pattern matching applications. Whilst useful in many contexts, this work is mainly motivated by fingerprint matching.…