Abstract Extending computational harmonic analysis tools from the classical setting of regular lattices to the more general setting of graphs and networks is very important, and much research has been done recently. The generalized Haar–Walsh transform (GHWT) developed by Irion and Saito (2014) is a multiscale transform for signals on graphs, which is a generalization of the classical Haar and Walsh–Hadamard transforms. We propose theextendedgeneralized Haar–Walsh transform (eGHWT), which is a generalization of the adapted time–frequency tilings of Thiele and Villemoes (1996). The eGHWT examines not only the efficiency of graph-domain partitions but also that of “sequency-domain” partitionssimultaneously. Consequently, the eGHWT and its associated best-basis selection algorithm for graph signals significantly improve the performance of the previous GHWT with the similar computational cost,$$O(N \log N)$$ , whereNis the number of nodes of an input graph. While the GHWT best-basis algorithm seeks the most suitable orthonormal basis for a given task among more than$$(1.5)^N$$ possible orthonormal bases in$$\mathbb {R}^N$$ , the eGHWT best-basis algorithm can find a better one by searching through more than$$0.618\cdot (1.84)^N$$ possible orthonormal bases in$$\mathbb {R}^N$$ . This article describes the details of the eGHWT best-basis algorithm and demonstrates its superiority using several examples including genuine graph signals as well as conventional digital images viewed as graph signals. Furthermore, we also show how the eGHWT can be extended to 2D signals and matrix-form data by viewing them as a tensor product of graphs generated from their columns and rows and demonstrate its effectiveness on applications such as image approximation.
more »
« less
Local behavior of the Eden model on graphs and tessellations of manifolds
Abstract The Eden Model in$${\mathbb {R}}^n$$ constructs a blob as follows: initially a single unit hypercube is infected, and each second a hypercube adjacent to the infected ones is selected randomly and infected. Manin, Roldán, and Schweinhart investigated the topology of the Eden model in$${\mathbb {R}}^{n}$$ by considering the possible shapes which can appear on the boundary. In particular, they give probabilistic lower bounds on the Betti numbers of the Eden model. In this paper, we prove analogous results for the Eden model on any infinite, vertex-transitive, locally finite graph: with high probability as time goes to infinity, every “possible” subgraph (with mild conditions on what “possible” means) occurs on the boundary of the Eden model at least a number of times proportional to an isoperimetric profile of the graph. Using this, we can extend the results about the topology of the Eden model to non-Euclidean spaces, such as hyperbolicn-space and universal covers of certain Riemannian manifolds.
more »
« less
- Award ID(s):
- 2204001
- PAR ID:
- 10480448
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- Journal of Applied and Computational Topology
- Volume:
- 8
- Issue:
- 6
- ISSN:
- 2367-1726
- Format(s):
- Medium: X Size: p. 1607-1647
- Size(s):
- p. 1607-1647
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract The Eden cell growth model is a simple discrete stochastic process which produces a “blob” (aggregation of cells) in $$\mathbb {R}^d$$ : start with one cube in the regular grid, and at each time step add a neighboring cube uniformly at random. This process has been used as a model for the growth of aggregations, tumors, and bacterial colonies and the healing of wounds, among other natural processes. Here, we study the topology and local geometry of the resulting structure, establishing asymptotic bounds for Betti numbers. Our main result is that the Betti numbers at timetgrow at a rate between$$t^{(d-1)/d}$$ and$$P_d(t)$$ , where$$P_d(t)$$ is the size of the site perimeter. Assuming a widely believed conjecture, this establishes the rate of growth of the Betti numbers in every dimension. We also present the results of computational experiments on finer aspects of the geometry and topology, such as persistent homology and the distribution of shapes of holes.more » « less
-
Abstract We study holomorphic mapsFfrom a smooth Levi non-degenerate real hypersurface$$ M_{\ell }\subset {\mathbb {C}}^n $$ into a hyperquadric$$ {\mathbb {H}}_{\ell '}^N $$ with signatures$$ \ell \le (n-1)/2 $$ and$$ \ell '\le (N-1)/2,$$ respectively. Assuming that$$ N - n < n - 1,$$ we prove that if$$ \ell = \ell ',$$ thenFis either CR transversal to$$ {\mathbb {H}}_{\ell }^N $$ at every point of$$ M_{\ell },$$ or it maps a neighborhood of$$ M_{\ell } $$ in$$ {\mathbb {C}}^n $$ into$$ {\mathbb {H}}_{\ell }^N.$$ Furthermore, in the case where$$ \ell ' > \ell ,$$ we show that ifFis not CR transversal at$$0\in M_\ell ,$$ then it must be transversally flat. The latter is best possible.more » « less
-
Abstract We study spectral stability of the$${\bar{\partial }}$$ -Neumann Laplacian on a bounded domain in$${\mathbb {C}}^n$$ when the underlying domain is perturbed. In particular, we establish upper semi-continuity properties for the variational eigenvalues of the$${\bar{\partial }}$$ -Neumann Laplacian on bounded pseudoconvex domains in$${\mathbb {C}}^n$$ , lower semi-continuity properties on pseudoconvex domains that satisfy property (P), and quantitative estimates on smooth bounded pseudoconvex domains of finite D’Angelo type in$${\mathbb {C}}^n$$ .more » « less
-
Abstract Consider two half-spaces$$H_1^+$$ and$$H_2^+$$ in$${\mathbb {R}}^{d+1}$$ whose bounding hyperplanes$$H_1$$ and$$H_2$$ are orthogonal and pass through the origin. The intersection$${\mathbb {S}}_{2,+}^d:={\mathbb {S}}^d\cap H_1^+\cap H_2^+$$ is a spherical convex subset of thed-dimensional unit sphere$${\mathbb {S}}^d$$ , which contains a great subsphere of dimension$$d-2$$ and is called a spherical wedge. Choosenindependent random points uniformly at random on$${\mathbb {S}}_{2,+}^d$$ and consider the expected facet number of the spherical convex hull of these points. It is shown that, up to terms of lower order, this expectation grows like a constant multiple of$$\log n$$ . A similar behaviour is obtained for the expected facet number of a homogeneous Poisson point process on$${\mathbb {S}}_{2,+}^d$$ . The result is compared to the corresponding behaviour of classical Euclidean random polytopes and of spherical random polytopes on a half-sphere.more » « less
An official website of the United States government
