Volume 2011, Issue 1 937079
Research Article
Open Access

Extinction and Positivity of the Solutions for a p-Laplacian Equation with Absorption on Graphs

Qiao Xin

Corresponding Author

Qiao Xin

College of Mathematics and Statistics, Chongqing University, Chongqing 401331, China cqu.edu.cn

Search for more papers by this author
Chunlai Mu

Chunlai Mu

College of Mathematics and Statistics, Chongqing University, Chongqing 401331, China cqu.edu.cn

Search for more papers by this author
Dengming Liu

Dengming Liu

College of Mathematics and Statistics, Chongqing University, Chongqing 401331, China cqu.edu.cn

Search for more papers by this author
First published: 19 September 2011
Citations: 5
Academic Editor: Alain Miranville

Abstract

We deal with the extinction of the solutions of the initial-boundary value problem of the discrete p-Laplacian equation with absorption ut = Δp,ωuuq with p > 1, q > 0, which is said to be the discrete p-Laplacian equation on weighted graphs. For 0 < q < 1, we show that the nontrivial solution becomes extinction in finite time while it remains strictly positive for p ≥ 2, q ≥ 1 and qp − 1. Finally, a numerical experiment on a simple graph with standard weight is given.

1. Introduction

The discrete analogue of the Laplacian on networks, the so-called discrete Laplacian, can be used in various areas, for example, modeling energy flows through a network or modeling vibration of molecules [14]. However, many phenomena on some cases cannot be expressed well by the discrete Laplacian. In view of this, a nonlinear operator, called the discrete p-Laplacian, has recently been studied by many researchers in various fields, such as dynamical systems and image processing [57].

Our interest in this work can be considered as a discrete analogue of the following initial boundary value problem for the p-Laplacian equation with absorption:
()
where Ω is a bounded domain in Rn. In fact, all the continuous regularization methods (local or nonlocal) with a given discretization scheme can be considered as particular cases of our proposed discrete regularization. Since the proposed framework is directly expressed in a discrete setting, no partial difference equations resolution is needed. Equation (1.1) has been extensively studied. In [8], the existence, uniqueness, regularity, and behavior of solutions to the initial-boundary value problem for (1.1) has been studied. Moreover, in [9], Gu proved that, for λ > 0, if p ∈ (1,2) or q ∈ (0,1) the solutions of the problem vanish in finite time, but if p ≥ 2 and q ≥ 1, there is nonextinction [9, Example  2 and Theorem  3.3]. In the absence of absorption (i.e., λ = 0), DiBenedetto [10] and Hongjun et al. [11] proved that the necessary and sufficient conditions for the extinction to occur is p ∈ (1,2).
The ω-heat equation ut(x, t) = Δωu(x, t), which can be interpreted as a heat (or energy) diffusion equation on electric networks, has been studied by a number of authors such as [1, 3, 1215] and so on, for example, the solvability of direct problems such as the Dirichlet and Neumann boundary value problems of the ω-Laplace equation, the global uniqueness of the inverse problem of the equation under the monotonicity condition, moreover, finding solutions to their initial and boundary problems, and representing them by means of their kernels have also been studied. Recently, in [16], Chung et al. considered the homogeneous Dirichlet boundary value problem for the ω -heat equation with absorption on a network:
()
The absorption term denotes that the heat flows through networks are influenced by the reactive forces proportional to the power of their potentials. The authors proved that if 0 < q < 1, a nontrivial solution of (1.2) becomes extinction in finite time, but if q ≥ 1, it remains strictly positive. However, a lot of material usually have complicated interconnection governed by their intrinsic characteristics and to express such a feature, it needs to be a more complex systems than simple linear equations on networks. So many authors have adapted nonlinear operators which is useful to describe natures on networks and one of those operators is a discrete p-Laplacian which is a generalized nonlinear operator of the discrete Laplacian. And then, the present paper is devoted to the discrete analogues of (1.1) on networks, that is, we consider the following discrete p-Laplacian equation:
()
where G is a finite simple graph, p > 1, q > 0, and u0(x) is a nonnegative function on graph G. The main work of this paper is to show, for 0 < q < 1, the nontrivial solution becomes extinction in finite time while it remains strict positive in the case p ≥ 2, q ≥ 1 and qp − 1.

2. Preliminary

In this section, we will begin with some definitions of graph theoretic notions, which are frequently used throughout this paper.

Let G be a finite simple, connected, and undirected graph, VG and EG denote its vertex set and its edge set, respectively. Two vertices x, y are adjacent if they are connected by an edge, in this case, we write x ~ y or (x, y) ∈ E. Moreover, we also omit the subscript G in VG, EG, and so forth, if G is clear from context. In general, we can split the set of vertexes V into two disjoint subsets S and S such that V = SS, which are called the interior and the boundary of V. A weight on a graph G is a function ω : V × V → [0, ) satisfying
()
Since the set of edge is uniquely determined by the weight, thus the simple weighted graph G(V, E; ω) can be simply denoted by (V; ω).
Throughout this paper, we consider the space of functions on vertex sets of the graph. The integration of function f : VR on a simple weighted graph G(V; ω) is defined as
()
As usual, the set C1(V × (0, )) consists of all functions u defined on V × (0, ) which is satisfy u(x, t) ∈ C1(0, ) for each xV. Further, for convenience, we denote
()
where T is a fixed positive real number or .
Finally, in the case of p > 1, for a function f : VR, the graph p-directional derivative of f to the direction y for xV is defined by
()
and the graph p-Laplacian Δp,ω of a function on G(V; ω) is defined as follows:
()
where
()
Note that, the p-Laplacian operator is nonlinear, with the exception of p = 2. For p = 2, it becomes the standard graph Laplacian.

3. p-Laplacian Equations with Absorption on Graphs

Before studying our problem, we will give a lemma, which will be frequently used in our later proofs.

Lemma 3.1 (see [17], Lemma  2.1.)For any p ∈ (1, +) and a, bR, one has

()
where C1 and C2 are positive constants depending only on p.

Theorem 3.2 (uniqueness for BVP). Let Ψ be a continuous and increasing function, then the initial-boundary value problem

()
admits a unique solution in C1(VT).

Proof. Suppose both u and are two solutions of (3.2) and let . Next, we introduce an energy functional as the form

()
where 0 ≤ t < T. Taking the derivative of E(t) with respect to t, and applying Lemma 3.1 and Fubini′s theorem, we get
()
which means E(t) ≤ E(0) = 0 for all 0 ≤ t < T. Furthermore, we can conclude that v ≡ 0 in VT.

Remark 3.3. Similar to the process of the proof of Theorem 3.2, it is easy to prove that the uniqueness of the following initial value problem

()
holds in C1(VT).

Now, we give a comparison principle.

Theorem 3.4. Let Ψ be a continuous and increasing function, and suppose satisfy

()
then, for all (x, t) ∈ ST.

Proof. Letting

()
then we have
()
Putting
()
then it is obvious that v+ = 0 on ΓT. Now, multiplying both sides of (3.8) by v+, and integrating over (0, t), we obtain
()
Setting
()
We will assume that J(t) ≠ for each t ∈ (0, T), and establish a contradiction. Integrating (3.8) over J(t) and applying Fubini′s theorem, we get
()
Defining
()
and using Lemma 3.1, then for any (x, t) and (y, t) ∈ VT, we arrive at
()
On the other hand, we have
()
Next, our goal is to estimate the two terms in the right side of the above equality. First, applying Fubini′ theorem and (3.12), we have
()
On the other hand, if xJ(t) and yVJ(t), we then have v(x, t) > 0 and v(y, t) < 0. Furthermore, we get v(y, t) − v(x, t) < 0. Thus, by (3.14), we get
()
In addition, noticing that
()
therefore, the right side of (3.12) is negative, which is a contradiction. The proof of Theorem 3.4 is complete.

From the above theorem, we can obtain the following result which is similar to [16].

Corollary 3.5. Assume that uVT satisfies

()
Then, u ≥ 0 in ST.

Remark 3.6. It follows from the above corollary that (3.19) is equivalent to the equation

()

4. Extinction and Positivity of the Solution

In this section, we investigate the extinction phenomenon and the positivity property of the solutions of the discrete p-Laplacian with absorption on graphs with boundary.

Theorem 4.1 (extinction). Let 0 < q < 1. Suppose uC1(V × [0, ) satisfies

()
there exists a finite time T > 0 such that u(x, t) ≡ 0 for all (x, t) ∈ V × [T, ).

Proof. The proof is similar to Theorem  4.3 in [16], we omit the details here.

Theorem 4.2 (positivity). Let q ≥ 1, p ≥ 2. Suppose q + 1 ≥ p and uC1(V × [0, )) satisfies

()
Then u(x, t) > 0 for all (x, t) ∈ S × (0, ). Moreover, one has
()
for t > T1, where c, ρ0, T1 is independent on u(x, t).

Proof. In order to obtain the positivity of the solutions, we first introduce a transformation,

()
then after a simple computation, it is easy to verify that v is the solution of the following problem:
()
Multiplying both sides of (4.5)1 by v, and integrating on S, we have
()
Meanwhile, multiplying (4.5)1 by vs, and integrating on S, we get
()
Define
()
Noticing that p ≥ 2 and q ≥ 1, we have
()
Therefore, we can choose ρ = ρ0 small enough such that E(0) < 0. Moreover, from (4.8) and (4.9), it follows that
()
On the other hand, taking ρ = ρ0 in (4.6), and combining (4.6) with (4.10), we get
()
Setting y(s) = ∫Sv2, since q + 1 − p ≥ 0, we have
()
Due to (4.12), there exists s0 > 0, c > 0, such that y(s) ≥ c for s > s0. By transformation (4.4), we get
()
for t > T1, where c, ρ0, T1 is independent on u(x, t).

Remark 4.3. By Theorem 4.2, when p = 2 and q ≥ 1, the solution also remain strictly positive. In this case, our result is consistent with that in [16], but the method is very different from that previously used in [16].

5. Numerical Experiment

In this section, we consider a graph G whose vertices S = {x1, x2, x3} and S = {x4, x5} are linked as the above figure (see Figure 1) with the standard weight (i.e., w(x, y) = 1).

Details are in the caption following the image
The graph.
Let u be a solution of
()
with the following initial condition u0(x1) = 10, u0(x2) = 5, u0(x3) = 0.5 and boundary condition u(x4, t) = 0, u(x5, t) = 0. Then, we obtain the following system of first order ordinary differential equations in terms of interior nodes:
()
Since the above ordinary differential equations is nonlinear, we choose the following explicit difference scheme to compute the numerical solution:
()
where un(xi) = u(xi, nΔt), for i = 1,2, …, 5 and n = 0,1, 2, …. We should point out that the time step must be set small enough, if not, the images of the function u(xi, t), i = 1,2, 3 will appear oscillation phenomena near zero. Set q = 0.3, take p = 3.1 and p = 2, respectively. By Theorem 4.1, we have functions ui(x, t), i = 1,2, 3 will vanish in finite time.

In the numerical experiment, the time step is chosen as 0.005, the numerical experiment result is shown in Figure 2, the solutions extinct after 1800 iterations, that is, t = 9. The green curve is the image of function u(x1, t), the image of function u(x2, t) is the red curve, and the image of function u(x3, t) is expressed by the blue one for q = 3.1 and q = 2, respectively.

Details are in the caption following the image
Extinction of the solutions.

Acknowledgments

This paper is supported in part by NSF of China 11071266 and in part by Natural Science Foundation Project of CQ CSTC (2010BB9218).

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.