APAlessandra Pluda

Alessandra Pluda

*This is an algorithmically generated author record based on publicly available information.

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


Alessandra Pluda has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Note on Ricci–Pinched Three–Manifolds

    by Luca Benatti, Carlo Mantegazza, Francesca Oronzio, Alessandra Pluda


  • Open Access

    Łojasiewicz–Simon inequalities for minimal networks: stability and convergence

    by Alessandra Pluda, Marco Pozzetta

    We investigate stability properties of the motion by curvature of planar networks. We prove Łojasiewicz–Simon gradient inequalities for the length functional of planar networks with triple junctions. In particular, such an inequality holds for networks with junctions forming angles equal to $$\tfrac{2}{3}\pi $$ 2 3 π that are close in $$H^2$$ H 2 -norm to minimal networks, i.e., networks whose edges also have vanishing curvature. The latter inequality bounds a concave power of the difference between length of a minimal network $$\Gamma _*$$ Γ ∗ and length of a triple junctions network $$\Gamma $$ Γ from above by the $$L^2$$ L 2 -norm of the curvature of the edges of $$\Gamma $$ Γ . We apply this result to prove the stability of minimal networks in the sense that a motion by curvature starting from a network sufficiently close in $$H^2$$ H 2 -norm to a minimal one exists for all times and smoothly converges. We further rigorously construct an example of a motion by curvature having uniformly bounded curvature that smoothly converges to a degenerate network in infinite time.


  • Open Access

    Łojasiewicz-Simon inequalities for minimal networks: stability and convergence

    by Alessandra Pluda, Marco Pozzetta

    We investigate stability properties of the motion by curvature of planar networks. We prove Lojasiewicz-Simon gradient inequalities for the length functional of planar networks with triple junctions. In particular, such an inequality holds for networks with junctions forming angles equal to $\tfrac23\pi$ that are close in $H^2$-norm to minimal networks, i.e., networks whose edges also have vanishing curvature. The latter inequality bounds a concave power of the difference between length of a minimal network $\Gamma_*$ and length of a triple junctions network $\Gamma$ from above by the $L^2$-norm of the curvature of the edges of $\Gamma$. We apply this result to prove the stability of minimal networks in the sense that a motion by curvature starting from a network sufficiently close in $H^2$-norm to a minimal one exists for all times and smoothly converges. We further rigorously construct an example of a motion by curvature having uniformly bounded curvature that smoothly converges to a degenerate network in infinite time.

  • Open Access

    Minimizing properties of networks via global and local calibrations

    by Alessandra Pluda, Marco Pozzetta

    In this note, we prove that minimal networks enjoy minimizing properties for the length functional. A minimal network is, roughly speaking, a subset of composed of straight segments joining at triple junctions forming angles equal to ; in particular such objects are just critical points of the length functional a priori. We show that a minimal network : (i) minimizes mass among currents with coefficients in an explicit group (independent of ) having the same boundary of , (ii) identifies the interfaces of a partition of a neighborhood of solving the minimal partition problem among partitions with same boundary traces. Consequences and sharpness of such results are discussed. The proofs reduce to rather simple and direct arguments based on the exhibition of (global or local) calibrations associated to the minimal network.


  • Open Access

    Minimizing properties of networks via global and local calibrations

    by Alessandra Pluda, Marco Pozzetta

    In this note we prove that minimal networks enjoy minimizing properties for the length functional. A minimal network is, roughly speaking, a subset of $\mathbb{R}^2$ composed of straight segments joining at triple junctions forming angles equal to $\tfrac23 \pi$; in particular such objects are just critical points of the length functional a priori. We show that a minimal network $\Gamma_*$: i) minimizes mass among currents with coefficients in a suitable group having the same boundary of $\Gamma_*$, ii) identifies the interfaces of a partition of a neighborhood of $\Gamma_*$ solving the minimal partition problem among partitions with same boundary traces. Consequences and sharpness of such results are discussed. The proofs reduce to rather simple and direct arguments based on the exhibition of (global or local) calibrations associated to the minimal network.

  • Short‐time existence for the network flow

    by Jorge Lira, Rafe Mazzeo, Alessandra Pluda, Mariel Sáez

    This paper contains a new proof of the short‐time existence for the flow by curvature of a network of curves in the plane. Appearing initially in metallurgy and as a model for the evolution of grain boundaries, this flow was later treated by Brakke using varifold methods. There is good reason to treat this problem by a direct PDE approach, but doing so requires one to deal with the singular nature of the PDE at the vertices of the network. This was handled in cases of increasing generality by Bronsard‐Reitich, Mantegazza‐Novaga‐Tortorelli and eventually, in the most general case of irregular networks by Ilmanen‐Neves‐Schulze. Although the present paper proves a result similar to the one in Ilmanen et al., the method here provides substantially more detailed information about how an irregular network “resolves” into a regular one. Either approach relies on the existence of self‐similar expanding solutions found in Mazzeo and Saez. As a precursor to the main theorem, we also prove an unexpected regularity result for the mixed Cauchy‐Dirichlet boundary problem for the linear heat equation on a manifold with boundary.


  • Open Access

    On the uniqueness of nondegenerate blowups for the motion by curvature of networks

    by Alessandra Pluda, Marco Pozzetta

    In this note we prove uniqueness of nondegenerate compact blowups for the motion by curvature of planar networks. The proof follows ideas introduced in "Lojasiewicz-Simon inequalities for minimal networks: stability and convergence" for the study of stability properties of critical points of the length functional and it is based on the application of a Lojasiewicz-Simon gradient inequality.

  • Open Access

    Type-0 singularities in the network flow – Evolution of trees

    by Carlo Mantegazza, Matteo Novaga, Alessandra Pluda

    The motion by curvature of networks is the generalization to finite union of curves of the curve shortening flow. This evolution has several peculiar features, mainly due to the presence of junctions where the curves meet. In this paper we show that whenever the length of one single curve vanishes and two triple junctions coalesce, then the curvature of the evolving networks remains bounded. This topological singularity is exclusive of the network flow and it can be referred as a “Type-0” singularity, in contrast to the well known “Type-I” and “Type-II” ones of the usual mean curvature flow of smooth curves or hypersurfaces, characterized by the different rates of blow-up of the curvature. As a consequence, we are able to give a complete description of the evolution of tree–like networks till the first singular time, under the assumption that all the “tangents flows” have unit multiplicity. If the lifespan of such solutions is finite, then the curvature of the network remains bounded and we can apply the results from [T. Ilmanen, A. Neves and F. Schulze, On short time existence for the planar network flow, J. Differential Geom. 111 2019, 1, 39–89] and [J. Lira, R. Mazzeo, A. Pluda and M. Saez, Short–time existence for the network flow, preprint 2021] to “restart” the flow after the singularity.


  • Open Access

    Degenerate Elastic Networks

    by Giacomo Del Nin, Alessandra Pluda, Marco Pozzetta

    We minimize a linear combination of the length and the $$L^2$$ L 2 -norm of the curvature among networks in $$\mathbb {R}^d$$ R d belonging to a given class determined by the number of curves, the order of the junctions, and the angles between curves at the junctions. Since this class lacks compactness, we characterize the set of limits of sequences of networks bounded in energy, providing an explicit representation of the relaxed problem. This is expressed in terms of the new notion of degenerate elastic networks that, rather surprisingly, involves only the properties of the given class, without reference to the curvature. In the case of $$d=2$$ d = 2 we also give an equivalent description of degenerate elastic networks by means of a combinatorial definition easy to validate by a finite algorithm. Moreover we provide examples, counterexamples, and additional results that motivate our study and show the sharpness of our characterization.


  • The oriented mailing problem and its convex relaxation

    by Marcello Carioni, Andrea Marchese, Annalisa Massaccesi, Alessandra Pluda, Riccardo Tione