In geometry processing, smoothness energies are commonly used to model scattered data interpolation, dense data denoising, and regularization during shape optimization. The squared Laplacian energy is a popular choice of energy and has a corresponding standard implementation: squaring the discrete Laplacian matrix. For compact domains, when values along the boundary are not known in advance, th...

In this work, we study the stability of Hopf vector fields on Lorentzian Berger spheres as critical points of the energy, the volume and the generalized energy. In order to do so, we construct a family of vector fields using the simultaneous eigenfunctions of the Laplacian and of the vertical Laplacian of the sphere. The Hessians of the functionals are negative when they act on these particular...

We demonstrate that the static ground state atom, which interacts with a conformally coupled massless scalar field in the de Sitter invariant vacuum, can obtain a position-dependent energy-level shift and this shift could cause a Casimir-Polder-like force on it. Interestingly no such force arises on the inertial atom bathed in a thermal radiation in the Minkowski universe. Thus, although the en...

The use of spectral methods in graph theory has allowed for some amazing results where an arithmetic invariant (i.e., diameter, chromatic number, and so on) has been bounded and analyzed using analytic tools. The key has been to examine the spectrum of various matrices associated with graphs and to try to “hear the shape” of the graph from the spectrum. The three most widely used spectrums are ...

We propose a novel procedure for handling processes that involve unstable intermediate particles. By using gauge-invariant effective Lagrangians it is possible to perform a gauge-invariant resummation of (arbitrary) self-energy effects. For instance, gauge-invariant tree-level amplitudes can be constructed with the decay widths of the unstable particles properly included in the propagators. In ...

The Laplacian energy of a graph sums up the absolute values of the differences of average degree and eigenvalues of the Laplace matrix of the graph. This spectral graph parameter is upper bounded by the energy obtained when replacing the eigenvalues with the conjugate degree sequence of the graph, in which the i-th number counts the nodes having degree at least i. Because the sequences of eigen...

This is an expository paper which includes several topics related to the Dirichlet form analysis on the Sierpiński gasket. We discuss the analog of the classical Laplacian; approximation by harmonic functions that gives a notion of a gradient; directional energies and an equipartition of energy; analysis with respect to the energy measure; harmonic coordinates; and non self-similar Dirichlet fo...

The centrality of vertices has been a key issue in network analysis. For unweighted networks where edges are just present or absent and have no weight attached, many centrality measures have been presented, such as degree, betweenness, closeness, eigenvector and subgraph centrality. There has been a growing need to design centrality measures for weighted networks, because weighted networks wher...

We consider a nonautonomous stochastic $ p $-Laplacian lattice equation with multiplicative noise and nonlinearity that is not locally Lipschitz. For each q\geq1 $, pullback (\ell^2, \ell^q) $-attractor obtained, the measurability of attractor in both spaces by more complicated estimates. Then, time-dependent invariant sample Borel probability measures are constructed carried random attractor. ...

The direct and inverse theorems are established for the best approximation in the weighted L space on the unit sphere of R, in which the weight functions are invariant under finite reflection groups. The theorems are stated using a modulus of smoothness of higher order, which is proved to be equivalent to a K-functional defined using the power of the spherical h-Laplacian. Furthermore, similar ...