2024/02/07 by Alexandre Legrand, Legrand, Alexandre, Pascal Maillard +1
Computer Science · Physics and Astronomy · #60J80 #60K35 (Secondary) #68Q17 #82C21 (Primary) 60J70 #92D25 #Data Visualization and Analytics #FOS: Mathematics #Probability (math.PR) #Theoretical and Computational Physics #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.2402.04917
openalex publication_date 2024/02/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
The N-particle branching Brownian motion (N-BBM) is a branching Markov process which describes the evolution of a population of particles undergoing reproduction and selection. It has attracted a lot of interest due to its relations to the study of front propagation phenomena on the one hand, and to (hierarchical) physical p-spin models on the other hand, among which the continuous random energy model (CREM). This paper investigates the asymptotic displacement of the N-BBM in a time-inhomogeneous setting, and when the time horizon T and the number of particles N jointly tend to infinity. We estimate the maximal displacement of the process up to the second order, and show that the latter undergoes a transition at the scale log N≈ T1/3. In particular when log N≪ T1/3 we recover the Brunet-Derrida behavior which was proven in a time-homogeneous setting and for T→+∞ then N→+∞. Furthermore, our results can also be interpreted from the perspective of algorithmic optimisation on some spin glass models, since the time-inhomogeneous N-BBM can be seen as the realization of an optimization procedure called beam search on the aforementioned CREM. The CREM has been proven by L. Addario-Berry and the second author to undergo an algorithm hardness threshold phenomenon, and the results of the present paper describe precisely the efficiency of the beam search algorithm around that threshold.