Related papers: Nodal Statistics On Quantum Graphs

We study the symmetry properties of the spectra of normalized Laplacians on signed graphs. We find a new machinery that generates symmetric spectra for signed graphs, which includes bipartiteness of unsigned graphs as a special case.…

We are interested in the effect of Dirichlet boundary conditions on the nodal length of Laplace eigenfunctions. We study random Gaussian Laplace eigenfunctions on the two dimensional square and find a two terms asymptotic expansion for the…

Random geometric graphs are widely used in modeling geometry and dependence structure in networks. In a random geometric graph, nodes are independently generated from some probability distribution $F$ over a metric space, and edges link…

We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…

The second eigenvalue of the Laplacian matrix and its associated eigenvector are fundamental features of an undirected graph, and as such they have found widespread use in scientific computing, machine learning, and data analysis. In many…

Under suitable hypotheses, a symplectic map can be quantized as a sequence of unitary operators acting on the $N$th powers of a positive line bundle over a K\"{a}hler manifold. We show that if the symplectic map has polynomial decay of…

This paper is concerned with the location of nodal sets of eigenfunctions of the Dirichlet Laplacian in thin tubular neighbourhoods of hypersurfaces of the Euclidean space of arbitrary dimension. In the limit when the radius of the…

Brooks and Makover introduced an approach to studying the global geometric quantities (in particular, the first eigenvalue of the Laplacian, injectivity radius and diameter) of a ``typical'' compact Riemann surface of large genus based on…

Many optimization, inference and learning tasks can be accomplished efficiently by means of decentralized processing algorithms where the network topology (i.e., the graph) plays a critical role in enabling the interactions among…

We explore a connection between geodesic nets and quantum graphs optimising certain functionals from spectral theory. For surfaces, critical metrics for the normalised $k^{\mathrm{th}}$ eigenvalue of the Laplacian give rise to isometric…

Let $(G_\epsilon)_{\epsilon>0}$ be a family of '$\epsilon$-thin' Riemannian manifolds modeled on a finite metric graph $G$, for example, the $\epsilon$-neighborhood of an embedding of $G$ in some Euclidean space with straight edges. We…

Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…

Node role explainability in complex networks is very difficult, yet is crucial in different application domains such as social science, neurosciences or computer science. Many efforts have been made on the quantification of hubs revealing…

The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine…

We consider a Laplace eigenfunction $\varphi_\lambda$ on a smooth closed Riemannian manifold, that is, satisfying $-\Delta \varphi_\lambda = \lambda \varphi_\lambda$. We introduce several observations about the geometry of its vanishing…

We study the conformal type of surfaces spread over the sphere via random quasiconformal maps. Constructing a random Beltrami coefficient on the complex plane, we obtain a locally quasiconformal homeomorphism with prescribed dilatation that…

We study the local structure and the regularity of free boundaries of segregated critical configurations involving the square root of the laplacian. We develop an improvement of flatness theory and, as a consequence of this and Almgren's…

We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…

A sign is introduced in the usual Laplacian on graphs and the corresponding analogue of the isoperimetric constant for this Laplacian is presented, i.e. a geometric quantity which enables to bound from above and below the first eigenvalue.…

Eigenvalue spectrum of the Laplacian on a metric graph with arbitrary but fixed vertex conditions is investigated in the limit as the lengths of all edges decrease to zero at the same rate. It is proved that there are exactly four possible…