---
title: Banana Paths in Multidisciplinary Research
url: https://www.emergentmind.com/topics/banana-paths
type: topic
---

# Banana Paths in Multidisciplinary Research

“Banana paths” is used in the literature for several distinct objects: an isometric deformation path of banana-shaped thin shells; the banana-shaped source–detector sensitivity region in diffuse optical tomography; analytic integration, dispersion, and geodesic-distance paths for banana Feynman integrals; banana paths as multigraphs whose underlying simple graph is a path; dynamic path-based structures for persistent homology of time series; and path structures on banana curves and graphs in tropical KP theory [1604.05467] [2208.07718] [2405.19868] [2510.03499] [2405.17920] [2512.13366].

## 1. Terminological scope

In the cited literature, the phrase does not denote a single canonical object. It instead names families of trajectories, deformations, or combinatorial structures whose geometry is organized around two endpoints and multiple intermediate routes.

| Domain | Meaning of “banana paths” | Representative paper |
|---|---|---|
| Thin-shell mechanics | Isometric deformation trajectories of banana-shaped shells | [1604.05467] |
| Diffuse optics | Banana-shaped sensitivity region between source and detector | [2208.07718] |
| Feynman integrals | Dispersion-contour and iterated-integration paths for banana integrals | [2405.19868] |
| Graph theory | Banana trees or banana paths in multigraph theory | [2510.03499] |
| Time-series topology | Dynamic path representation via banana trees | [2405.17920] |
| Tropical KP theory | Paths on banana graphs, Jacobians, and Delaunay polytopes | [2512.13366] |

This plurality is not accidental. In every case, the relevant structure is organized by a constrained family of routes between distinguished endpoints, but the endpoints may be shell apertures, optical probes, external legs of a Feynman graph, marked graph vertices, or nodes of a tropical curve.

## 2. Isometric shell kinematics and folded Goursat surfaces

In thin-shell mechanics, a banana path is the one-parameter family \(h\mapsto S(u,v,h)\) of an explicit banana-shaped Goursat surface whose first fundamental form is independent of the deformation parameter \(h\). The construction begins from a planar “banana-like” backbone \((U_1,U_2)\), an elliptic cross-section \((V_1,V_2)=(c\cos v,d\sin v)\), and the surface parametrization
\[
S(u,v,h)=V_1(v) f(u,h)e_r(u,h)+\int_0^u U_3(t)\Gamma(t,h)\,dt+\left(\int_0^v\sqrt{V_2'(s)^2-hV_1'(s)^2}\,ds\right)e_z,
\]
with metric coefficients \(E,F,G\) independent of \(h\). This makes the deformation exactly isometric, so the model captures bending-dominated shape change rather than stretching-dominated motion [1604.05467].

The folded extension inserts a piecewise constant sign field \(\epsilon(u)\in\{-1,1\}\) into the angular variable \(\theta^\epsilon\). Discontinuities of \(\epsilon\) create vertical curved folds along planes \(u=\mathrm{const}\), and the resulting surfaces are \(C^0\) across fold lines. A fold energy is added to the bending energy, so the total energy takes the form
\[
E_{tot}(h)=E_b(h)+\sum_{i=1}^N E^\epsilon_{fo,i}(h).
\]
The model is motivated by the seedpod of *Acacia caven*, where desiccation increases longitudinal curvature \(k_2\), decreases meridional curvature \(k_1\), and approximately preserves Gaussian curvature near a saddle point.

The central kinematic result is that a vertical actuation can be converted into qualitatively different horizontal responses. With no fold, increasing \(h\) opens the shell. With a fold placed close to the saddle or aperture, vertical closing produces horizontal closing. With the fold moved farther away, the fold influence weakens and opening is restored. The vertical deformation is measured by
\[
\lambda=\frac{z(v_0,h)}{z(v_0,0)},
\]
while the aperture response is measured by an opening area \(\Delta S\), positive for opening and negative for closing. The same formalism supports optimization under constant volume, and the reported conclusion is that the most elongated shells are optimal for opening ease, both geometrically and energetically.

## 3. Optical sensitivity regions in diffuse tomography

In diffuse optical tomography, “banana paths” denotes the banana-shaped region of highest measurement sensitivity between a source and a detector on the boundary of a semi-infinite half-space \(\Omega=\{(x,y,z)\in\mathbb{R}^3:z>0\}\). With source \(\mathbf r_s=(-d_{\rm SD}/2,0,0^+)\) and detector \(\mathbf r_d=(d_{\rm SD}/2,0,0)\), the first-order sensitivity of the detected signal to a point absorber at \(\mathbf r_0\) is proportional to
\[
G(\mathbf r_0,\mathbf r_s)\,G(\mathbf r_0,\mathbf r_d),
\]
where \(G\) is the Green’s function of the diffusion equation. Its \(x\)-\(z\) cross-section is symmetric about the midpoint, dives into the medium, reaches maximal depth near \(x=0\), and returns to the detector, producing the canonical banana shape [2208.07718].

The paper defines the banana depth physically rather than purely geometrically: it is the depth \(z_0\) at which a point absorber produces maximal reduction of detector fluence under the Born approximation. After nondimensionalization, the depth is
\[
z_0=\frac{d_{\rm SD}}{2}\,w_*(d_{\rm SD};\bar\mu_a,D_0,\mathfrak n),
\]
where \(w_*\) is the smallest positive root of an integral equation \(\Lambda(w;a,b)=0\). In the ideal limit of negligible absorption and zero boundary condition, this gives
\[
z_0=\frac{d_{\rm SD}}{2\sqrt2}\approx 0.35\,d_{\rm SD}.
\]
For typical tissue-like parameters and Robin boundary conditions with refractive-index mismatch, the reported rule of thumb is
\[
z_0\approx 0.2\,d_{\rm SD}.
\]

The same work uses stripe illumination, modeled as a periodic array of point sources. This superposes many individual banana-shaped sensitivity regions. Because stripe illumination contains both low and high spatial frequencies, it lies between point illumination and spatial-frequency-domain illumination: it retains deeper penetration than a single high-frequency sinusoidal pattern while still admitting Fourier decomposition. The paper uses the estimate \(z_0\approx0.2d_{\rm SD}\) to choose stripe pitch \(L\), with effective source–detector distance
\[
d_{\rm SD}=\frac{L-\ell}{2}.
\]
This gives a practical design rule for depth targeting in DOT.

## 4. Analytic paths of banana Feynman integrals and modular periods

In perturbative quantum field theory, banana integrals are multi-loop two-point Feynman integrals with several propagators joining the same two external legs. For an \(L\)-loop banana,
\[
B_{n_0n_1\cdots n_L}(q^2;\mathbf m)
= \int \prod_{i=1}^L \frac{d^Dk_i}{i\pi^{D/2}}
\frac{1}{\mathcal D_0^{n_0}\mathcal D_1^{n_1}\cdots \mathcal D_L^{n_L}},
\]
with \(\mathcal D_i=k_i^2-m_i^2\) and \(\mathcal D_0=(q-\sum_i k_i)^2-m_0^2\). In this context, banana paths are the branch-cut contours and nested integration paths appearing in dispersion relations and in parameterized discontinuities of banana integrals (p-DOBIs). The p-DOBIs organize discontinuities into nested integrals with Källén-function kernels, reduce to finite bases, and provide a direct route to Picard–Fuchs operators; the generalized dispersion relation adds threshold and UV subtractions through large and small contour contributions [2405.19868].

A complementary path language appears in the equal-mass three-loop banana graph in \(d=2-2\varepsilon\). There the graph is expressed as a double integral over auxiliary parameters \((t_1,t_2)\in[0,1]^2\), then as an outer integral over \((y_1,y_2)\in[2,\infty)^2\), with an inner iterated path in the \(x\)-plane governed by kernels \(dx/(x-a)\). The resulting representation organizes the three-loop banana as iterated integrals with algebraic kernels, suitable both for \(\varepsilon\)-expansion and for numerical evaluation above and below threshold [2104.14681].

At zero external momentum, configuration space gives a different notion of banana path. A scalar \(l\)-banana becomes an integral of a product of Euclidean propagators \(G_{m_j}(x)\), hence a radial integral of products of Macdonald functions \(K_\nu\). For the 2-loop banana, the paper derives explicit formulas in arbitrary dimension and for arbitrary masses directly from the configuration-space representation, and it emphasizes that the relevant differential equations can be recovered from Bessel recurrences rather than from momentum-space IBP [2304.00624].

The coordinate-space perspective persists on harmonic curved spaces. If the Green function depends only on geodesic distance \(\sigma\), then the \(n\)-loop banana is simply \(G(\sigma)^n\). The paper shows that \(G(\sigma)^n\) satisfies a universal determinant differential equation built from a first-order radial operator \(\Lambda\) and an effective mass parameter \(\lambda\),
\[
\det
\begin{pmatrix}
\Lambda & c_1\lambda & \cdots \\
c_1\lambda & \Lambda & \cdots \\
\vdots & \vdots & \ddots
\end{pmatrix}
G(\sigma)^n=0,
\qquad c_k=\sqrt{k(n-k+1)},
\]
thereby turning banana diagrams into functions of geodesic distance on harmonic manifolds [2408.15724].

For maximal cuts of the three-loop banana, the analytic path reaches K3 geometry and automorphic forms. Depending on the mass pattern, the periods define ordinary modular forms or Hilbert, Siegel, or hermitian modular forms. Equal masses give elliptic modularity; three equal masses give a product-type elliptic situation on \(\mathbb H\times\mathbb H\); pairwise-equal masses give Hilbert modular forms; two equal masses give Siegel modular forms on \(\mathbb H_2\); and generic unequal masses give hermitian modular forms on a degree-2 hermitian half-space [2502.15325].

## 5. Banana paths in graph theory, gonality, and induced subdivisions

In graph theory, a banana is the union of a nonempty set of positive-length paths with the same ends and otherwise disjoint interiors. A banana tree is obtained from a tree by replacing each edge by a banana, subject to orthogonality conditions between the bananas. This notion is used in the theory of induced subdivisions: if \(H\) is obtained from a tree by adding parallel edges, then \(H\) is pervasive, and the paper strengthens this by proving that such multigraphs are widespread. In bounded-clique graphs of sufficiently large chromatic number, induced subdivisions of banana trees must occur [1701.05597].

A different but related usage appears in chip-firing theory. A banana tree is a multigraph whose underlying simple graph is a tree, and a banana path is a banana tree whose underlying simple graph is a path. Such a path is specified by a sequence
\[
A=(a_1,\dots,a_n)\in \mathbb Z_{>0}^n,
\]
where \(a_i\) is the number of parallel edges between consecutive vertices. For \(B_A\), the paper defines a dynamic-programming function \(f(G,v,k)\) and proves that \(\gon(B_A)\) can be computed in time \(O(n^3)\). It also proves an exact lcm formula for sufficiently long monoculture banana paths:
\[
\gon(B_{A;n})=\operatorname{lcm}(a_1,\dots,a_s)\qquad \text{for } n\ge sL^2,\ L=\operatorname{lcm}(a_1,\dots,a_s).
\]
In the same setting, scramble number and screewidth coincide for banana trees, and banana paths are used to show that deleting a single edge can change gonality by an arbitrary prescribed amount while keeping the graph connected [2510.03499].

Twice-marked banana graphs enter Hurwitz–Brill–Noether theory through two distinguished vertices \(u,v\). For genus \(2\), the banana graph is a theta graph, and the paper gives a sharp submodularity criterion: if \(u\) and \(v\) lie in the interiors of distinct strands, every divisor is submodular. Evenly marked theta graphs—where the two marked points lie on distinct strands at the same rational position—have \(k\)-general transmission and become building blocks for new Brill–Noether general graphs. By contrast, almost all banana graphs of genus at least \(3\) fail either by non-submodularity or by having too many inversions in the associated transmission permutations [2211.17258].

## 6. Dynamic time-series paths and persistent homology

In topological data analysis, a time series
\[
c_0,c_1,\dots,c_{n-1}\in\mathbb R
\]
is viewed as a piecewise-linear path \(f:[0,n-1]\to\mathbb R\). The banana tree data structure maintains the extended \(0\)-dimensional persistence of this path under dynamic updates. Its geometric basis is a laminar family of double-panel windows associated with min–max persistence pairs. The up-tree stores the sublevel-set structure of \(f\), the down-tree stores the corresponding structure for \(-f\), and each persistence pair is represented by a banana consisting of an in-trail and a mid-trail [2405.17920].

The update model includes value changes, path splitting, and path gluing. A value change decomposes into slides, anti-cancellations, cancellations, and interchanges of maxima or minima. The theoretical update bound is
\[
O(\log n + k),
\]
where \(k\) is the number of actual changes in the persistence diagram. The paper reports that for unbiased random walks the fraction of critical items is about \(50\%\), the average maximum nesting depth is about \(13\) for \(n=2\cdot 10^6\), and average in-trail and mid-trail lengths are both about \(0.5\). Under these conditions banana trees substantially outperform static recomputation.

The experimental comparison with Gudhi shows large speedups in the random-walk regime. For local value updates with \(\Delta=5.0\), the median speedup at \(n=10^6\) is about \(612\times\). For cut and glue operations on unbiased random walks of length \(10^6\), average speedups are about \(105\times\). Real-world ECG, audio, and activity traces exhibit structural statistics close to unbiased random walks—short trails, logarithmic nesting depth, and small fractions of nodes on the longest trail—so the implementation is argued to have practical utility for dynamically evolving one-dimensional signals.

## 7. Banana curves, section classes, and tropical KP

In algebraic geometry, the banana threefold is a smooth proper Calabi–Yau threefold obtained by blowing up the relative diagonal in the fiber product of a rational elliptic surface with itself over \(\mathbb P^1\). Its singular fibers contain a banana configuration
\[
C_1\cup C_2\cup C_3,
\]
a union of three \(\mathbb P^1\)s meeting in two points, with each \(C_i\) carrying normal bundle \(\mathcal O_{\mathbb P^1}(-1)\oplus\mathcal O_{\mathbb P^1}(-1)\). The relevant curve classes form the rank-4 lattice
\[
\Gamma=\mathbb Z\langle C_1,C_2,C_3,\sigma\rangle,
\]
where \(\sigma\) is a section of the Abelian-surface fibration. The paper computes unweighted DT partition functions in classes involving both the banana configuration and the section, relates the connected PT theory to that of a rational elliptic surface, and extracts new unweighted GV invariants for classes \(b\sigma+(i,j,d_3)\) [1907.01054].

In tropical KP theory, the banana graph \(\Gamma_g\) has two vertices and \(g+1\) parallel edges, so its genus is \(g\). The associated banana curve is a reducible rational curve obtained as a degeneration of a hyperelliptic curve. Its tropical Jacobian carries a Voronoi decomposition and dual Delaunay polytopes. For banana graphs, these Delaunay polytopes are combinatorially equivalent to hypersimplices \(\Delta_{k,n}\), hence to the base polytopes of uniform matroids \(U_{k,n}\). The tropical theta divisor therefore canonically encodes the matroid and Grassmannian structures underlying the associated KP multi-soliton solutions. The paper defines the Hirota variety of a banana graph as the parameter space of tau functions arising from the graph and gives an explicit parametrization that realizes those tau functions as multi-solitons [2512.13366].

A plausible commonality is that these algebraic and tropical usages treat banana paths as curve classes or combinatorial trajectories in a Jacobian, rather than as literal geometric paths in ambient space. That commonality is structural rather than terminological: the central object is still a family of routes joining two distinguished components, now interpreted through periods, theta divisors, and soliton data.

Source: https://www.emergentmind.com/topics/banana-paths