科学研究
学术报告
Front Propagation and Blocking in Metric Graphs
邀请人:郭宏俊
发布时间:2026-11-17浏览次数:

题目:Front Propagation and Blocking in Metric Graphs
报告人:Prof. Hiroshi Matano(Meiji University)
地点:致远楼101室
时间:2026年12月2日 星期三 10:00-11:00
Abstract:Reaction-diffusion equations on metric graphs are receiving growing attention these days. Roughly speaking, a metric graph is a directed graph whose edges have a length scale. In this lecture, I will consider a bistable reaction-diffusion equation on a metric graph and discuss the propagation and blocking of the solution fronts. More precisely, our graph Ω consists of the center graph D, which is an arbitrary bounded finite graph, and a finite number of unbounded edges Ω₁, …, Ω_N emanating from D, which we call the "outer paths". The goal is to investigate whether a solution front traveling from infinity along a given outer path Ωᵢ can propagate into another outer path Ωⱼ after passing through the center graph or is blocked by D. The answer depends sensitively on the geometry of the center graph D. I first focus on general principles that apply universally regardless of the structure of the center graph D. I will then apply the general theory to specific examples. This is joint work with Shuichi Jimbo of Hokkaido University.

欢迎各位参加!