Publication

A minimal mass blow-up solution on a nonlinear quantum star graph

2026

Abstract

We construct a finite-time blow-up solution to the mass-critical focusing nonlinear Schrödinger equation on a metric star graph with an arbitrary number of edges. We show that all solutions are global if their mass is smaller than an explicit constant, called “minimal mass”. We then construct a solution with minimal mass and arbitrary energy, which blows up in finite time at the vertex of the star graph. The blow-up profile and blow-up speed are explicitly characterized. The main novelty of the paper is the construction of the blow-up profile in time-dependent domains of singularly perturbed Laplacians.

Official source

https://infoscience.epfl.ch/entities/publication/4d3a0f45-0cf1-497c-8e2a-21cfaa095681

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2026

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/4d3a0f45-0cf1-497c-8e2a-21cfaa095681

About this result

Related concepts (32)

Star (graph theory)

In graph theory, a star S_k is the complete bipartite graph K_1,k : a tree with one internal node and k leaves (but no internal nodes and k + 1 leaves when k ≤ 1). Alternatively, some authors define S_k to be the tree of order k with maximum diameter 2; in which case a star of k > 2 has k − 1 leaves. A star with 3 edges is called a claw. The star S_k is edge-graceful when k is even and not when k is odd. It is an edge-transitive matchstick graph, and has diameter 2 (when l > 1), girth ∞ (it has no cycles), chromatic index k, and chromatic number 2 (when k > 0).

List of graphs

This partial list of graphs contains definitions of graphs and graph families. For collected definitions of graph theory terms that do not refer to individual graph types, such as vertex and path, see Glossary of graph theory. For links to existing articles about particular kinds of graphs, see . Some of the finite structures considered in graph theory have names, sometimes inspired by the graph's topology, and sometimes after their discoverer.

Petersen graph

In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first appeared 12 years earlier, in a paper by .

Related publications (5)

A minimal mass blow-up solution on a nonlinear quantum star graph

Chat with Graph Search

Environment heterogeneity creates fast amplifiers of natural selection in graph-structured populations

Environment heterogeneity creates fast amplifiers of natural selection in graph-structured populations

On blow-up trees for the harmonic map heat flow from $B^2$ to $S^2$