English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We consider the Schrodinger evolution on graph, i.e. solution to the equation $\partial_tu(t,\alpha)=i\sum_{\beta\in\mathcal{A}}L(\alpha,\beta)u(t,\beta)$, here $\mathcal{A}$ is the set of vertices of the graph and the matrix $(L(\alpha,\beta))_{\alpha,\beta\in\mathcal{A}}$ describes interaction between the vertices, in particular two vertices $\alpha$ and $\beta$ are connected if $L(\alpha,\beta)\neq0$. We assume that the graph has a "web-like" structure, i.e, it consists of an inner part, formed by a finite number of vertices, and some threads attach to it. We prove that such solution $u(t,\alpha)$ cannot decay too fast along one thread at two different times, unless it vanishes at this thread. We also give a characterization of the dimension of the vector space formed by all the solutions of $\partial_tu(t,\alpha)=i\sum_{\beta\in\mathcal{A}}L(\alpha,\beta)u(t,\beta)$ when $\mathcal{A}$ is a finite set, in terms of the number of the different eigenvalues of the matrix $L(\cdot,\cdot)$

Uncertainty principle for discrete Schrödinger evolution on graphs