A New Condition for Blow-up Solutions to Discrete Semilinear Heat Equations on Networks
Soon-Yeong Chung, Min-Jun Choi

TL;DR
This paper introduces a new mathematical condition that guarantees blow-up solutions for discrete semilinear heat equations on networks, improving upon existing conditions.
Contribution
The paper proposes a novel condition (C) involving integral inequalities that ensures blow-up solutions, extending previous criteria for discrete heat equations on networks.
Findings
The new condition (C) broadens the class of nonlinearities leading to blow-up.
It relates the first eigenvalue of the discrete Laplacian to solution behavior.
The condition improves upon previously known criteria for blow-up.
Abstract
The purpose of this paper is to introduce a new condition \[ \hbox{(C)} \] for some with , where is the first eigenvalue of discrete Laplacian , with which we obtain blow-up solutions to discrete semilinear heat equations \begin{equation*} \begin{cases} u_{t}\left(x,t\right)=\Delta_{\omega}u\left(x,t\right)+f(u(x,t)), & \left(x,t\right)\in S\times\left(0,+\infty\right),\\ u\left(x,t\right)=0, & \left(x,t\right)\in\partial S\times\left[0,+\infty\right),\\ u\left(x,0\right)=u_{0}\geq0(nontrivial), & x\in\overline{S} \end{cases} \end{equation*} on a discrete network . In fact, it will be seen that the condition (C) improves the conditions known so far.
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.
A New Condition for Blow-up Solutions to Discrete Semilinear Heat Equations on Networks
Soon-Yeong Chung
Department of Mathematics and Program of Integrated Biotechnology, Sogang University, Seoul 04107, Korea
Min-Jun Choi
Department of Mathematics, Sogang University, Seoul 04107, Korea
Abstract
The purpose of this paper is to introduce a new condition
(C)
for some with , where is the first eigenvalue of discrete Laplacian , with which we obtain blow-up solutions to discrete semilinear heat equations
[TABLE]
on a discrete network . In fact, it will be seen that the condition (C) improves the conditions known so far.
keywords:
Semilinear Heat Equations, Discrete Laplacian, Comparison Principle, Blow-up.
MSC:
[2010] 39A12 , 39A13 , 39A70 , 35K57
††journal: Computers & Mathematics with Applications
0 Introduction
These days, the reaction-diffusion systems have found many applications ranging from chemical and biological phenomena to medicine, genetics, and so on. A typical example of the reaction-diffusion system is an auto-catalytic chemical reaction between several chemicals in which the concentration of each chemical grows (or decays) due to diffusion and difference of concentration (according to Fick*′*s law, for example) and whose phenomena is modeled by the reaction-diffusion system
[TABLE]
with some boundary and initial conditions where is the set of chemicals.
From a similar point of view, we discuss,in this paper, the blow-up property of solutions to the following discrete semilinear heat equations
[TABLE]
which generalizes the equation (1) and where denotes the discrete Laplacian operator (which will be introduced in Section 1).
The continuous case of this equation has been studied by many authors. For example, in , Levine [11] considered the formally parabolic equations of the form
[TABLE]
where and are positive linear operators defined on a dense subdomain of a real or complex Hilbert space . Here, he first introduced the concavity method and proved that there exists a time such that
[TABLE]
under the condition
[TABLE]
for some and the initial data satisfying
[TABLE]
where .
After this, Philippin and Proytcheva [16] have applied the above method to the equations
[TABLE]
and obtained a blow-up solution, under the condition (A) and the initial data satisfying
[TABLE]
Recently, Ding and Hu [9] adopted the condition (A) to get blow-up solutions to the equation
[TABLE]
with the nonnegative initial value and the null Drichlet boundary condition.
Besides, in [15, 14] Payne et al. obtained the blow-up solutions to the equations
[TABLE]
when the Neumann boundary data satisfies the condition (A).
On the other hands, the condition (A) was relaxed by Bandle and Brunner [1] and has been applied to the equations
[TABLE]
In fact, they introduced a condition
[TABLE]
and derived the blow-up solutions to the equation (5), under the condition (B) and the initial data satisfying
[TABLE]
for some .
Looking into the concavity method more closely, we can see that the proof consists of a series of inequalities with reasoning and the Poincare inequality including the eigenvalue. But the conditions (A) and (B) above are independent of the eigenvalue which depends on the domain. From this observation, we can expect to develop an improved condition which refines (A) or (B), depending on the domain. Being motivated by this point of view, we develop a new condition as follows: for some ,
[TABLE]
where and is the first eigenvalue of the discrete Laplacian . Here, we note that the term is depending on the domain graph.
In fact, it is expected that, with the condition (C), more interesting results should be obtained even in the continuous case, which will be our forth-coming work.
The blow-up solutions or global existence to the discrete equation (2) with the case , was already studied in [6] and [17]. Moreover, in [5] and [3], the authors gave a complete solutions under general case of Laplacian (-Laplacian) with . Besides, the long time behavior (extinction and positivity) of solutions to discrete evolution Laplace equation with absorption on networks was studied in [7] and [10].
The main theorem of this paper is as follows:
Theorem** (Concavity Method).**
For the function with the hypothesis (C), if the initial data satisfies
[TABLE]
then the solutions to the equation (2) blow up at finite time in the sense of
[TABLE]
where is the constant in the condition (C).
We organize this paper as follows: in Section 1, we introduce briefly the preliminary concepts on networks and comparison principles. Section 2 is the main section, which is devoted to blow-up solutions using the concavity method with the condition (C). Finally in Section 3, we discuss the condition (C), comparing with the conditions (A) and (B), together with the condition for the initial data.
1 Preliminaries and Discrete Comparison Principles
In this section, we start with the theoretic graph notions frequently used throughout this paper. For more detailed information on notations, notions, and conventions, we refer the reader to [4].
Definition 1.1**.**
- (i)
A graph is a finite set of with a set of (two-element subsets of ). Conventionally used, we denote by or the fact that is a vertex in . 2. (ii)
A graph is called if it has neither multiple edges nor loops 3. (iii)
* is called if for every pair of vertices and , there exists a sequence(called a ) of vertices such that and are connected by an edge(called ) for .* 4. (iv)
A graph is called a of if and . In this case, is a host graph of . If consists of all the edges from which connect the vertices of in its host graph , then is called an induced subgraph.
We note that an induced subgraph of a connected host graph may not be connected.
Throughout this paper, all the subgraphs are assumed to be induced, simple and connected.
Definition 1.2**.**
A on a graph is a symmetric function satisfying the following:
- (i)
, , 2. (ii)
* if ,* 3. (iii)
* if and only if ,*
and a graph with a weight is called a .
Definition 1.3**.**
For an induced subgraph of a , the (vertex) of is defined by
[TABLE]
Also, we denote by a graph whose vertices and edges are in . We note that by definition the set is an induced subgraph of .
Definition 1.4**.**
The degree of a vertex in a network (with boundary ) is defined by
[TABLE]
Definition 1.5**.**
For a function , the discrete Laplacian on is defined by
[TABLE]
for .
The following two lemmas are used throughout this paper.
Lemma 1.6** (See [12], [13]).**
For functions , the discrete Laplacian satisfies that
[TABLE]
In particular, in the case , we have
[TABLE]
Lemma 1.7** (See [12], [13]).**
There exist and , such that
[TABLE]
Moreover, is given by
[TABLE]
where .
In the above, the number is called the first eigenvalue of on a network with corresponding eigenfunction (see [2] and [8] for the spectral theory of the Laplacian operators).
We now briefly discuss the local existence and uniqueness of a solution for the equation
[TABLE]
where be locally Lipschitz continuous on .
Let be fixed and consider a Banach space
[TABLE]
with the norm .
Then it is easy to see that the operator given by
[TABLE]
is well-defined. In Lemma 1.8, we show that this operator is contractive on a small closed ball. Hence, we obtain the existence and uniqueness of a solution to the equation (7) in a small time interval , as a consequence of Banach*′*s fixed point theorem.
Lemma 1.8**.**
Let be locally Lipschitz continuous on . Then the operator is a contraction on the closed ball
[TABLE]
if is small enough.
Proof.
Consider and . Since is locally Lipschitz continuous on , there exists such that
[TABLE]
where Then for any ,
[TABLE]
where and denotes the number of nodes in . Moreover, it is easy to see that the above inequality still holds for . Hence choosing sufficiently small, we obtain a contraction on the closed ball into itself. ∎
Now, we state two types of comparison principles.
Theorem 1.9** (Comparison Principle).**
Let ( may be ) and be locally Lipschitz continuous on . Suppose that real-valued functions , are differentiable in for each and satisfy
[TABLE]
Then for all
Proof.
Let be arbitrarily given with . Since is locally Lipschitz continuous on , there exists such that
[TABLE]
where Let be the functions defined by
[TABLE]
[TABLE]
Then from (8), we have
[TABLE]
for all .
We recall that and are continuous on for each and is finite. Hence, we can find such that
[TABLE]
which implies that
[TABLE]
Then now we have only to show that .
Suppose that , on the contrary. Since on both and , we have . Then we obtain from (11) that
[TABLE]
and it follows from the differentiability of in for each that
[TABLE]
According to (9), we have
[TABLE]
since . Combining (12), (13), (14), we obtain the following:
[TABLE]
which contradicts (10). Therefore for all so that we get for all , since is arbitrarily given. ∎
Theorem 1.10** (Strong Comparison Principle).**
Let and be locally Lipschitz continuous on . Suppose that real-valued functions , are differentiable in for each and satisfy
[TABLE]
If for some , then for all
Proof.
First, note that on by above theorem. Let be arbitrarily given with . Since is locally Lipschitz continuous on , there exists such that
[TABLE]
where Let be the functions defined by
[TABLE]
Then for all . From the inequality (15), we have
[TABLE]
for all . Using (16), the inequality (17) becomes
[TABLE]
This implies
[TABLE]
since . Now, suppose there exists such that
.
Then we have
[TABLE]
Hence, together with inequality (17), we obtain the following.
.
Therefore, we have
[TABLE]
i.e.
[TABLE]
which implies that for all with . Now, for any there exists a path
[TABLE]
since is connected. By applying the same argument as above inductively we see that for every . This is a contradiction to (18). Since is arbitrarily given, we get for all . ∎
We note that by the comparison principle, if then solutions to the equation (7) are positive if initial data is nontrivial and nonnegative. On the other hand, it is quite natural that is positive, when dealing with the blow-up theory. Hence, throughout this paper, we always assume that a function is locally Lipschitz continuous on , , , and the initial data is nontrivial and nonnegative.
2 Blow-Up: Concavity Method
In this section, we discuss the blow-up phenomena of the solutions to the equation (7) by using concavity method, which is the main part of this paper. This method, introduced by Levine [11], uses the concavity of an auxiliary function. In fact, the concavity method is an elegant tool for deriving estimates and giving criteria for blow-up.
In order to state and prove our result, we introduce the following new condition: for some ,
[TABLE]
where .
Remark 2.1*.*
We will discuss the condition (C) in the next section, comparing with the conditions (A) and (B) introduced in the first section, together with the condition for the initial data.
We now state the main theorem of this paper:
Theorem 2.2**.**
For the function with the hypothesis (C), if the initial data satisfies
[TABLE]
then the solutions to the equation (7) blow up at finite time in the sense of
[TABLE]
where is the constant in the condition (C).
Proof.
First, we note that on , by the strong comparison principle. Now, we define a functional by
[TABLE]
Then by (19),
[TABLE]
Multiplying the equation (7) by and summing up over , we obtain from Lemma 1.6 that
[TABLE]
Multiplying the equation (7) by and summing up over , we obtain from Lemma 1.6 that
[TABLE]
and
[TABLE]
Then it follows that
[TABLE]
Moreover, it follows from (21) that
[TABLE]
and
[TABLE]
Now, we introduce a new function
[TABLE]
where is a constant to be determined later. Then it is easy to see that
[TABLE]
Then we use (20), the condition (C), Lemma 1.7, and (22) in turn to obtain
[TABLE]
Using the Schwarz inequality, we obtain
[TABLE]
where is arbitrary. Combining the above estimates (23), (24), and (25), we obtain that for ,
[TABLE]
Since by assumption, we can choose to be large enough so that
[TABLE]
This inequality (26) implies that for ,
[TABLE]
Therefore, it follows that cannot remain finite for all . In other words, the solutions blow up in finite time . ∎
Remark 2.3*.*
The above blow-up time can be estimated roughly. Taking
[TABLE]
we see that
[TABLE]
which implies
[TABLE]
where . Then the blow-up time satisfies
[TABLE]
3 Discussion on the Condition (C) and
As seen in the proof of Theorem 2.2, the concavity method is a tool for deriving the blow-up solution via the auxiliary function under the condition (A), (B), or (C), by imposing , instead of the large initial data.
In this section, we compare the conditions (A), (B), and (C) each other and discuss the role of .
First, let us recall the conditions as follows: for some ,
[TABLE]
for every , where and . Here, note that the constants may be different in each case.
Then it is easy to see that (A) implies (B) and (B) implies (C), in turn. The difference between (B) and (C) is whether or not they depend on the domain. The condition (B) is independent of the eigenvalue which depends on the domain. However, the condition (C) depends on domain, due to the term with . From this point of view, the condition (C) can be understood as a refinement of (B), corresponding to the domain. On the contrary, if a function satisfies (C) for every domain graph with boundary, then the eigenvalue can be arbitrary small so that the condition (C) get closer to (B) arbitrarily. Besides, as far as the authors know, there has not been any noteworthy condition for the concavity method other than (A) or (B).
On the other hand, using the fact that (C) is equivalent to
[TABLE]
we can easily see that for every ,
[TABLE]
for some constants , , and with , where , , and are nondecreasing function on . Here also, the constants may be different in each case. We note here that the nondecreasing functions is nonnegative on , but and may not be nonnegative, in general.
Lemma 3.1**.**
Let be a function satisfying (C) and , , where . Then the condition (C) implies that there exists such that for . In this case, we can find such that , . Moreover, the conditions (B) and (C) are equivalent.
Proof.
First, it follows from (27) and the fact that and so that
[TABLE]
which goes to , as . So, we can find such that , which implies that
[TABLE]
Putting it into the condition (C), we obtain
[TABLE]
or
[TABLE]
which gives
[TABLE]
for some and another constant .
Now, assume that the condition (C) is true. Since and , , it follows from (C) that
[TABLE]
where and . This implies that for every ,
[TABLE]
which gives (B).
∎
Remark 3.2*.*
It is well known that if for some , the solutions to equation (7) is global. On the contrary, it has not been clear yet whether or not the condition guarantees the blow-up solution. Instead, when , for some and , the solutions to the equation (7) blow up in a finite time, only if the initial data is sufficiently large i.e. , where (for more details, see [5]).
In general, only the condition (C) may not guarantee the blow-up solutions for any initial data . In fact, we can easily see that a linear function satisfies (C) if and only if . However, for any function ,
[TABLE]
which means that there is no initial data satisfying , when , . Of course, it is well known that the solutions to (7) is global, in this case.
So, from now on, we are going to discuss when we can find initial data satisfies .
Lemma 3.3**.**
Let satisfy the condition (C). If there exists such that , where , then there exists the initial data such that . Here, .
Proof.
Since is continuous on , there exist with such that , . Then for every function satisfying
[TABLE]
It follows that
[TABLE]
Therefore, . ∎
Corollary 3.4**.**
- (i)
If there exists such that , for every , then for every with
[TABLE]
we see that . 2. (ii)
If , for every , then the solutions blow up for every initial data .
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
This work was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education (NRF-2015R1D1A1A01059561). In addition, the authors would like to express thanks to anonymous reviewers for their excellent suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] C. Bandle and H. Brunner, Blow-up in diffusion equations, a survey , J. Comput. Appl. Math. 97 97 97 ( 1998 ) 1998 (1998) , 3 − 22 3 22 3-22 .
- 2[2] F. R. K. Chung, Spectral graph theory , CBMS Regional Conference Series in Math. 92 92 92 , Amer. Math. Soc. 1997 1997 1997 .
- 3[3] S.-Y. Chung, Critical Blow-Up and Global Existence for Discrete Nonlinear p-Laplacian Parabolic Equations , Discrete Dyn. Nat. Soc. ( 2014 ) 2014 (2014) , Art. ID 716327 716327 716327 , 10 10 10 pp.
- 4[4] S.-Y. Chung and C. A. Berenstein, ω 𝜔 \omega -harmonic functions and inverse conductivity problems on network , SIAM J. Appl. Math. 65 65 65 ( 2005 ) 2005 (2005) , 1200 − 1226 1200 1226 1200-1226 .
- 5[5] S.-Y. Chung and M.-J. Choi Blow-up solutions and global solutions to discrete p-Laplacian parabolic equations , Abstr. Appl. Anal. ( 2014 ) 2014 (2014) , Art. ID 351675 351675 351675 , 11 11 11 pp.
- 6[6] S.-Y. Chung, J.-H. Lee, Blow-up for Discrete Reaction-Diffusion Equations on Networks , Appl. Anal. Discrete Math. 9 9 9 ( 2015 ) 2015 (2015) , 103 – 119 103 – 119 103–119 .
- 7[7] Y.-S. Chung, Y.-S. Lee and S.-Y. Chung, Extinction and positivity of solutions of the heat equations with absorption on networks , J. Math. Anal. Appl. 380 380 380 ( 2011 ) 2011 (2011) , 642 − 652 642 652 642-652 .
- 8[8] D.M. Cvetkovic, M. Doob and H.Sachs, Spectra of graphs, Theory and applications . Acad. Press, New York, 1980 1980 1980 .
