Minimum-Weight Path in a Sparse Erdős-Rényi Graph with Signed Weights
We consider a sparse Erdős–Rényi graph G(n,λ/n) where each edge is assigned a random and independent signed weight. For two uniformly chosen vertices, we study the joint distribution of the total weights and hopcounts (number of edges) of the near-minimum weight paths connecting them. Under certain conditions on the weight distribution, we prove that the point process formed by the rescaled pairs of total weight and hopcount, converges weakly to a Poisson point process with a random intensity. This random intensity is characterized by the product of two independent copies of the Biggins martingale limit of certain branching random walk. This result generalizes the work of Daly, Schulte, and Shneer (Arxiv 2308.12149) from non-negative to signed weights. Joint work with Heng Ma (Technion).
Date: 20 October 2025, 14:00
Venue: Mathematical Institute, Woodstock Road OX2 6GG
Venue Details: L5
Speaker: Pascal Maillard (Toulouse)
Organising department: Department of Statistics
Part of: Probability seminar
Booking required?: Not required
Audience: Public
Editor: James Martin