Sampling by averages and average splines on Dirichlet spaces and on combinatorial graphs
Isaac Z. Pesenson

TL;DR
This paper introduces a method for reconstructing Paley-Wiener functions on Dirichlet spaces and graphs using average values over specific covers, leveraging Poincaré inequalities for unique determination.
Contribution
It extends sampling theory to Dirichlet spaces and graphs by establishing unique reconstruction of functions from averages, adapting Poincaré inequalities to these settings.
Findings
Functions in Paley-Wiener spaces are uniquely determined by averages over admissible covers.
The approach applies to both Dirichlet spaces and combinatorial graphs.
Poincaré inequalities are crucial for establishing the sampling and reconstruction results.
Abstract
In the framework of a strictly local regular Dirichlet space we introduce the subspaces of Paley-Wiener functions of bandwidth . It is shown that every function in is uniquely determined by its average values over a family of balls which form an admissible cover of and whose radii are comparable to . The entire development heavily depends on some local and global Poincar\'e-type inequalities. In the second part of the paper we realize the same idea in the setting of a weighted combinatorial finite or infinite countable graph . We have to treat the case of graphs separately since the Poincar\'e inequalities we are using on them are somewhat different from the Poincar\'e inequalities in the first part.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Modeling in Engineering · Advanced Harmonic Analysis Research · Mathematical Analysis and Transform Methods
Sampling by averages and average splines on Dirichlet spaces and on combinatorial graphs
Isaac Z. Pesenson
Department of Mathematics, Temple University, Philadelphia, PA 19122
Abstract.
In the framework of a strictly local regular Dirichlet space we introduce the subspaces of Paley-Wiener functions of bandwidth . It is shown that every function in is uniquely determined by its average values over a family of balls which form an admissible cover of and whose radii are comparable to . The entire development heavily depends on some local and global Poincaré-type inequalities. In the second part of the paper we realize the same idea in the setting of a weighted combinatorial finite or infinite countable graph . We have to treat the case of graphs separately since the Poincaré inequalities we are using on them are somewhat different from the Poincaré inequalities in the first part.
1. Introduction
We consider a metric measure space with doubling property and a self-adjoint operator in which governs local geometry of through a Poincare-type inequality. In fact, we are working in the environment of the so-called strictly local regular Dirichlet spaces [1], [2], [5], [21]-[23]. Following [14] -[16] we introduce the subspaces of Paley-Wiener functions in and then show that every function in is uniquely determined by its average values over a family of balls which form an admissible cover of and whose radii are comparable to . Reconstruction methods for reconstruction of an from appropriate set of its averages are introduced. One method is using language of Hilbert frames. Another one is using average variational interpolating splines which are constructed in the setting of metric measure spaces. It is shown that every Paley-Wiener function is a limit of specific variational splines which have the same averages over balls as .
In the second part of the paper we realize the same idea in the setting of a weighted combinatorial finite or infinite countable graph . Although the second part is very close to the first one ideologically, it is somewhat different technically and can be read independently of the first part.
In both parts of the paper we strongly rely on the local Poincaré (2.5) and a global Poincaré (3.7) and a local Poincaré-type (8.1) and a global Poincaré-type (8.2) inequalities. It is worth to notice that these inequalities in the case of graphs are not exactly the same as in the case of Dirichlet spaces. It explains why we treat graphs separately. A detailed comparison of Poincaré inequalities we are using on Dirichlet spaces and on graphs is given in Remark 8.3.
It should me mentioned that the idea to use certain local information (other than values at sampling point) for reconstruction of bandlimited functions on graphs was already explored in [24]. However, the results and methods of [24] and of our paper are very different. We also want to mention that methods of the present paper are similar to methods of our paper [17] in which sampling by average values and average splines were developed on Riemannian manifolds.
2. Metric measure spaces and Poincare inequality
In this section we describe a class of metric measure spaces we are going to work with. Actually, we assume many properties but the most principle of them are: the doubling property (2.1), existence of a self-adjoint non-negative operator in the corresponding , and the Poincaré inequality (2.5).
Main assumptions about metric measure space.
A homogeneous space in the sense of Coifman and Weiss [3], [4] is a triple where is a set which is equipped with a metric and a positive Radon measure such that the so-called doubling condition holds. Namely, there exists a such that for every open ball with center and radius
[TABLE]
It is very common to assume that defines a locally compact separable topology on .
In the first part of our paper we will work with the so-called strictly local regular Dirichlet spaces. We just outline the main points of this framework and refer to [1], [2], [5], [21]-[23] where all the missing details can be found.
The major assumption is that the real space is equipped with a non-negative self-adjoint operator whose domain is dense in . We consider associated symmetric bilinear form with domain which is defined by the formula
[TABLE]
Assuming that is a strongly local regular Dirichlet form one can show existence of a signed measure which is a bilinear map defined on such that
[TABLE]
In particular, for the non-negative square root one has
[TABLE]
Remark 2.1**.**
In one of the most ”real life” situations when is a Riemannian manifold and is the corresponding Laplace-Beltrami operator the measure is given by a formula
[TABLE]
where the function for smooth compactly supported and is defined by the formula
[TABLE]
In fact, the last formula holds even in general case if one imposes some extra conditions on the domain of .
Our next important assumption is about a local Poincaré inequality.
Assumption 2.2**.**
There exists constant such that for any and any ball of a sufficiently small radius the following Poincare inequality holds
[TABLE]
where
[TABLE]
The above assumptions constitute our framework for the next section. In section 5 we will add another assumption to this list.
3. A global Poincaré inequality
3.1. A covering lemma
Lemma 3.1**.**
There exists a constant and for every sufficiently small there exists a set of points , such that
- (1)
balls are disjoint 2. (2)
multiplicity of the cover is not greater than .
Proof.
Let us choose a family of disjoint balls such that there is no ball which has empty intersections with all balls from our family. Then the family is a cover of . Every ball from the family , that has non-empty intersection with a particular ball is contained in the ball . Since any two balls from the family are disjoint, it gives the following estimate for the index of multiplicity of the cover :
[TABLE]
Let us notice that for any the doubling property (2.1) implies
[TABLE]
and if for a one has then
[TABLE]
Now, the last inequality along with the obvious inclusion implies
[TABLE]
Let’s return to the inequality (3.1). Since we have and according to (3.3)
[TABLE]
In other words, for any and every one has
[TABLE]
This inequality along with (3.2) allows to continue estimation of :
[TABLE]
Lemma is proved.
∎
Definition 1**.**
Every set which satisfies properties of the previous lemma will be called a metric -lattice.
3.2. A global Poincaré inequality and its implications
We will need the inequality (3.5) below. One has for all
[TABLE]
and
[TABLE]
which imply the inequality
[TABLE]
Let be a -lattice and
[TABLE]
where is characteristic function of . We have
[TABLE]
and then
[TABLE]
where
[TABLE]
Since by the very definition of a -lattice the corresponding cover by balls has finite multiplicity we obtain according to (2.5) and (2.2)
[TABLE]
[TABLE]
Thus we can formulate the following result.
Theorem 3.2**.**
For every -lattice and the corresponding set of functions defined in (3.6) the following inequality holds for any
[TABLE]
where is the same as in (2.5). We call this inequality a global Poincaré inequality.
As a consequence we obtain the following statement ”of many zeros”.
Theorem 3.3**.**
For every -lattice and the corresponding set of functions defined in (3.6) the following inequality holds for any such that for all :
[TABLE]
where is the same as in (2.5).
To obtain another important consequence of Theorem 3.2 we need the following lemma which was proved in [6].
Lemma 3.4**.**
If is a self-adjoint operator in a Hilbert space and for some in the domain of
[TABLE]
then for all
[TABLE]
as long as belongs to the domain of .
Theorem 3.5**.**
For every -lattice and every there exist constants such that
[TABLE]
[TABLE]
Proof.
Consider (3.7) with and apply Lemma 3.4. It will show existence of a such that
[TABLE]
which implies left side of (3.5). By using the Hölder inequality we obtain
[TABLE]
[TABLE]
where is from Lemma 3.1. This inequality implies the right-hand side of (3.5). Theorem is proved.
∎
4. Frames of averages in Paley-Wiener spaces
4.1. Paley-Wiener functions in .
Since is a self-adjoint non negative definite operator in the Hilbert space it has a uniquely defined non negative self- adjoint square root . By using Spectral Theorem for and associated operational calculus one can define the projector , where is the characteristic function of the interval .
Definition 2**.**
We will say that a function belongs to the Paley-Wiener space if it belongs to the range of the projector .
Next we denote by the domain of . It is a Banach space, equipped with the graph norm . The next theorem contains generalizations of several results from classical harmonic analysis (in particular the Paley-Wiener theorem). It follows from our results in [6] and [Pes09a].
Theorem 4.1**.**
The spaces have the following properties:
- (1)
the space is a linear closed subspace in . 2. (2)
the space is dense in ; 3. (3)
(Bernstein inequality) if and only if , and the following Bernstein inequalities hold true
[TABLE]
4.2. Sampling and Hilbert frames
A set of vectors in a Hilbert space is called a Hilbert frame if there exist constants such that for all
[TABLE]
The largest and smallest are called respectively the lower and the upper frame bounds and the ratio is known as the tightness of the frame. If then is a *tight * frame, and if it is called a *Parseval * frame. Parseval frames are similar in many respects to orthonormal bases. For example, if all members of a Parseval frame are unit vectors then it is an orthonormal basis.
According to the general theory of Hilbert frames [9], [11] the frame inequality (4.2) implies that there exists a dual frame (which is not unique in general) for which the following reconstruction formula holds
[TABLE]
In general it is not easy to find a dual frame. For this reason one can resort to the following frame algorithm (see [11], Ch. 5) which performs reconstruction by iterations. Given a relaxation parameter , set . Let and define recursively
[TABLE]
where is the frame operator which is defined on by the formula In particular, . Then with a geometric rate of convergence, that is,
[TABLE]
In particular, for the choice the convergence factor is
[TABLE]
4.3. Frames of averages in Paley-Wiener spaces
Theorem 4.2**.**
For a given there exists a constant such that for any , every metric -lattice with the corresponding set of functionals
[TABLE]
is a frame in , i. e.
[TABLE]
Proof.
Using Bernstein inequality (4.1) and global Poincaré inequality (3.7) one obtains for
[TABLE]
If for a fixed one picks
[TABLE]
then by choosing which satisfies we can move the first term on the right in (4.8) to the left side to obtain
[TABLE]
Opposite inequality follows from (3.2). Theorem is proven.
∎
Corollary 4.1**.**
For a given there exists a constant such that for any and every metric -lattice with every function in is completely determined by its averages (4.6) and can be reconstructed from them in a stable way by using formula (4.3). One can also use frame algorithm described by (4.4).
5. Average variational splines on metric measure spaces
5.1. Construction of average variational splines
We consider a sufficiently small , a fixed -lattice and the corresponding cover . Let
[TABLE]
where being the characteristic function of . Since all lattices have a uniform multiplicity one has that if then :
[TABLE]
Definition 3**.**
For a sufficiently large and a sequence the set of all functions in such that will be denoted by . In particular, the subspace corresponds to the trivial sequence .
We introduce defined as
[TABLE]
In general, every map depends on and on a lattice. To simply our framework we adopt the following assumption which holds true in many important cases.
Assumption 5.1**.**
There exists a such that for every and every lattice with sufficiently small the image of under is the entire .
We consider the following optimization problem:
For a given lattice and a sequence find a function in which minimizes the functional
[TABLE]
Theorem 5.2**.**
If the Assumptions 2.2, 5.1 are satisfied then the optimization problem has a unique solution for every sequence and every .
Proof.
The same problem for functional
[TABLE]
can be solved easily. For a given sequence consider a function in such that Such function exists due to the last assumption. Let denote the orthogonal projection of this function in the Hilbert space with the natural inner product
[TABLE]
on the subspace with the norm . Then the function will be the unique solution of the above minimization problem for the functional (5.2). Both existence and uniqueness follow from the fact that any two functions in are differ by an . Indeed,
- (1)
to show uniqueness notice that for any in one has , where and since
[TABLE] 2. (2)
minimality follows from
[TABLE]
where orthogonality of to with respect to (5.3) was used.
The problem with functional is that it is not a norm. But we already proved in Theorem 3.5 that the inner product (5.3) is equivalent to the inner product
[TABLE]
Thus the above procedure can be applied to the Hilbert space with the inner product (5.4) and it clearly proves existence and uniqueness of the solution of our minimization problem for the functional . Theorem is proved. ∎
Definition 4**.**
For the given the corresponding unique solution will be called the variational spline and denoted as .
We have the following characterization of the the above optimization problem.
Theorem 5.3**.**
For a sequence a function minimizes the functional (5.1) if and only if is orthogonal to in .
Proof.
If then any other function in has the form for some . If is orthogonal to then
[TABLE]
which shows that is the minimizer. Conversely, let and minimizes (5.1). For any one has
[TABLE]
It shows that the vector can be a minimizer only if since otherwise the minimizer would be given by the formula
[TABLE]
∎
5.2. Interpolation and approximation by average splines
Definition 5**.**
Consider a sufficiently small , a fixed -lattice and the corresponding cover . For we denote by the solution of the minimization problem such that We say that is a variational spline which interpolates by its average values on balls .
Note, that this terminology is justified since if and only if for every
[TABLE]
The following Lemma was proved in [15], [16].
Lemma 5.4**.**
If is a self-adjoint non-negative operator in a Hilbert space and for an and a positive the following inequality holds true
[TABLE]
then for the same , and all the following inequality holds
[TABLE]
as long as in the domain of .
Proof.
By the spectral theory [BS] there exist a direct integral of Hilbert spaces
[TABLE]
and a unitary operator from onto , which transforms domain of onto with norm
[TABLE]
and . According to our assumption we have for a particular
[TABLE]
and then for the interval we have
[TABLE]
[TABLE]
Since on
[TABLE]
This inequality implies the inequality
[TABLE]
or
[TABLE]
which means
[TABLE]
Now, by using induction one can finish the proof of the Lemma. The Lemma is proved. ∎
Remark 5.5**.**
By using Lemma 3.4 with one could have (3.9) with however, the inequality (5.5) is stronger.
Theorem 5.6**.**
For every and every the following inequality takes place
[TABLE]
In particular, if then
[TABLE]
where .
Proof.
If then since belongs to by (3.8) we have
[TABLE]
Using Lemma 5.4 with we obtain
[TABLE]
with and the minimality of gives
[TABLE]
Combining this inequality with the Bernstein inequality (4.1) we are coming to (5.7). Theorem is proven.
∎
As a summary we have the following statement.
Theorem 5.7**.**
Assume that the Assumptions 2.2, 5.1 are satisfied. Consider and where is from (5.7). For every -lattice and the corresponding set of functions defined in (3.6) every is uniquely determined by the set of values and can be reconstructed by the formula
[TABLE]
where the rate of convergence is
[TABLE]
with .
6. Average sampling and average splines on combinatorial graphs
6.1. Analysis on Graphs
Let denote an undirected weighted graph, with a finite or countable number of vertices and weight function . is symmetric, i.e., , and for all . The edges of the graph are the pairs with .
Our assumption is that for every the following finiteness condition holds
[TABLE]
Let denote the space of all complex-valued functions with the inner product
[TABLE]
and the norm
[TABLE]
Definition 6**.**
The weighted gradient norm of a function on is defined by
[TABLE]
The set of all for which the weighted gradient norm is finite will be denoted as .
Remark 6.1**.**
The factor makes up for the fact that every edge (i.e., every unordered pair ) enters twice in the summation. Note also that loops, i.e. edges of the type , in fact do not contribute.
We intend to prove Poincaré-type estimates involving weighted gradient norm.
In the case of a finite graph and -space the weighted Laplace operator is introduced via
[TABLE]
This graph Laplacian is a well-studied object; it is known to be a positive-semidefinite self-adjoint bounded operator.
According to Theorem 8.1 and Corollary 8.2 in [12] if for an infinite graph there exists a such that the degrees are uniformly bounded
[TABLE]
then operator which is defined by (6.2) on functions with compact supports has a unique positive-semidefinite self-adjoint bounded extension which is acting according to (6.2).
What is really important for us is that in both of these cases for the non-negative square root one has the equality
[TABLE]
for all . This fact is not difficult to show directly (see [13], [10]).
Lemma 6.2**.**
For all contained in the domain of , we have
[TABLE]
For , this implies
[TABLE]
Proof.
We obtain
[TABLE]
In the same way
[TABLE]
Averaging these equations yields
[TABLE]
Now the first equality follows by taking the non-negative square root of (note that by spectral theory, is also in the domain of , and (6.6) is an obvious consequence. ∎
7. A Poincaré-type inequality for finite graphs
It is well known that for every finite connected graph has as a simple eigenvalue of the Laplace operator and the corresponding eigenfunction is a constant on the entire graph. Given a connected and finite graph and a function we consider its average
[TABLE]
The notation is used for a constant function for all .
Theorem 7.1**.**
For every connected and finite graph (which contains more than one vertex) the following Poincaré-type inequality holds
[TABLE]
where is the first non-zero eigenvalue of .
Proof.
Note, that the average of the function is zero:
[TABLE]
If is the first nonzero eigenvalue of then is the first nonzero eigenvalue of the nonnegative square root . Since function is orthogonal to constants it implies
[TABLE]
But according to Lemma 6.2 it gives
[TABLE]
Theorem is proven. ∎
8. A Local and Global Poincare-type inequalities for finite and infinite graphs
Let be a finite or infinite and countable connected graph and is a finite and connected subset of vertices which we will treat as an induced graph and will denote by the same letter . We remind that this means that the set of vertices of such graph, which will be denoted as , is exactly the set of vertices in and the set of edges are all edges in whose both ends belong to . Let be the Laplace operator constructed according to (6.2) for such induced graph . The first nonzero eigenvalue of the operator operator will be denoted as . Let and
[TABLE]
be the corresponding weight functions. We notice that for every and every one has . However, in general .
Suppose that is a disjoint cover of by connected and finite subgraphs . We define functions by the formula
[TABLE]
where is the characteristic function of , and is the number of vertices in . We will be interestead in functionals on defined by these functions
[TABLE]
We will also need functions
[TABLE]
and corresponding functionals
[TABLE]
By using these notations we formulate the next two theorems. Our local Poincaré-type inequality is the following.
Theorem 8.1**.**
Let be a finite or infinite and countable graph. Let be a finite induced subgraph. Let be the Laplace operator of the induced graph whose first nonzero eigenvalue is . Then for every the following inequality holds
[TABLE]
where
[TABLE]
Clearly, it is a direct consequence of Theorem 7.1. The next Theorem contains what we call a global Poincaré-type inequality.
Theorem 8.2**.**
Let be a connected finite or infinite and countable graph. Suppose that is a disjoint cover of by connected and finite subgraphs . Let be the Laplace operator of the induced graph whose first nonzero eigenvalue is . We assume that that there exists a non zero lower boundary of all :
[TABLE]
In these notations the following inequality holds for every and every
[TABLE]
Proof.
One has
[TABLE]
For every we apply (3.5) to obtain the next inequality in which
[TABLE]
which holds for every positive . By using (8.1) we obtain
[TABLE]
[TABLE]
Summation over gives the following inequality
[TABLE]
[TABLE]
Since for all one has that and since sets are disjoint, it is obvious that the first term in the last line is not greater than
[TABLE]
It gives
[TABLE]
and by applying Theorem 6.2 we obtain (8.2). Theorem is proved. ∎
Remark 8.3**.**
We are making a list of differences between Poincaré inequalities we used on Dirichlet space and on combinatorial graphs.
- (1)
The Poincaré inequality on Dirichlet spaces (2.5) is formulated for balls, while a local Poincaré-type inequality for graphs (8.1) is for any finite induced subgraph. 2. (2)
There is a radius squared on the right-hand side in (2.5) and reciprocal of the first eigenvalue of the Laplacian on a corresponding induced subgraph on the right-hand side in (8.1). Note, that (8.1) is sharp. It obviously shows that if for every ball one has
[TABLE]
then our (8.1) implies a ”regularly” looking inequality. 3. (3)
In fact, one can implement in case of graphs the formulas (2.3) and (2.4) to see that
[TABLE]
and
[TABLE]
In this case the integral on the right-hand side of (2.5) corresponds to the quantity
[TABLE]
which is clearly not smaller than which appears on the right-hand side of (8.1).
9. A sampling theorem and a reconstruction methods using frames
Theorem 9.1**.**
If the assumptions of the previous Theorem hold then the set of functionals is a frame in any space as long as In other words, if
[TABLE]
then
[TABLE]
Proof.
Indeed, if then by the Bernstein inequality the (8.2) can be rewritten as
[TABLE]
If (9.1) holds then one has
[TABLE]
On the other hand, since
[TABLE]
one has
[TABLE]
Theorem is proven. ∎
Note, that for the classical Paley-Wiener spaces on the real line the inequalities similar to (9.2) in the case when are delta functions were proved by Plancherel and Polya. Today they are better known as the frame inequalities. Now we can formulate sampling theorem based on average values.
Theorem 9.2**.**
Under the same conditions and notations as above every function is uniquely determined by its averages and can be reconstructed from this set of values in a stable way.
9.1. Reconstruction algorithms in terms of frames
What we just proved in the previous section is that under the same assumptions as above the set of functionals is a frame in the subspace . This fact allows to apply formula(4.3) which describes a stable method of reconstruction of a function from a set of samples . Another possibility for reconstruction is to use the frame algorithm given bt (4.4).
10. Average Variational Splines and a reconstruction algorithm
10.1. Variational interpolating splines
As in the previous sections we assume that is a connected finite or infinite and countable graph and is a disjoint cover of by connected and finite subgraphs .
For a given sequence the set of all functions in such that will be denoted by . In particular, corresponds to the sequence of zeros. We consider the following optimization problem:
For a given sequence find a function in the set which minimizes the functional
[TABLE]
Similarly to Theorem 5.2 one can prove the following.
Theorem 10.1**.**
Under the above assumptions the optimization problem has a unique solution for every .
Proof.
Using Theorem 8.2 one can justify the following algorithm:
- (1)
Pick any function . 2. (2)
Construct where is the orthogonal projection of onto with respect to the inner product
[TABLE] 3. (3)
The function is the unique solution to the given optimization problem.
∎
Definition 7**.**
For the interpolating variational spline is denoted by and it is the solution of the minimization problem such that
One can easily prove the following characterization of variational splines
Theorem 10.2**.**
A function is a variational spline if and only if is orthogonal to .
10.2. Reconstruction using splines
By applying this Lemma and using the same reasoning as in the first part of the paper one can prove the following reconstruction theorem. Below we are keeping notations of Theorem 9.1.
Theorem 10.3**.**
If the assumptions of Theorem 9.1 are satisfied and in particular
[TABLE]
then any function in can be reconstructed from a set of its averages using the formula
[TABLE]
and the error estimate is
[TABLE]
Proof.
Pick an and apply (8.2) to the function . It gives for every :
[TABLE]
By Lemma 5.4 it implies the following inequality
[TABLE]
Using minimization property of and the Bernstein inequality (4.1) for one obtains (11.2) with
[TABLE]
The assertion follows from the assumption that . ∎
11. Example: Lattice
Let us consider a one-dimensional infinite lattice as an inveighed graph. The dual group of the commutative additive group is the one-dimensional torus. The corresponding Fourier transform on the space is defined by the formula
[TABLE]
It gives a unitary operator from on the space where is the one-dimensional torus and is the normalized measure. One can verify the following formula
[TABLE]
The next result is obvious.
Theorem 11.1**.**
The spectrum of the Laplace operator on the one-dimensional lattice is the interval . A function belongs to the space if and only if the support of is a subset of on which .
We consider the cover of by disjoint sets where runs over all even integers divisible by : . We treat every as an induced graph whose set of vertices is and which has only one edge . Functional takes form
[TABLE]
One can check that spectrum of the Laplace operator on defined by (6.2) contains just two values . Thus . For an and condition (9.1) takes form
[TABLE]
Note, that since for a large the fraction is close to the condition implies that one can have any . As an application of Theorem 9.2 we obtain the following result.
Theorem 11.2**.**
For every every function is uniquely determined by its average values (11.1) and can be reconstructed from them in a stable way.
In particular, if instead of infinite graph one would consider a path graph whose eigenvalues are given by formulas the last Theorem would mean that any eigenfunction with eigenvalue from a lower half of the spectrum is uniquely determined and can be reconstructed from averages (11.1).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Albeverio, Theory of Dirichlet forms and applications , (English summary) Lectures on probability theory and statistics (Saint-Flour, 2000), 1106, Lecture Notes in Math., 1816, Springer, Berlin, 2003.
- 2[2] N. Bouleau, F. Hirsch, Dirichlet forms and analysis on Wiener space , Walter de Gruyter, Berlin, New York, 1991.
- 3[3] R. Coifman, G. Weiss, Analyse harmonique non-commutative sur certains espaces homog‘enes , Lecture Notes in Math. 242, Springer-Verlag, 1971.
- 4[4] R. Coifman, G. Weiss, Extensions of Hardy spaces and their use in analysis , Bull. Amer. Math. Soc. 83 (1977), 569-645.
- 5[5] M. Fukushima, Y. Oshima, M. Takeda, Dirichlet forms and symmetric Markov processes , De Gruyter Studies in Mathematics vol 19, Walter De Gruyter and co, Berlin 1994.
- 6[6] I. Pesenson, A sampling theorem on homogeneous manifolds , Trans. Amer. Math. Soc. 352 (2000), no. 9, 4257–4269.
- 7[7] I. Pesenson, An approach to spectral problems on Riemannian manifolds, Pacific J. Math. 215/1 (2004), 183-199.
- 8[8] I. Pesenson, Poincare-type inequalities and reconstruction of Paley-Wiener functions on manifolds, J. of Geometric Analysis, (4), 1, (2004), 101-121.
