Connectivity as an expected value
The paper reports an expected connectivity of 207.79 after the collapse and 208.22 after reconstruction. The difference is small in absolute terms but indicates the bridge’s structural role in the network.
2025美赛D题论文
A transport-network resilience study of the Baltimore bridge collapse using directed graphs, random walks, Monte Carlo simulation and reconstruction scenarios.
25p
MCM paper
10k
random-walk simulations
2.1%
post-collapse disturbance impact
01 / Overview
The 2025 MCM paper studies how the Francis Scott Key Bridge collapse changes Baltimore’s transport-network connectivity and stability. It models the city as a directed graph and compares the collapsed, reconstructed and random-disturbance scenarios.
Objectives
Competition narrative
The page foregrounds the modelling decision and result before implementation details.
Stage 01
Nodes and directed routes with bridge-dependent links.
Stage 02
Repeated movement simulation over the graph.
Stage 03
Expected reachable connectivity across simulations.
Stage 04
Random edge failures and response comparison.
Stage 05
Post-collapse versus post-reconstruction comparison.
02 / Package highlights
03 / Model
The paper reports an expected connectivity of 207.79 after the collapse and 208.22 after reconstruction. The difference is small in absolute terms but indicates the bridge’s structural role in the network.
Random disturbances reduce expected connectivity by about 2.1% in the collapsed state and only about 0.99% after reconstruction. This separates the immediate connectivity level from the network’s resilience to further shocks.
04 / Key code
Only verified source excerpts and pseudocode taken from the project papers are shown.
Algorithm outline stated in the MCM paper; this is not claimed as original executable source.
PROCEDURE RANDOM_WALK_CONNECTIVITY(G, start, steps)
visited <- {start}
node <- start
REPEAT steps TIMES
neighbours <- OUTGOING_NEIGHBOURS(G, node)
IF neighbours IS EMPTY THEN BREAK
node <- RANDOM_CHOICE(neighbours)
visited <- visited UNION {node}
RETURN |visited| / |V(G)|
END PROCEDURE
PROCEDURE EXPECTED_CONNECTIVITY(G, runs)
total <- 0
REPEAT runs TIMES
start <- RANDOM_CHOICE(V(G))
total <- total + RANDOM_WALK_CONNECTIVITY(G, start, 500)
RETURN total / runs
END PROCEDUREPaper-level Monte Carlo outline for collapsed and reconstructed network states.
FOR EACH scenario IN {post_collapse, post_reconstruction}
baseline <- EXPECTED_CONNECTIVITY(scenario.graph, 10000)
disturbances <- EMPTY LIST
REPEAT 100 TIMES
G' <- COPY(scenario.graph)
REMOVE_RANDOM_EDGES(G', fraction = 5%)
disturbances.APPEND(EXPECTED_CONNECTIVITY(G', 10000))
disturbed_mean <- MEAN(disturbances)
change_pct <- (disturbed_mean - baseline) / baseline * 100
END FORReproducibility notes
Limitations / next steps
05 / Downloads
Open the original report, presentation or source archive. PDF cover pages with private details were removed.
25-page competition paper on traffic-network resilience.