Hiroshi Isozaki
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hiroshi Isozaki has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Evgeny Korotyaev
Saint-Petersburg State University, St. Petersburg, Russia
11 shared publications - Hisashi Morioka
Graduate School of Science and Engineering, Ehime University, Matsuyama, Japan
8 shared publications - Kazunori Ando
Department of Electrical and Electronic Engineering and Computer Science, Ehime University, Ehime, Japan
4 shared publications - Emilia Blåsten
LUT University
3 shared publications - Jinpeng Lu
Department of Mathematics and Statistics, University of Helsinki, Helsinki, Finland
3 shared publications - Matti Lassas
University of Helsinki, Finland
3 shared publications
Latest Publications
- 12 December 2025
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 49 (7) , 5939-5971
Radiation Condition for Elastic Wave Equations in a Perturbed Half‐Space in ℝ3
We introduce a radiation condition for the stationary elastic wave equation with a free boundary condition in a locally perturbed half space in , and prove the uniqueness of the scattering solution.
- 12 December 2025
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 49 (7) , 5939-5971
Radiation Condition for Elastic Wave Equations in a Perturbed Half‐Space in ℝ3
We introduce a radiation condition for the stationary elastic wave equation with a free boundary condition in a locally perturbed half space in , and prove the uniqueness of the scattering solution.
- Open Access
Scattering for time periodic Hamiltonians on graphs
We develop a scattering theory for time-periodic Hamiltonians on discrete graphs, including long-range potentials with zero average for the period, and show the existence and completeness of wave operators.
Open AccessScattering for time periodic Hamiltonians on graphs
We develop a scattering theory for time-periodic Hamiltonians on discrete graphs, including long-range potentials with zero average for the period, and show the existence and completeness of wave operators.
- Open Access
Inverse problems for quantum graph associated with square and hexagonal lattices
We solve inverse problems from the D-N map for the quantum graph on a finite domain in a square lattice and that on a hexagonal lattice, as well as inverse scattering problems from the S-matrix for a locally perturbed square lattice and a hexagonal lattice.
Open AccessInverse problems for quantum graph associated with square and hexagonal lattices
We solve inverse problems from the D-N map for the quantum graph on a finite domain in a square lattice and that on a hexagonal lattice, as well as inverse scattering problems from the S-matrix for a locally perturbed square lattice and a hexagonal lattice.
- 26 June 2023
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 46 (15) , 16318-16380
Asymptotic behavior of stationary solutions to elastic wave equations in a perturbed half‐space in ℝ3$ {\mathrm{\mathbb{R}}}^3 $- 26 June 2023
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 46 (15) , 16318-16380
Asymptotic behavior of stationary solutions to elastic wave equations in a perturbed half‐space in ℝ3$ {\mathrm{\mathbb{R}}}^3 $- Open Access
Gel'fand's inverse problem for the graph Laplacian
We study the discrete Gel'fand's inverse boundary spectral problem of determining a finite weighted graph. Suppose that the set of vertices of the graph is a union of two disjoint sets: $X=B\cup G$, where $B$ is called the set of the boundary vertices and $G$ is called the set of the interior vertices. We consider the case where the vertices in the set $G$ and the edges connecting them are unknown. Assume that we are given the set $B$ and the pairs $(\lambda_j,\phi_j|_B)$, where $\lambda_j$ are the eigenvalues of the graph Laplacian and $\phi_j|_B$ are the values of the corresponding eigenfunctions at the vertices in $B$. We show that the graph structure, namely the unknown vertices in $G$ and the edges connecting them, along with the weights, can be uniquely determined from the given data, if every boundary vertex is connected to only one interior vertex and the graph satisfies the following property: any subset $S\subseteq G$ of cardinality $|S|\geqslant 2$ contains two extreme points. A point $x\in S$ is called an extreme point of $S$ if there exists a point $z\in B$ such that $x$ is the unique nearest point in $S$ from $z$ with respect to the graph distance. This property is valid for several standard types of lattices and their perturbations.Open AccessGel'fand's inverse problem for the graph Laplacian
We study the discrete Gel'fand's inverse boundary spectral problem of determining a finite weighted graph. Suppose that the set of vertices of the graph is a union of two disjoint sets: $X=B\cup G$, where $B$ is called the set of the boundary vertices and $G$ is called the set of the interior vertices. We consider the case where the vertices in the set $G$ and the edges connecting them are unknown. Assume that we are given the set $B$ and the pairs $(\lambda_j,\phi_j|_B)$, where $\lambda_j$ are the eigenvalues of the graph Laplacian and $\phi_j|_B$ are the values of the corresponding eigenfunctions at the vertices in $B$. We show that the graph structure, namely the unknown vertices in $G$ and the edges connecting them, along with the weights, can be uniquely determined from the given data, if every boundary vertex is connected to only one interior vertex and the graph satisfies the following property: any subset $S\subseteq G$ of cardinality $|S|\geqslant 2$ contains two extreme points. A point $x\in S$ is called an extreme point of $S$ if there exists a point $z\in B$ such that $x$ is the unique nearest point in $S$ from $z$ with respect to the graph distance. This property is valid for several standard types of lattices and their perturbations. - Open Access
Inverse problems for discrete heat equations and random walks for a class of graphs
We study the inverse problem of determining a finite weighted graph $(X,E)$ from the source-to-solution map on a vertex subset $B\subset X$ for heat equations on graphs, where the time variable can be either discrete or continuous. We prove that this problem is equivalent to the discrete version of the inverse interior spectral problem, provided that there does not exist a nonzero eigenfunction of the weighted graph Laplacian vanishing identically on $B$. In particular, we consider inverse problems for discrete-time random walks on finite graphs. We show that under a novel geometric condition (called the Two-Points Condition), the graph structure and the transition matrix of the random walk can be uniquely recovered from the distributions of the first passing times on $B$, or from the observation on $B$ of one realization of the random walk.Open AccessInverse problems for discrete heat equations and random walks for a class of graphs
We study the inverse problem of determining a finite weighted graph $(X,E)$ from the source-to-solution map on a vertex subset $B\subset X$ for heat equations on graphs, where the time variable can be either discrete or continuous. We prove that this problem is equivalent to the discrete version of the inverse interior spectral problem, provided that there does not exist a nonzero eigenfunction of the weighted graph Laplacian vanishing identically on $B$. In particular, we consider inverse problems for discrete-time random walks on finite graphs. We show that under a novel geometric condition (called the Two-Points Condition), the graph structure and the transition matrix of the random walk can be uniquely recovered from the distributions of the first passing times on $B$, or from the observation on $B$ of one realization of the random walk. - Open Access
Inverse scattering on the quantum graph -- Edge model for graphen
We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported, we show that the S-matrix for all energies in any open set in the continuous spectrum determines the potentials.
Open AccessInverse scattering on the quantum graph -- Edge model for graphen
We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported, we show that the S-matrix for all energies in any open set in the continuous spectrum determines the potentials.
- Open Access
Continuum limit for lattice Schrödinger operators
We study the behavior of solutions of the Helmholtz equation $(- \Delta_{disc,h} - E)u_h = f_h$ on a periodic lattice as the mesh size $h$ tends to 0. Projecting to the eigenspace of a characteristic root $\lambda_h(\xi)$ and using a gauge transformation associated with the Dirac point, we show that the gauge transformed solution $u_h$ converges to that for the equation $(P(D_x) - E)v = g$ for a continuous model on ${\bf R}^d$, where $\lambda_h(\xi) \to P(\xi)$. For the case of the hexagonal and related lattices, {in a suitable energy region}, it converges to that for the Dirac equation. For the case of the square lattice, triangular lattice, {hexagonal lattice (in another energy region)} and subdivision of a square lattice, one can add a scalar potential, and the solution of the lattice Schr{\"o}dinger equation $( - \Delta_{disc,h} +V_{disc,h} - E)u_h = f_h$ converges to that of the continuum Schr{\"o}dinger equation $(P(D_x) + V(x) -E)u = f$.Open AccessContinuum limit for lattice Schrödinger operators
We study the behavior of solutions of the Helmholtz equation $(- \Delta_{disc,h} - E)u_h = f_h$ on a periodic lattice as the mesh size $h$ tends to 0. Projecting to the eigenspace of a characteristic root $\lambda_h(\xi)$ and using a gauge transformation associated with the Dirac point, we show that the gauge transformed solution $u_h$ converges to that for the equation $(P(D_x) - E)v = g$ for a continuous model on ${\bf R}^d$, where $\lambda_h(\xi) \to P(\xi)$. For the case of the hexagonal and related lattices, {in a suitable energy region}, it converges to that for the Dirac equation. For the case of the square lattice, triangular lattice, {hexagonal lattice (in another energy region)} and subdivision of a square lattice, one can add a scalar potential, and the solution of the lattice Schr{\"o}dinger equation $( - \Delta_{disc,h} +V_{disc,h} - E)u_h = f_h$ converges to that of the continuum Schr{\"o}dinger equation $(P(D_x) + V(x) -E)u = f$. - 31 July 2019
- Published by Springer Nature in The Journal of Geometric Analysis
- Vol. 30 (4) , 4427-4452
Inverse Spectral Theory for Perturbed Torus
- 31 July 2019
- Published by Springer Nature in The Journal of Geometric Analysis
- Vol. 30 (4) , 4427-4452
Inverse Spectral Theory for Perturbed Torus
- Open Access
Inverse spectral theory for perturbed torus
We consider an inverse problem for Laplacians on rotationally symmetric manifolds, which are finite for the transversal direction and periodic with respect to the axis of the manifold, i.e., Laplacians on tori. We construct an infinite dimensional analytic isomorphism between the space of profiles (the radius of the rotation) of the torus and the spectral data as well as the stability estimates: those for the spectral data in terms of the profile and conversely, for the profile in term of the spectral data.
Open AccessInverse spectral theory for perturbed torus
We consider an inverse problem for Laplacians on rotationally symmetric manifolds, which are finite for the transversal direction and periodic with respect to the axis of the manifold, i.e., Laplacians on tori. We construct an infinite dimensional analytic isomorphism between the space of profiles (the radius of the rotation) of the torus and the spectral data as well as the stability estimates: those for the spectral data in terms of the profile and conversely, for the profile in term of the spectral data.