Floodings of metric graphs (Q2182128): Difference between revisions

This paper studies the flooding on metric graphs, which examines the most likely location of \(M\) peaks with respect to the graph structure (given there are \(M\) peaks) when its vertices are randomly labeled. This is treated by introducing a sequence of subdivision metric graphs with vertex numbers tending to infinity, which are embedded in the underlying graph. Based on large deviation theory, it is shown that floodings are associated with entropy-like quantities, and the most likely flooding asymptotically is the one maximizes the entropy. Moreover, the floodings originated from different sources will only meet at the end. The obtain results are used to characterize the root vertex and an adjacent vertex of \(d\)-regular tree of depth at least 2 and \(d\) greater than or equal to 3.