We construct Dirac operators and spectral triples for certain, not necessarily self-similar, fractal sets built on curves. Connes' distance formula of noncommutative geometry provides a natural metric on the fractal. To motivate the construction, we address Kigami's measurable Riemannian geometry, which is a metric realization of the Sierpinski gasket as a self-affine space with continuously differentiable geodesics. As a fractal analog of Connes' theorem for a compact Riemmanian manifold, it is proved that the natural metric coincides with Kigami's geodesic metric. This present work extends to the harmonic gasket and other fractals built on curves a significant part of the earlier results of E. Christensen, C. Ivan, and the first author obtained, in particular, for the Euclidean Sierpinski gasket. (As is now well known, the harmonic gasket, unlike the Euclidean gasket, is ideally suited to analysis on fractals. It can be viewed as the Euclidean gasket in harmonic coordinates.) Our current, broader framework allows for a variety of potential applications to geometric analysis on fractal manifolds.

Organisms inhabiting river systems contend with downstream biased flow in a complex tree-like network. Differential equation models are often used to study population persistence, thus suggesting resolutions of the 'drift paradox', by considering the dependence of persistence on such variables as advection rate, dispersal characteristics, and domain size. Most previous models that explicitly considered network geometry artificially discretized river habitat into distinct patches. With the recent exception of Ramirez (J Math Biol 65:919-942, 2012), partial differential equation models have largely ignored the global geometry of river systems and the effects of tributary junctions by using intervals to describe the spatial domain. Taking advantage of recent developments in the analysis of eigenvalue problems on quantum graphs, we use a reaction-diffusion-advection equation on a metric tree graph to analyze persistence of a single population in terms of dispersal parameters and network geometry. The metric graph represents a continuous network where edges represent actual domain rather than connections among patches. Here, network geometry usually has a significant impact on persistence, and occasionally leads to dramatically altered predictions. This work ranges over such themes as model definition, reduction to a diffusion equation with the associated model features, numerical and analytical studies in radially symmetric geometries, and theoretical results for general domains. Notable

Organisms inhabiting river systems contend with downstream biased flow in a complex tree-like network. Differential equation models are often used to study population persistence, thus suggesting resolutions of the 'drift paradox', by considering the dependence of persistence on such variables as advection rate, dispersal characteristics, and domain size. Most previous models that explicitly considered network geometry artificially discretized river habitat into distinct patches. With the recent exception of Ramirez (J Math Biol 65:919-942, 2012), partial differential equation models have largely ignored the global geometry of river systems and the effects of tributary junctions by using intervals to describe the spatial domain. Taking advantage of recent developments in the analysis of eigenvalue problems on quantum graphs, we use a reaction-diffusion-advection equation on a metric tree graph to analyze persistence of a single population in terms of dispersal parameters and network geometry. The metric graph represents a continuous network where edges represent actual domain rather than connections among patches. Here, network geometry usually has a significant impact on persistence, and occasionally leads to dramatically altered predictions. This work ranges over such themes as model definition, reduction to a diffusion equation with the associated model features, numerical and analytical studies in radially symmetric geometries, and theoretical results for general domains. Notable

We study population persistence in branching tree networks emulating systems such as river basins, cave systems, organisms on vegetation surfaces, and vascular networks. Population dynamics are modeled using a reaction-diffusion-advection equation on a metric graph which provides a continuous, spatially explicit model of network habitat. A metric graph, in contrast to a standard graph, allows for population dynamics to occur within edges rather than just at graph vertices, subsequently adding a significant level of realism. Within this framework, we stochastically generate branching tree networks with a variety of geometric features and explore the effects of network geometry on the persistence of a population which advects toward a lethal outflow boundary. We identify a metric (CM), the distance from the lethal outflow point at which half of the habitable volume of the network lies upstream of, as a promising indicator of population persistence. This metric outperforms other metrics such as the maximum and minimum distances from the lethal outflow to an upstream boundary and the total habitable volume of the network. The strength of CM as a predictor of persistence suggests that it is a proper "system length" for the branching networks we examine here that generalizes the concept of habitat length in the classical linear space models.Keywords Population dynamics · Branching networks · Reaction-diffusionadvection · Partial differential equations · (Metric) graph theory · Principal eigenvalue analysis Mathematics Subject Classification 05C12 (distance in graphs) · 35K57 (reactiondiffusion) · 58C40 (spectral theory; eigenvalue problems) · 35K20 (initial-boundary value problems for second-order parabolic equations) · 35J25 (boundary value problems for second-order elliptic equations) · 92D40 (ecology)

This article considers the semilinear boundary value problem given by the Poisson equation, ÀDu ¼ f(u) in a bounded domain & R n (n42) with a smooth boundary. For the zero boundary value case, we approximate a solution using the Newton-embedding procedure. With the assumptions that f, f 0 , and f 00 are bounded functions on R, with f 0 50, and & R 3 , the Newton-embedding procedure yields a continuous solution. This study is in response to an independent work which applies the same procedure, but assuming that f 0 maps the Sobolev space H 1 () to the space of Ho¨lder continuous functions C ð "Þ, and f(u), f 0 (u), and f 00 (u) have uniform bounds. In the first part of this article, we prove that these assumptions force f to be a constant function. In the remainder of the article, we prove the existence, uniqueness, and H 2 -regularity in the linear elliptic problem given by each iteration of Newton's method. We then use the regularity estimate to achieve convergence.