Related papers: Using Peano Curves to Construct Laplacians on Frac…
A macroscopic characterization of fractals showing up a structural transition from dense to multibranched growth is made using optical diffraction theory. Such fractals are generated via the numerical solution of the 2D Poisson and…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…
This paper uses the technology of weighted and regular triangulations to study discrete versions of the Laplacian on piecewise Euclidean manifolds. Regular triangulations are studied in some detail, including flip algorithms. The Laplacian…
We consider compact metric graphs with an arbitrary self adjoint realisation of the differential Laplacian. After discussing spectral properties of Laplacians, we prove several versions of trace formulae, relating Laplace spectra to sums…
We show in a unified manner that the factorization method describes completely the $L^2$-eigenspaces associated to the discrete part of the spectrum of the twisted Laplacian on constant curvature Riemann surfaces. Subclasses of two variable…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
In this survey article, we investigate the spectral properties of fractal differential operators on self-similar fractals. In particular, we discuss the decimation method, which introduces a renormalization map whose dynamics describes the…
This chapter describes how to use intersection and closest-hit shaders to implement real-time visualizations of complex fractals using distance functions. The Mandelbulb and Julia Sets are used as examples.
This short survey is aimed at sketching the ergodic-theoretic aspects of the author's recent studies on Weyl's eigenvalue asymptotics for a \emph{"geometrically canonical" Laplacian} defined by the author on some self-conformal circle…
Trees continue to fascinate with their natural beauty and as engineering masterpieces optimal with respect to several independent criteria. Pythagorean tree is a well-known fractal design that realistically mimics the natural tree branching…
Fractals are geometric shapes that can display complex and self-similar patterns found in nature (e.g., clouds and plants). Recent works in visual recognition have leveraged this property to create random fractal images for model…
The construction of a Laplacian on a class of fractals which includes the Sierpinski gasket ({\bf $SG$}) has given rise to an intensive research on analysis on fractals. For instance, a complete theory of polynomials and power series on…
It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted…
We study two different types of gluing for graphs: interface (obtained by choosing a common subgraph as the gluing component) and bridge gluing (obtained by adding a set of edges to the given subgraphs). We introduce formulae for computing…
We show that arising out of noncmmutatve geometry is a natural family of {\em edge Laplacians} on the edges of a graph. The family includes a canonical edge Laplacian associated to the graph, extending the usual graph Laplacian on vertices,…
Contrastive learning has emerged as a premier method for learning representations with or without supervision. Recent studies have shown its utility in graph representation learning for pre-training. Despite successes, the understanding of…
Learning the graph Laplacian from observed data is one of the most investigated and fundamental tasks in Graph Signal Processing (GSP). Different variants of the Laplacian, such as the combinatorial, signless or signed Laplacians have been…
The famous Laplace's Demon is not only of strict physical determinism, but also related to the power of differential equations. When deterministically extended structures are taken into consideration, it is admissible that fractals are…
We define and study pseudo-differential operators on a class of fractals that include the post-critically finite self-similar sets and Sierpinski carpets. Using the sub-Gaussian estimates of the heat operator we prove that our operators…
A divide-and-conquer based approach for computing the Moore-Penrose pseudo-inverse of the combinatorial Laplacian matrix $(\bb L^+)$ of a simple, undirected graph is proposed. % The nature of the underlying sub-problems is studied in detail…