Related papers: Balanced homogeneous harmonic maps between cones
We characterize harmonic spaces in terms of the dimensions of various spaces of radial eigen-spaces of the Laplacian $\Delta^0$ on functions and the Laplacian $\Delta^1$ on 1-forms. We examine the nature of the singularity as the geodesic…
We set up and solve the initial value problem for equivariant harmonic maps of cohomogeneity one manifolds, i.e. we show the local existence of a harmonic map in the neighborhood of a singular orbit. Furthermore, we present some theory of…
Hypergraphs are useful mathematical models for describing complex relationships among members of a structured graph, while hyperdigraphs serve as a generalization that can encode asymmetric relationships in the data. However, obtaining…
Synchronization of identical harmonic oscillators interconnected via position, velocity, and acceleration couplings is studied. How to construct a complex Laplacian matrix representing the overall coupling is presented. It is shown that the…
Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…
Coupled map lattices (CMLs) are prototypical dynamical systems on networks/graphs. They exhibit complex patterns generated via the interplay of diffusive/Laplacian coupling and nonlinear reactions modelled by a single iterated map at each…
Biharmonic and conformal-biharmonic maps are two fourth-order generalizations of the well-studied notion of harmonic maps in Riemannian geometry. In this article we consider maps into the Euclidean sphere and investigate a geometric…
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…
We prove that a quasiisometric map between rank one symmetric spaces is within bounded distance from a unique harmonic map. In particular, this completes the proof of the Schoen-Li-Wang conjecture.
The use of Laplacian eigenbases has been shown to be fruitful in many computer graphics applications. Today, state-of-the-art approaches to shape analysis, synthesis, and correspondence rely on these natural harmonic bases that allow using…
The homology groups of a simplicial complex reveal fundamental properties of the topology of the data or the system and the notion of topological stability naturally poses an important yet not fully investigated question. In the current…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
We study the space of link maps, which are smooth maps from the disjoint union of manifolds P and Q to a manifold N such that the images of P and Q are disjoint. We give a range of dimensions, interpreted as the connectivity of a certain…
We study expanding circle maps interacting in a heterogeneous random network. Heterogeneity means that some nodes in the network are massively connected, while the remaining nodes are only poorly connected. We provide a probabilistic…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
For a bounded domain equipped with a piecewise Lipschitz continuous Riemannian metric g, we consider harmonic map from $(\Omega, g)$ to a compact Riemannian manifold $(N,h)\subset\mathbb R^k$ without boundary. We generalize the notion of…
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all…
As key subjects in spectral geometry and combinatorial graph theory respectively, the (continuous) Hodge Laplacian and the combinatorial Laplacian share similarities in revealing the topological dimension and geometric shape of data and in…