Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Recursive reordering and elimination method for efficient computation of PageRank problems

  • Received: 23 May 2023 Revised: 25 July 2023 Accepted: 04 August 2023 Published: 29 August 2023
  • MSC : 65C40, 65F10

  • The PageRank model is widely utilized for analyzing a variety of scientific issues beyond its original application in modeling web search engines. In recent years, considerable research effort has focused on developing high-performance iterative methods to solve this model, particularly when the dimension is exceedingly large. However, due to the ever-increasing extent and size of data networks in various applications, the computational requirements of the PageRank model continue to grow. This has led to the development of new techniques that aim to reduce the computational complexity required for the solution. In this paper, we present a recursive 5-type lumping algorithm combined with a two-stage elimination strategy that leverage characteristics about the nonzero structure of the underlying network and the nonzero values of the PageRank coefficient matrix. This method reduces the initial PageRank problem to the solution of a remarkably smaller and sparser linear system. As a result, it leads to significant cost reductions for computing PageRank solutions, particularly in scenarios involving large and/or multiple damping factors. Numerical experiments conducted on over 50 real-world networks demonstrate that the proposed methods can effectively exploit characteristics of PageRank problems for efficient computations.

    Citation: Zhao-Li Shen, Yu-Tong Liu, Bruno Carpentieri, Chun Wen, Jian-Jun Wang. Recursive reordering and elimination method for efficient computation of PageRank problems[J]. AIMS Mathematics, 2023, 8(10): 25104-25130. doi: 10.3934/math.20231282

    Related Papers:

    [1] Weaam Alhejaili, Mohammed. K. Elboree, Abdelraheem M. Aly . A symbolic computation approach and its application to the Kadomtsev-Petviashvili equation in two (3+1)-dimensional extensions. AIMS Mathematics, 2022, 7(11): 20085-20104. doi: 10.3934/math.20221099
    [2] Wafaa B. Rabie, Hamdy M. Ahmed, Taher A. Nofal, Soliman Alkhatib . Wave solutions for the (3+1)-dimensional fractional Boussinesq-KP-type equation using the modified extended direct algebraic method. AIMS Mathematics, 2024, 9(11): 31882-31897. doi: 10.3934/math.20241532
    [3] Junjie Li, Gurpreet Singh, Onur Alp İlhan, Jalil Manafian, Yusif S. Gasimov . Modulational instability, multiple Exp-function method, SIVP, solitary and cross-kink solutions for the generalized KP equation. AIMS Mathematics, 2021, 6(7): 7555-7584. doi: 10.3934/math.2021441
    [4] Abeer S. Khalifa, Hamdy M. Ahmed, Niveen M. Badra, Jalil Manafian, Khaled H. Mahmoud, Kottakkaran Sooppy Nisar, Wafaa B. Rabie . Derivation of some solitary wave solutions for the (3+1)- dimensional pKP-BKP equation via the IME tanh function method. AIMS Mathematics, 2024, 9(10): 27704-27720. doi: 10.3934/math.20241345
    [5] Boyu Wang . A splitting lattice Boltzmann scheme for (2+1)-dimensional soliton solutions of the Kadomtsev-Petviashvili equation. AIMS Mathematics, 2023, 8(11): 28071-28089. doi: 10.3934/math.20231436
    [6] Jamilu Sabi'u, Sekson Sirisubtawee, Surattana Sungnul, Mustafa Inc . Wave dynamics for the new generalized (3+1)-D Painlevé-type nonlinear evolution equation using efficient techniques. AIMS Mathematics, 2024, 9(11): 32366-32398. doi: 10.3934/math.20241552
    [7] Zheng Dou, Kexin Luo . Global weak solutions of nonlinear rotation-Camassa-Holm model. AIMS Mathematics, 2023, 8(7): 15285-15298. doi: 10.3934/math.2023781
    [8] Yaya Wang, Md Nurul Raihen, Esin Ilhan, Haci Mehmet Baskonus . On the new sine-Gordon solitons of the generalized Korteweg-de Vries and modified Korteweg-de Vries models via beta operator. AIMS Mathematics, 2025, 10(3): 5456-5479. doi: 10.3934/math.2025252
    [9] Ninghe Yang . Exact wave patterns and chaotic dynamical behaviors of the extended (3+1)-dimensional NLSE. AIMS Mathematics, 2024, 9(11): 31274-31294. doi: 10.3934/math.20241508
    [10] Yunxi Guo, Ying Wang . The Cauchy problem to a gkCH equation with peakon solutions. AIMS Mathematics, 2022, 7(7): 12781-12801. doi: 10.3934/math.2022707
  • The PageRank model is widely utilized for analyzing a variety of scientific issues beyond its original application in modeling web search engines. In recent years, considerable research effort has focused on developing high-performance iterative methods to solve this model, particularly when the dimension is exceedingly large. However, due to the ever-increasing extent and size of data networks in various applications, the computational requirements of the PageRank model continue to grow. This has led to the development of new techniques that aim to reduce the computational complexity required for the solution. In this paper, we present a recursive 5-type lumping algorithm combined with a two-stage elimination strategy that leverage characteristics about the nonzero structure of the underlying network and the nonzero values of the PageRank coefficient matrix. This method reduces the initial PageRank problem to the solution of a remarkably smaller and sparser linear system. As a result, it leads to significant cost reductions for computing PageRank solutions, particularly in scenarios involving large and/or multiple damping factors. Numerical experiments conducted on over 50 real-world networks demonstrate that the proposed methods can effectively exploit characteristics of PageRank problems for efficient computations.



    The prominent Banach contraction in metric spaces has laid a solid foundation for fixed point theory in metric space. The basic idea of the contraction mapping principle has been fine-tuned in several domains (see, e.g. [12,13,15]). The applications of fixed point range across inequalities, approximation theory, optimization and so on. Researchers in this area have introduced several new concepts in metric space and obtained a great deal of fixed point results for linear and nonlinear contractions. Recently, Karapınar et al. [7] introduced a new notion of hybrid contraction which is a unification of some existing linear and nonlinear contractions in metric space.

    On the other hand, Mustafa [8] pioneered an extension of metric space by the name, generalized metric space (or more precisely, G-metric space) and proved some fixed point results for Banach-type contraction mappings. This new generalization was brought to spotlight by Mustafa and Sims [9]. Subsequently, Mustafa et al. [11] obtained some engrossing fixed point results for Lipschitzian-type mappings on G-metric space. However, Jleli and Samet [5], as well as Samet et al. [16] noted that most of the fixed point results in G-metric space are direct consequences of existence results in corresponding metric space. Jleli and Samet [5] further observed that if a G-metric is consolidated into a quasi-metric, then the resultant fixed point results become the known fixed point results in the setting of quasi-metric space. Motivated by the latter observation, many investigators (see for instance, [3,6]) have established techniques of obtaining fixed point results in symmetric G-metric space that are not deducible from their ditto ones in metric space or quasi-metric space.

    Following the existing literature, we realize that hybrid fixed point results in G-metric space are not adequately investigated. Hence, motivated by the ideas in [3,6,7], we introduce a new concept of hybrid-interpolative Reich-Istr˘aţescu-type (G-α-μ)-contraction in G-metric space and prove some related fixed point theorems. An example is constructed to demonstrate that our result is valid, an improvement of existing result and the main ideas obtained herein do not reduce to any existence result in metric space. A corollary is presented to show that the concept proposed herein is a generalization and improvement of well-known fixed point result in metric space. Finally, one of our obtained corollaries is applied to establish novel existence conditions for solution of a class of integral equations.

    In this section, we will present some fundamental notations and results that will be deployed subsequently.

    All through, every set Φ is considered non-empty, N is the set of natural numbers, R represents the set of real numbers and R+, the set of non-negative real numbers.

    Definition 2.1. [9] Let Φ be a non-empty set and let G:Φ×Φ×ΦR+ be a function satisfying:

    (G1) G(r,s,t)=0 if r=s=t;

    (G2) 0<G(x,r,s) for all r,sΦ with rs;

    (G3) G(r,r,s)G(r,s,t), for all r,s,tΦ with ts;

    (G4) G(r,s,t)=G(r,t,s)=G(s,r,t)=... (symmetry in all variables);

    (G5) G(r,s,t)G(r,u,u)+G(u,s,t), for all r,s,t,uΦ (rectangular inequality).

    Then the function G is called a generalised metric, or more precisely, a G-metric on Φ, and the pair (Φ,G) is called a G-metric space.

    Example 2.2. [11] Let (Φ,d) be a usual metric space, then (Φ,Gp) and (Φ,Gm) are G-metric space, where

    Gp(r,s,t)=d(r,s)+d(s,t)+d(r,t)r,s,tΦ. (2.1)
    Gm(r,s,t)=max{d(r,s),d(s,t),d(r,t)}r,s,tΦ. (2.2)

    Definition 2.3. [11] Let (Φ,G) be a G-metric space and let {rn} be a sequence of points of Φ. Then {rn} is said to be G-convergent to r if limn,mG(r,rn,rm)=0; that is, for any ϵ>0, there exists n0N such that G(r,rn,rm)<ϵ, n,mn0. We refer to r as the limit of the sequence {rn}.

    Proposition 1. [11] Let (Φ,G) be a G-metric space. Then the following are equivalent:

    (i) {rn} is G-convergent to r.

    (ii) G(r,rn,rm)0, as n,m.

    (iii) G(rn,r,r)0, as n.

    (iv) G(rn,rn,r)0, as n.

    Definition 2.4. [11] Let (Φ,G) be a G-metric space. A sequence {rn} is called G-Cauchy if for any ϵ>0, we can find n0N such that G(rn,rm,rl)<ϵ, n,m,ln0, that is, G(rn,rm,rl)0, as n,m,l.

    Proposition 2. [11] If (Φ,G) is a G-metric space, the following statements are equivalent:

    (i) The sequence {rn} is G-Cauchy.

    (ii) For every ϵ>0, there exists n0N such that G(rn,rm,rm)<ϵ, n,mn0.

    Definition 2.5. [11] Let (Φ,G) and (Φ,G) be two G-metric spaces and f:(Φ,G)(Φ,G) be a function. Then f is G-continuous at a point uΦ if and only if for any ϵ>0, there exists δ>0 such that r,sΦ; and G(u,r,s)<δ implies G(f(u),f(r),f(s))<ϵ. A function f is G-continuous on Φ if and only if it is G-continuous at all uΦ.

    Proposition 3. [11] Let (Φ,G) and (Φ,G) be two G-metric spaces. Then a function f:(Φ,G)(Φ,G) is said to be G-continuous at a point rΦ if and only if it is G-sequentially continuous at r, that is, whenever {rn} is G-convergent to r, {frn} is G-convergent to fr.

    Definition 2.6. [11] A G-metric space (Φ,G) is called symmetric G-metric space if

    G(r,r,s)=G(s,r,r)r,sΦ.

    Proposition 4. [11] Let (Φ,G) be a G-metric space. Then the function G(r,s,t) is jointly continuous in all variables.

    Proposition 5. [11] Every G-metric space (Φ,G) defines a metric space (Φ,dG) by

    dG(r,s)=G(r,s,s)+G(s,r,r)r,sΦ. (2.3)

    Note that for a symmetric G-metric space (Φ,G),

    (Φ,dG)=2G(r,s,s)r,sΦ. (2.4)

    On the other hand, if (Φ,G) is not symmetric, then by the G-metric properties,

    32G(r,s,s)dG(r,s)3G(r,s,s)r,sΦ, (2.5)

    and that in general, these inequalities are sharp.

    Definition 2.7. [11] A G-metric space (Φ,G) is referred to as G-complete (or complete G-metric) if every G-Cauchy sequence in (Φ,G) is G-convergent in (Φ,G).

    Proposition 6. [11] A G-metric space (Φ,G) is G-complete if and only if (Φ,dG) is a complete metric space.

    Popescu [14] gave the following definition in the setting of metric space.

    Definition 2.8. [14] Let α:Φ×ΦR+ be a function. A self-mapping Γ:ΦΦ is referred to as α-orbital admissible if for all rΦ,

    α(r,Γr)1 α(Γr,Γ2r)1.

    We modify the above definitions in the framework of G-metric space as follows:

    Definition 2.9. Let α:Φ×Φ×ΦR+ be a function. A self-mapping Γ:ΦΦ is called (G-α)-orbital admissible if for all rΦ,

    α(r,Γr,Γ2r)1 implies α(Γr,Γ2r,Γ3r)1.

    Definition 2.10. [2] Let α:Φ×Φ×ΦR+ be a mapping. The set Φ is called regular with respect to α if and only if for a sequence {rn} in Φ such that α(rn,rn+1,rn+2)1, for all n and rnrΦ as n, we have α(rn,r,r)1 for all n.

    The following Propositions 7 and 8 were studied in [7], where the constant CR+. However, we noticed that the arguments in their proofs are only valid if we restrict R+ to [0,1). Hence, we reexamine them in the latter interval.

    Proposition 7. Given C[0,1), let {ρn}R+ be a sequence such that

    ρn+2Cmax{ρn,ρn+1}nN. (2.6)

    Let K=max{ρ0,ρ1}. Then

    ρ2nCnK,ρ2n+1CnKn1. (2.7)

    Proof. The proof is by induction.

    For n=0, we have from (2.6) that

    ρ2Cmax{ρ0,ρ1}=CK.

    For n=1, (2.6) becomes

    ρ3Cmax{ρ1,ρ2}Cmax{ρ1,Cmax{ρ0,ρ1}}Cmax{ρ1,CK}CK.

    Suppose that (2.7) holds for some nN. Then

    ρ2n+2Cmax{ρ2n,ρ2n+1}Cmax{CnK,CnK}=Cn+1K;ρ2n+3Cmax{ρ2n+1,ρ2n+2}Cmax{CnK,Cn+1K}=Cn+1K.

    This completes the induction. Hence, the proof.

    Lemma 2.11. Let {rn} be a sequence in a G-metric space (Φ,G). Suppose that there exists C[0,1) such that

    G(rn+2,rn+3,rn+4)Cmax{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)}nN.

    Then {rn} is a G-Cauchy sequence in (Φ,G).

    Proof. Consider the sequence {ρn} in Φ defined by

    ρn=G(rn,rn+1,rn+2)nN.

    Then by the hypothesis, {ρn} satisfies (2.6). Hence, by Proposition 7, we obtain

    G(r2n,r2n+1,r2n+2)=ρ2nCnK;G(r2n+1,r2n+2,r2n+3)=ρ2n+1CnK,

    for all nN, where K=max{ρ0,ρ1}. In particular,

    G(r2n,r2n+1,r2n+2)+G(r2n+1,r2n+2,r2n+3)2CnKnN. (2.8)

    If C=0 or K=0, then {rn}n2 is constant, hence G-Cauchy. Assume that C>0 and K>0. To see that {rn}nN is G-Cauchy in (Φ,G), take arbitrary ϵ>0. Since ϵ2K>0 and 0<C<1, then we can find n0N such that

    i=n0Ci<ϵ2K.

    In particular,

    2Kpi=n0Ci<2Ki=n0Ci<ϵpN;pn0.

    Let l,m,nN, where 2n0n<m<l. Let pN be such that pn0+2 and 2pl. Then by rectangular inequality and (2.8), we have

    G(rn,rm,rl)l2j=nG(rj,rj+1,rj+2)2p2j=2n0G(rj,rj+1,rj+2)=p2q=n0[G(r2q,r2q+1,r2q+2)+G(r2q+1,r2q+2,r2q+3)]p2q=n02CqK=2Kpq=n0Cq<2Kq=n0Cq<ϵ.

    This completes the proof.

    Proposition 8. Given C[0,1) and σ(0,1), let {ρn}(0,1) be a sequence such that

    ρn+2Cmax{ρn,ρn+1}σnN. (2.9)

    Let K=max{ρ0,ρ1}. Then

    ρ2nC1+σ+σ2+...+σn1Kσn,ρ2n+1C1+σ+σ2+...+σn1Kσnn1. (2.10)

    Therefore,

    lim supnρnC11σ.

    Proof. The result holds if C=0. Assume C>0. Since σ(0,1), then obviously,

    σm+1<σm<σm1<...<σ2<σmN;m1.

    Therefore, since K(0,1), we have

    Kσm+1<Kσm<Kσm1<...<Kσ2<KσmN;m1.

    Consider (2.9) and let n=0. Then

    ρ2Cmax{ρ0,ρ1}σCKσ.

    For n=1, we obtain

    ρ3Cmax{ρ1,ρ2}σCmax{ρ1,CKσ}σCmax{K,CKσ}σ=Cmax{Kσ,CσKσ2}Cmax{Kσ,CσKσ}=CKσmax{1,Cσ}=CKσ.

    Now, assume that (2.10) holds for some nN. We then prove that it holds for n+1. Therefore,

    ρ2n+2Cmax{ρ2n,ρ2n+1}σCmax{C1+σ+σ2+...+σn1Kσn,C1+σ+σ2+...+σn1Kσn}σ=C(C1+σ+σ2+...+σn1Kσn)σ=C(Cσ+σ2+...+σnKσn+1)=C1+σ+σ2+...+σnKσn+1.

    Similarly,

    ρ2n+3Cmax{ρ2n+1,ρ2n+2}σCmax{C1+σ+σ2+...+σn1Kσn,C1+σ+σ2+...+σnKσn+1}σ=Cmax{Cσ+σ2+...+σnKσn+1,Cσ+σ2+...+σn+1Kσn+2}Cmax{Cσ+σ2+...+σnKσn+1,Cσ+σ2+...+σn+1Kσn+1}=CKσn+1max{Cσ+σ2+...+σn,Cσ+σ2+...+σn+1}=CKσn+1(Cσ+σ2+...+σn)=C1+σ+σ2+...+σnKσn+1.

    This completes the induction, therefore, verifying (2.10). Noting that {σn}nN0 as n, it is obvious that {Kσn}nNK0=1. Also,

    limn(1+σ+σ2+...+σn)i=0σi=11σ.

    Therefore,

    limnC1+σ+σ2+...+σn=C(11σ).

    Corollary 1. Let {rn} be a sequence in a G-metric space (Φ,G). Assume that there exist C[0,1) and θ,η[0,1] with θ+η=1 such that

    G(rn+2,rn+3,rn+4)C[G(rn,rn+1,rn+2)θG(rn+1,rn+2,rn+3)η]nN.

    Then {rn} is a G-Cauchy sequence in (Φ,G).

    Proof. Notice that

    G(rn+2,rn+3,rn+4)C[G(rn,rn+1,rn+2)θG(rn+1,rn+2,rn+3)η]C[max{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)}θmax{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)}η]=Cmax{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)}θ+η=Cmax{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)}.

    Then the result follows from Lemma 2.11.

    Karapınar et al. [7] gave the following definition of hybrid-interpolative Reich-Istr˘aţescu-type contraction in metric space.

    Definition 2.12. [7] Let (Φ,d) be a metric space and let α:Φ×ΦR+ be a function. A self-mapping Γ:ΦΦ is called hybrid-interpolative Reich-Istr˘aţescu-type contraction if for some qR+, there exist constants μ(0,1), δ0 and λi0 with i=1,2,...,5 such that for all distinct r,sΦFix(Γ),

    α(r,s)d(Γ2r,Γ2s)μM(r,s), (2.11)

    where

    M(r,s)={[λ1d(r,s)q+λ2d(r,Γr)q+λ3d(s,Γs)q+λ4d(Γr,Γs)q+λ5d(Γr,Γ2r)q+δd(Γs,Γ2s)q]1q,forq>0,with5i=1λi+δ1;[d(r,s)]λ1[d(r,Γr)]λ2[d(s,Γs)]λ3[d(Γr,Γs)]λ4[d(Γr,Γ2r)]λ5[d(Γs,Γ2s)]δ,forq=0,with5i=1λi+δ=1, (2.12)

    and Fix(Γ)={rΦ:Γr=r}.

    In this section, we introduce a new concept of hybrid-interpolative Reich-Istr˘aţescu-type (G-α-μ)-contraction in G-metric space.

    Definition 3.1. Let (Φ,G) be a G-metric space and let α:Φ×ΦR+ be a function. A self-mapping Γ:ΦΦ is called hybrid-interpolative Reich-Istr˘aţescu-type (G-α-μ)-contraction if for some qR+, there exist constants μ(0,1), δ0 and λi0 with i=1,2,...,5 such that for all r,sΦFix(Γ),

    α(r,s,Γs)G(Γ2r,Γ2s,Γ3s)μM(r,s,Γs), (3.1)

    where

    M(r,s,Γs)={[λ1G(r,s,Γs)q+λ2G(r,Γr,Γ2r)q+λ3G(s,Γs,Γ2s)q+λ4G(Γr,Γs,Γ2s)q+λ5G(Γr,Γ2r,Γ3r)q+δG(Γs,Γ2s,Γ3s)q]1q,forq>0,with5i=1λi+δ1;[G(r,s,Γs)]λ1[G(r,Γr,Γ2r)]λ2[G(s,Γs,Γ2s)]λ3[G(Γr,Γs,Γ2s)]λ4[G(Γr,Γ2r,Γ3r)]λ5[G(Γs,Γ2s,Γ3s)]δ,forq=0,with5i=1λi+δ=1, (3.2)

    and Fix(Γ)={rΦ:Γr=r}.

    Our main result is the following.

    Theorem 3.2. Let (Φ,G) be a complete G-metric space and let Γ:ΦΦ be a hybrid-interpolative Reich-Istr˘aţescu-type (G-α-μ)-contraction satisfying the following conditions:

    (i) Γ is (G-α)-orbital admissible;

    (ii) Γ is continuous;

    (iii) there exists r0Φ such that α(r0,Γr0,Γ2r0)1.

    Then Γ has at least a fixed point in Φ.

    Proof. Let r0Φ be such that α(r0,Γr0,Γ2r0)1. Since Γ is (G-α)-orbital admissible, then α(Γr0,Γ2r0,Γ3r0)1 and by induction, we have α(Γnr0,Γn+1r0,Γn+2r0)1 for any nN. Let {rn} be a sequence in Φ defined by rn=Γnr0 for all nN. If there exists some mN such that Γrm=rm+1=rm, then clearly, rm is a fixed point of Γ. Assume now that rnrn+1 for any nN. Since Γ is hybrid-interpolative Reich-Istr˘aţescu-type (G-α-μ)-contraction, then we have from (3.1) that

    G(rn+2,rn+3,rn+4)α(rn,rn+1,Γrn+1)G(Γ2rn,Γ2rn+1,Γ3rn+1)μM(rn,rn+1,Γrn+1). (3.3)

    We now consider the following cases:

    Case 1: For q>0, we have

    M(rn,rn+1,Γrn+1)=[λ1G(rn,rn+1,Γrn+1)q+λ2G(rn,Γrn,Γ2rn)q+λ3G(rn+1,Γrn+1,Γ2rn+1)q+λ4G(Γrn,Γrn+1,Γ2rn+1)q+λ5G(Γrn,Γ2rn,Γ3rn)q+δG(Γrn+1,Γ2rn+1,Γ3rn+1)q]1q=[λ1G(rn,rn+1,rn+2)q+λ2G(rn,rn+1,rn+2)q+λ3G(rn+1,rn+2,rn+3)q+λ4G(rn+1,rn+2,rn+3)q+λ5G(rn+1,rn+2,rn+3)q+δG(rn+2,rn+3,rn+4)q]1q=[(λ1+λ2)G(rn,rn+1,rn+2)q+(λ3+λ4+λ5)G(rn+1,rn+2,rn+3)q+δG(rn+2,rn+3,rn+4)q]1q[(λ1+λ2+λ3+λ4+λ5)max{G(rn,rn+1,rn+2)q,G(rn+1,rn+2,rn+3)q}+δG(rn+2,rn+3,rn+4)q]1q. (3.4)

    Therefore, (3.3) becomes

    G(rn+2,rn+3,rn+4)qμq[(λ1+λ2+λ3+λ4+λ5)max{G(rn,rn+1,rn+2)q,G(rn+1,rn+2,rn+3)q}+δG(rn+2,rn+3,rn+4)q]

    so that

    (1μqδ)G(rn+2,rn+3,rn+4)qμq(λ1+λ2+λ3+λ4+λ5)max{G(rn,rn+1,rn+2)q,G(rn+1,rn+2,rn+3)q}μq(1δ)max{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)}q,

    implying that for all nN,

    G(rn+2,rn+3,rn+4)q(μq(1δ)1μqδ)max{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)}q,

    which is equivalent to

    G(rn+2,rn+3,rn+4)Cmax{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)},

    where

    C=(μq(1δ)1μqδ)(0,1).

    Hence, by Lemma 2.11, {rn}nN is a G-Cauchy sequence in (Φ,G).

    Case 2: For q=0, we have

    M(rn,rn+1,Γrn+1)=G(rn,rn+1,Γrn+1)λ1G(rn,Γrn,Γ2rn)λ2G(rn+1,Γrn+1,Γ2rn+1)λ3G(Γrn,Γrn+1,Γ2rn+1)λ4G(Γrn,Γ2rn,Γ3rn)λ5G(Γrn+1,Γ2rn+1,Γ3rn+1)δ=G(rn,rn+1,rn+2)λ1G(rn,rn+1,rn+2)λ2G(rn+1,rn+2,rn+3)λ3G(rn+1,rn+2,rn+3)λ4G(rn+1,rn+2,rn+3)λ5G(rn+2,rn+3,rn+4)δ=G(rn,rn+1,rn+2)(λ1+λ2)G(rn+1,rn+2,rn+3)(λ3+λ4+λ5)G(rn+2,rn+3,rn+4)δ.

    Therefore, (3.3) becomes

    G(rn+2,rn+3,rn+4)μG(rn,rn+1,rn+2)(λ1+λ2)G(rn+1,rn+2,rn+3)(λ3+λ4+λ5)G(rn+2,rn+3,rn+4)δ. (3.5)

    If δ=1, then λ1=λ2=λ3=λ4=λ5=0, and so we obtain

    0<G(rn+2,rn+3,rn+4)μG(rn+2,rn+3,rn+4),

    which is a contradiction. Therefore, δ<1, so that 5i=1λi=1δ>0, implying that

    θ=λ1+λ21δ,η=λ3+λ4+λ51δ

    satisfying θ+η=1. Hence, (3.5) becomes

    G(rn+2,rn+3,rn+4)(1δ)μG(rn,rn+1,rn+2)(λ1+λ2)G(rn+1,rn+2,rn+3)(λ3+λ4+λ5)

    so that

    G(rn+2,rn+3,rn+4)μ(11δ)G(rn,rn+1,rn+2)(λ1+λ21δ)G(rn+1,rn+2,rn+3)(λ3+λ4+λ51δ)=μ(11δ)G(rn,rn+1,rn+2)θG(rn+1,rn+2,rn+3)η

    for all n in N. Noting that μ(0,1), we have

    0<1δ1111δμ(11δ)μ<1.

    Hence, since 0<μ(11δ)<1 and θ+η=1, then by Corollary 1, we can conclude that {rn}nN is G-Cauchy in (Φ,G).

    Therefore, for all q0, we have established that {rn}nN is a G-Cauchy sequence in (Φ,G) and so by the completeness of (Φ,G), there exists a point c in Φ such that limnrn=c. Moreover, since Γ is continuous, then we can conclude that Γc=c, that is, c is a fixed point of Γ.

    Theorem 3.3. Let (Φ,G) be a complete G-metric space and let Γ:ΦΦ be a hybrid-interpolative Reich-Istr˘aţescu-type (G-α-μ)-contraction satisfying the following conditions:

    (i) Γ is (G-α)-orbital admissible;

    (ii) there exists r0Φ such that α(r0,Γr0,Γ2r0)1;

    (iii) Γ3 is continuous and α(r,Γr,Γ2r)1 for any rFix(Γ3).

    Then Γ has at least a fixed point in Φ.

    Proof. Let r0Φ be arbitrary and define a sequence {rn}nN in Φ by rn=Γnr0. We have shown in Theorem 3.2 that there exists cΦ such that rnc. Since Γ3 is continuous, then

    Γ3c=limnΓ3rn=c, (3.6)

    that is, c is a fixed point of Γ3. This implies that Γ3 has at least one fixed point in Φ, that is, Fix(Γ3) is nonempty. Moreover,

    Γ4c=Γc. (3.7)

    To see that c is a fixed point of Γ, assume contrary that Γcc. In this case, Γc is not a fixed point of Γ3 either, since Γc=Γ3c=c, which is a contradiction. Also, by (3.1), we have

    G(c,Γc,Γ2c)α(c,Γc,Γ2c)G(c,Γc,Γ2c)=α(c,Γc,Γ2c)G(Γ3c,Γ4c,Γ2c)=α(c,Γc,Γ2c)G(Γ3c,Γc,Γ2c)=α(c,Γc,Γ2c)G(Γc,Γ2c,Γ3c)μM(c,Γc,Γ2c). (3.8)

    Considering Case 1, we obtain

    M(c,Γc,Γ2c)=[λ1G(c,Γc,Γ2c)q+λ2G(c,Γc,Γ2c)q+λ3G(Γc,Γ2c,Γ3c)q+λ4G(Γc,Γ2c,Γ3c)q+λ5G(Γc,Γ2c,Γ3c)q+δG(Γ2c,Γ3c,Γ4c)q]1q=[λ1G(c,Γc,Γ2c)q+λ2G(c,Γc,Γ2c)q+λ3G(c,Γc,Γ2c)q+λ4G(c,Γc,Γ2c)q+λ5G(c,Γc,Γ2c)q+δG(c,Γc,Γ2c)q]1q=[(λ1+λ2+λ3+λ4+λ5+δ)G(c,Γc,Γ2c)q]1q=(λ1+λ2+λ3+λ4+λ5+δ)1qG(c,Γc,Γ2c)G(c,Γc,Γ2c)

    implying that

    0<G(c,Γc,Γ2c)μG(c,Γc,Γ2c),

    which is a contradiction. Hence, Γc=c.

    Similarly, for Case 2, we obtain

    M(c,Γc,Γ2c)=G(c,Γc,Γ2c)λ1G(c,Γc,Γ2c)λ2G(Γc,Γ2c,Γ3c)λ3G(Γc,Γ2c,Γ3c)λ4G(Γc,Γ2c,Γ3c)λ5G(Γ2c,Γ3c,Γ4c)δ=G(c,Γc,Γ2c)λ1G(c,Γc,Γ2c)λ2G(c,Γc,Γ2c)λ3G(c,Γc,Γ2c)λ4G(c,Γc,Γ2c)λ5G(c,Γc,Γ2c)δ=G(c,Γc,Γ2c)(λ1+λ2+λ3+λ4+λ5+δ)=G(c,Γc,Γ2c),

    so that (3.8) becomes

    0<G(c,Γc,Γ2c)μG(c,Γc,Γ2c),

    which is also a contradiction. Hence, Γc=c.

    Therefore, c is a fixed point of Γ in Φ.

    Theorem 3.4. If in addition to the hypotheses of Theorem 3.3, we assume supplementary that α(r,s,Γs)1 for any r,sFix(Γ), then the fixed point of Γ is unique.

    Proof. Let v,cΦ be any two fixed point of Γ with vc. By replacing this in (3.1) and noting the additional hypothesis, we have:

    G(c,v,Γv)α(c,v,Γv)G(Γ2c,Γ2v,Γ3v)μM(c,v,Γv). (3.9)

    By Case 1, we obtain

    M(c,v,Γv)=[λ1G(c,v,Γv)q+λ2G(c,Γc,Γ2c)q+λ3G(v,Γv,Γ2v)q+λ4G(Γc,Γv,Γ2v)q+λ5G(Γc,Γ2c,Γ3c)q+δG(Γv,Γ2v,Γ3v)q]1q=[λ1G(c,v,Γv)q+λ2G(c,c,c)q+λ3G(v,v,v)q+λ4G(c,v,Γv)q+λ5G(c,c,c)q+δG(v,v,v)q]1q=[(λ1+λ4)G(c,v,Γv)q]1q=(λ1+λ4)1qG(c,v,Γv)G(c,v,Γv).

    Hence, (3.9) becomes

    0<G(c,v,Γv)μG(c,v,Γv),

    which is a contradiction. Therefore, v=c, and so the fixed point of Γ is unique. In the following result, we examine the existence of fixed point of Γ when the G-metric space (Φ,G) is regular.

    Theorem 3.5. Let (Φ,G) be a complete G-metric space and let Γ:ΦΦ be a hybrid-interpolative Reich-Istr˘aţescu-type (G-α-μ)-contraction for q=0 such that λ2>0 and λ5>0. Suppose further that:

    (i) Γ is (G-α)-orbital admissible;

    (ii) there exists r0Φ such that α(r0,Γr0,Γ2r0)1;

    (iii) (Φ,G) is regular with respect to α.

    Then Γ has a fixed point.

    Proof. In Theorem 3.2, we have established that for any q0, the sequence {rn}nN is G-Cauchy and by the completeness of the G-metric space (Φ,G), there exists a point c in Φ such that rnc. To prove that c is a fixed point of Γ, suppose contrary that Γcc.

    Assume {rn}nN is such that rnrm whenever nm, for all n,mN. Then there exists n0N such that rn and c are distinct and not in Fix(Γ) for all nn0. We will verify that c is a fixed point of Γ3. Indeed, for all nn0,

    G(rn+2,Γ2c,Γ3c)α(rn,c,Γc)G(Γ2rn,Γ2c,Γ3c)μM(rn,c,Γc)=μG(rn,c,Γc)λ1G(rn,Γrn,Γ2rn)λ2G(c,Γc,Γ2c)λ3G(Γrn,Γc,Γ2c)λ4G(Γrn,Γ2rn,Γ3rn)λ5G(Γc,Γ2c,Γ3c)δ=μG(rn,c,Γc)λ1G(rn,rn+1,rn+2)λ2G(c,Γc,Γ2c)λ3G(rn+1,Γc,Γ2c)λ4G(rn+1,rn+2,rn+3)λ5G(Γc,Γ2c,Γ3c)δ.

    Since λ2>0 and λ5>0, then letting n and noting Proposition 1, it is verified that c is a fixed point of Γ3. Hence, by (3.6) and (3.7), we obtain a contradiction. Therefore Γc=c, implying that c is a fixed point of Γ.

    Example 3.6. Let Φ=[1,1] and let Γ:ΦΦ be a self-mapping on Φ defined by Γr=r2 for all rΦ. Define G:Φ×Φ×ΦR+ by

    G(r,s,t)=|rs|+|rt|+|st| r,s,tΦ.

    Then (Φ,G) is a complete G-metric space. Define α:Φ×Φ×ΦR+ by

    α(r,s,t)={1,ifr,s,t{1}[0,1];0,otherwise. (3.10)

    Then obviously, Γ is a (G-α)-orbital admissible and Γ is continuous for all rΦ. Also, there exists r0=13Φ such that α(13,Γ(13),Γ2(13))=α(13,16,112)1. Hence, conditions (i)-(iii) of Theorems 3.2 and 3.3 are satisfied.

    To see that Γ is a hybrid-interpolative Reich-Istr˘aţescu-type (G-α-μ)-contraction, let μ=12. Notice that α(r,s,Γs)=0 for all r,s(1,0). Hence, inequality (3.1) holds for all r,s(1,0).

    Now for r,s{1,1}, if r=s, then letting λ1=15, λ2=λ3=λ4=0, λ5=δ=25 and q=2, we obtain

    α(r,s,Γs)G(Γ2r,Γ2s,Γ3s)=α(1,1,12)G(14,14,18)=α(1,1,12)G(14,14,18)=14<25=12(45)=12(M(1,1,12))=12(M(1,1,12))=μM(r,s,Γs).

    Also, if q=0, we have

    α(r,s,Γs)G(Γ2r,Γ2s,Γ3s)=14<12(45)=μM(r,s,Γs).

    If rs, then letting λ1=35, λ2=λ3=λ5=0, λ4=δ=15 and q=2, we obtain

    α(r,s,Γs)G(Γ2r,Γ2s,Γ3s)=α(1,1,12)G(14,14,18)=α(1,1,12)G(14,14,18)=1<85=12(165)=12(M(1,1,12))=12(M(1,1,12))=μM(r,s,Γs).

    Also, for q=0, we take λ1=35, λ2=λ5=δ=0, λ3=λ4=15. Then

    α(r,s,Γs)G(Γ2r,Γ2s,Γ3s)=α(1,1,12)G(14,14,18)=α(1,1,12)G(14,14,18)=1<75=12(145)=12(M(1,1,12))=12(M(1,1,12))=μM(r,s,Γs).

    Finally, for all r,s(0,1), we take λ1=1, λ2=λ3=λ4=λ5=δ=0. Then

    α(r,s,Γs)G(Γ2r,Γ2s,Γ3s)=G(Γ2r,Γ2s,Γ3s)=|r4s4|+|r4s8|+|s4s8|=14(|rs|+|rs2|+|ss2|)=14G(r,s,Γs)<12G(r,s,Γs)=μM(r,s,Γs)

    for all q0.

    Hence, inequality (3.1) is satisfied for all r,sΦFix(Γ). Therefore, Γ is a hybrid-interpolative Reich-Istr˘aţescu-type (G-α-μ)-contraction which satisfies all the assumptions of Theorems 3.2 and 3.3. The point r=0 is the fixed point of Γ in Φ.

    We now demonstrate that our result is independent and an improvement of the results of Karapınar et al. [7]. Let α:Φ×ΦR+ be as given by Definition (2.12), r0Φ be such that α(r0,Γr0)1 and d:Φ×ΦR+ be defined by

    d(r,s)=|rs| r,sΦ.

    Consider r,s{1,1} and take for Case 1, rs, λ1=15, λ2=λ3=λ5=0, λ4=12, δ=310 and q=1. Then inequality (3.1) becomes

    α(r,s,Γs)G(Γ2r,Γ2s,Γ3s)=α(1,1,12)G(14,14,18)=α(1,1,12)G(14,14,18)=1101100=12(202100)=12(M(1,1,12))=12(M(1,1,12))=μM(r,s,Γs),

    while inequality (2.11) due to Karapınar et al. [7] yields

    α(r,s)d(Γ2r,Γ2s)=α(1,1)d(14,14)=α(1,1)d(14,14)=12>49100=12(98100)=12(M(1,1))=12(M(1,1))=μM(r,s).

    For Case 2, Karapınar et al. [7] have noted that their result is indeterminate for r=s, if either λ1=0 or λ4=0, since

    [d(r,s)]λ1=[d(Γr,Γs)]λ4=00.

    Hence, they declared that r and s are distinct and that 00=1, which in contrast, is unconventional. But our result is valid for all r,sΦFix(Γ). Therefore, hybrid-interpolative Reich-Istr˘aţescu-type (G-α-μ)-contraction is not hybrid-interpolative Reich-Istr˘aţescu-type contraction defined by Karapınar et al. [7], and so Theorems 12 and 17 due to Karapınar et al. [7] are not applicable to this example.

    The following is an Istr˘aţescu-type (see [7]) consequence of our result.

    Corollary 2. Let (Φ,G) be a complete G-metric space and Γ:ΦΦ be a continuous self-mapping such that there exist η,λ(0,1) with η+λ<1, satisfying

    G(Γ2r,Γ2s,Γ3s)ηG(r,s,Γs)+λG(Γr,Γs,Γ2s)

    for all r,sΦ. Then Γ has a fixed point in Φ.

    Proof. Let μ=η+λ(0,1). Consider Definition (3.1) and let α(r,s,Γs)=1, q=1, λ1=ημ, λ4=λμ and λ2=λ3=λ5=δ=0. Then for all r,sΦ, we have

    G(Γ2r,Γ2s,Γ3s)μM(r,s,Γs)=μ[ημG(r,s,Γs)+λμG(Γr,Γs,Γ2s)]=ηG(r,s,Γs)+λG(Γr,Γs,Γ2s), (3.11)

    implying that inequality (3.1) holds for all r,sΦFix(Γ).

    Let r0Φ be arbitrary and define a sequence {rn}nN in Φ by rn=Γnr0. Then by (3.11), we have

    G(rn+2,rn+3,rn+4)ηG(rn,rn+1,rn+2)+λG(rn+1,rn+2,rn+3)ηmax{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)}+λmax{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)}=(η+λ)max{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)}=μmax{G(rn,rn+1,rn+2),G(rn+1,rn+2,rn+3)}.

    Hence, by Lemma 2.11, {rn}nN is a G-Cauchy sequence in (Φ,G) and since (Φ,G) is complete, then there exists cΦ such that rnc. Since Γ is continuous, then we can conclude that c is a fixed point of Γ, that is, Γc=c.

    In Definition (3.1), if we specialize the parameters λi (i=1,2,...,5), δ and q, as well as let α(r,s,Γs)=1 for all r,sΦ and Γs=t, we obtain the following corollary, which is a consequence of Theorem 3.2.

    Corollary 3. Let (Φ,G) be a complete G-metric space and Γ:ΦΦ be a continuous self-mapping such that there exists μ(0,1), satisfying

    G(Γ2r,Γ2s,Γ2t)μG(r,s,t) (3.12)

    for all r,s,tΦ. Then Γ has a fixed point in Φ.

    In this section, an existence theorem for a solution of a class of integral equations is provided using Corollary 3. For similar results, we refer to [1,4,10,17].

    Consider the integral equation

    r(y)=baL(y,x)f(x,r(x))dx,y[a,b]. (4.1)

    Let Φ=C([a,b],R) be the set of all continuous real-valued functions. Define G:Φ×Φ×ΦR+ by

    G(r,s,t)=maxy[a,b]|r(y)s(y)|+maxy[a,b]|r(y)t(y)|+maxy[a,b]|s(y)t(y)|r,s,tΦ,y[a,b]. (4.2)

    Then, (Φ,G) is a complete G-metric space.

    Define a function Γ:ΦΦ as follows:

    Γr(y)=baL(y,x)f(x,r(x))dx,y[a,b]. (4.3)

    Then a point u is said to be a fixed point of Γ if and only if u is a solution to (4.1).

    Now, we study existence conditions of the integral equation (4.1) under the following hypotheses.

    Theorem 4.1. Assume that the following conditions are satisfied:

    (C1) L:[a,b]×[a,b]R+ and f:[a,b]×RR are continuous;

    (C2) for all r,sΦ, x[a,b], we have |f(x,r(x))f(x,s(x))||r(x)s(x)|;

    (C3) maxy[a,b]baL(y,x)dxλ for some λ<1.

    Then, the integral equation (4.1) has a solution u in Φ.

    Proof. Observe that for any r,sΦ, using (4.3) and the above hypotheses, we obtain

    |Γr(y)Γs(y)|=|ba[L(y,x)f(x,r(x))L(y,x)f(x,s(x))]dx|baL(y,x)|f(x,r(x))f(x,s(x))|dxbaL(y,x)|r(x)s(x)|dxbaL(y,x)maxx[a,b]|r(x)y(x)|dxλmaxy[a,b]|r(y)s(y)|,

    so that

    |Γ2r(y)Γ2s(y)|λmaxy[a,b]|Γr(y)Γs(y)|λmaxy[a,b][λmaxy[a,b]|r(y)s(y)|]λ2maxy[a,b]|r(y)s(y)|.

    Using this in (4.2), we have

    G(Γ2r,Γ2s,Γ2t)=maxy[a,b]|Γ2rΓ2s|+maxy[a,b]|Γ2rΓ2t|+maxy[a,b]|Γ2sΓ2t|λ2maxy[a,b]|rs|+λ2maxy[a,b]|rt|+λ2maxy[a,b]|st|=λ2(maxy[a,b]|rs|+maxy[a,b]|rt|+maxy[a,b]|st|)=μG(r,s,t),

    where μ=λ2<1.

    Hence, all the hypotheses of Corollary 3 are verified, implying that there exists a solution u in Φ of the integral equation (4.1).

    Conversely, if u is a solution of (4.1), then u is also a solution of (4.3), so that Γu=u, that is, u is a fixed point of Γ.

    Remark 1.

    (i) We can deduce many other corollaries by particularizing some of the parameters in Definition (3.1).

    (ii) None of the results presented in this work is expressible in the form G(s,r,r) or G(s,s,r). Hence, they cannot be obtained from their corresponding versions in metric spaces.

    A generalization of metric space was introduced by Mustafa and Sims [9], namely G-metric space and several fixed point results were studied in that space. However, Jleli and Samet [5] as well as Samet et al. [16] established that most fixed point theorems obtained in G-metric space are direct consequences of their analogues in metric space. Contrary to the above observation, a new family of contraction, called hybrid-interpolative Reich-Istr˘aţescu-type (G-α-μ)-contraction is introduced in this manuscript and some fixed point theorems that cannot be deduced from their corresponding ones in metric space are proved. The main distinction of this class of contraction is that its contractive inequality is expressible in a number of ways with respect to multiple parameters. Consequently, a few corollaries, including some recently announced results in the literature are highlighted and analyzed. Nontrivial comparative examples are constructed to validate the assumptions of our obtained theorems. Furthermore, one of our obtained corollaries is applied to set up novel existence conditions for solution of a class of integral equations.

    The authors declare that they have no competing interests.



    [1] S. Brin, L. Page, The anatomy of a large-scale hypertextual web search engine, Comput. Netw. ISDN Syst., 30 (1998), 107–117. https://doi.org/10.1016/S0169-7552(98)00110-X doi: 10.1016/S0169-7552(98)00110-X
    [2] T. Zhou, E. Martinez-Baez, G. Schenter, A. E. Clark, PageRank as a collective variable to study complex chemical transformations and their energy landscapes, J. Chem. Phys., 150 (2019), 134102. https://doi.org/10.1063/1.5082648 doi: 10.1063/1.5082648
    [3] B. Liu, S. Jiang, Q. Zou, Hits-pr-hhblits: Protein remote homology detection by combining pagerank and hyperlink-induced topic search, Brief. Bioinformatics, 21 (2020), 298–308. https://doi.org/10.1093/bib/bby104 doi: 10.1093/bib/bby104
    [4] M. Rafiei, A. A. Kardan, A novel method for expert finding in online communities based on concept map and pagerank, Hum. Cent. Comput. Inf. Sci., 5 (2015), 10. https://doi.org/10.1186/s13673-015-0030-5 doi: 10.1186/s13673-015-0030-5
    [5] F. A. Massucci, D. Docampo, Measuring the academic reputation through citation networks via pagerank, J. Informetr., 13 (2019), 185–201. https://doi.org/10.1016/j.joi.2018.12.001 doi: 10.1016/j.joi.2018.12.001
    [6] M. Zhang, X. Li, L. Zhang, S. Khurshid, Boosting spectrum-based fault localization using Pagerank, In: Proceedings of the 26th ACM SIGSOFT international symposium on software testing and analysis, 2017,261–272. https://doi.org/10.1145/3092703.3092731
    [7] A. Bojchevski, J. Gasteiger, B. Perozzi, A. Kapoor, M. Blais, B. Rózemberczki, et al., Scaling graph neural networks with approximate pagerank, In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, 2020, 2464–2473. https://doi.org/10.1145/3394486.3403296
    [8] E. Chien, J. Peng, P. Li, O. Milenkovic, Adaptive universal generalized pagerank graph neural network, arXiv preprint, 2020. https://doi.org/10.48550/arXiv.2006.07988
    [9] A. Roth, T. Liebig, Transforming pagerank into an infinite-depth graph neural network, In: Joint European conference on machine learning and knowledge discovery in databases, 2022,469–484. https://doi.org/10.1007/978-3-031-26390-3_27
    [10] D. F. Gleich, PageRank beyond the web, SIAM Rev., 57 (2015), 321–363. https://doi.org/10.1137/140976649
    [11] R. A. Horn, S. Serra-Capizzano, A general setting for the parametric Google matrix, Internet Math., 3 (2008), 385–411. https://doi.org/10.1080/15427951.2006.10129131 doi: 10.1080/15427951.2006.10129131
    [12] S. Serra-Capizzano, Jordan canonical form of the Google matrix: A potential contribution to the PageRank computation, SIAM J. Matrix Anal. Appl., 27 (2005), 305–312. https://doi.org/10.1137/S0895479804441407 doi: 10.1137/S0895479804441407
    [13] A. Langville, C. Meyer, Google's PageRank and beyond: The science of search engine rankings, Princeton: Princeton University Press, 2006. https://doi.org/10.1515/9781400830329
    [14] P. G. Constantine, D. F. Gleich, Random alpha PageRank, Internet Math., 6 (2009), 189–236. https://doi.org/10.1080/15427951.2009.10129185
    [15] S. D. Kamvar, T. H. Haveliwala, C. D. Manning, G. H. Golub, Extrapolation methods for accelerating PageRank computation, In: Proceedings of the 12th international conference on World Wide Web, (2003), 261–270. https://doi.org/10.1145/775152.775190
    [16] X. Tan, A new extrapolation method for PageRank computations, J. Comput. Appl. Math., 313 (2017), 383–392. https://doi.org/10.1016/j.cam.2016.08.034 doi: 10.1016/j.cam.2016.08.034
    [17] C. Brezinski, M. Redivo-Zaglia, S. Serra-Capizzano, Extrapolation methods for PageRank computations, CR Math., 340 (2005), 393–397. https://doi.org/10.1016/j.crma.2005.01.015 doi: 10.1016/j.crma.2005.01.015
    [18] A. Cicone, S. Serra-Capizzano, Google PageRanking problem: The model and the analysis, J. Comput. Appl. Math., 234 (2010), 3140–3169. https://doi.org/10.1016/j.cam.2010.02.005 doi: 10.1016/j.cam.2010.02.005
    [19] S. D. Kamvar, T. H. Haveliwala, G. H. Golub, Adaptive methods for the computation of the PageRank, Linear Algebra Appl., 386 (2004), 51–65. https://doi.org/10.1016/j.laa.2003.12.008 doi: 10.1016/j.laa.2003.12.008
    [20] H. D. Sterck, T. A. Manteuffel, S. F. McCormick, Q. Nguyen, J. Ruge, Multilevel adaptive aggregation for Markov chains, with application to web ranking, SIAM J. Sci. Comput., 30 (2008), 2235–2262. https://doi.org/10.1137/070685142 doi: 10.1137/070685142
    [21] Z. L. Shen, T. Z. Huang, B. Carpentieri, C. Wen, X. M. Gu, Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems, Commun. Nonlinear Sci. Numer. Simul., 59 (2018), 472–487. https://doi.org/10.1016/j.cnsns.2017.11.031 doi: 10.1016/j.cnsns.2017.11.031
    [22] D. F. Gleich, A. P. Gray, C. Greif, T. Lau, An inner-outer iteration for computing PageRank, SIAM J. Sci. Comput., 32 (2010), 349–371. https://doi.org/10.1137/080727397 doi: 10.1137/080727397
    [23] C. Q. Gu, F. Xie, K. Zhang, A two-step matrix splitting iteration for computing PageRank, J. Comput. Appl. Math., 278 (2015), 19–28. https://doi.org/10.1016/j.cam.2014.09.022 doi: 10.1016/j.cam.2014.09.022
    [24] C. Wen, T. Z. Huang, Z. L. Shen, A note on the two-step matrix splitting iteration for computing PageRank, J. Comput. Appl. Math., 315 (2017), 87–97. https://doi.org/10.1016/j.cam.2016.10.020 doi: 10.1016/j.cam.2016.10.020
    [25] Z. L. Tian, Y. Liu, Y. Zhang, Z. Y. Liu, M. Y. Tian, The general inner-outer iteration method based on regular splittings for the PageRank problem, Appl. Math. Comput., 356 (2019), 479–501. https://doi.org/10.1016/j.amc.2019.02.066 doi: 10.1016/j.amc.2019.02.066
    [26] M. Y. Tian, Y. Zhang, Y. D. Wang, A general multi-splitting iteration method for computing PageRank, Comput. Appl. Math., 38 (2019), 1–29. https://doi.org/10.1007/s40314-019-0830-8 doi: 10.1007/s40314-019-0830-8
    [27] G. H. Golub, C. Greif, An Arnoldi-type algorithm for computing pagerank, BIT Numer. Math., 46 (2006), 759–771. https://doi.org/10.1007/s10543-006-0091-y doi: 10.1007/s10543-006-0091-y
    [28] J. F. Yin, G. J. Yin, M. Ng, On adaptively accelerated Arnoldi method for computing PageRank, Numer. Linear Algebra Appl., 19 (2012), 73–85. https://doi.org/10.1002/nla.789 doi: 10.1002/nla.789
    [29] Z. L. Shen, H. Yang, B. Carpentieri, X. M. Gu, C. Wen, A preconditioned variant of the refined arnoldi method for computing PageRank eigenvectors, Symmetry, 13 (2021), 1327. https://doi.org/10.3390/sym13081327 doi: 10.3390/sym13081327
    [30] H. F. Zhang, T. Z. Huang, C. Wen, Z. L. Shen, FOM accelerated by an extrapolation method for solving PageRank problems, J. Comput. Appl. Math., 296 (2016), 397–409. https://doi.org/10.1016/j.cam.2015.09.027 doi: 10.1016/j.cam.2015.09.027
    [31] G. Wu, Y. Wei, A power-Arnoldi algorithm for computing pagerank, Numer. Linear Algebra Appl., 14 (2007), 521–546. https://doi.org/10.1002/nla.531 doi: 10.1002/nla.531
    [32] C. Q. Gu, X. L. Jiang, C. C. Shao, Z. B. Chen, A GMRES-Power algorithm for computing PageRank problems, J. Comput. Appl. Math., 343 (2018), 113–123. https://doi.org/10.1016/j.cam.2018.03.017 doi: 10.1016/j.cam.2018.03.017
    [33] Q. Y. Hu, C. Wen, T. Z. Huang, Z. L. Shen, X. M. Gu, A variant of the Power-Arnoldi algorithm for computing PageRank, J. Comput. Appl. Math., 381 (2021), 113034. https://doi.org/10.1016/j.cam.2020.113034 doi: 10.1016/j.cam.2020.113034
    [34] C. Q. Gu, W. W. Wang, An Arnoldi-Inout algorithm for computing PageRank problems, J. Comput. Appl. Math., 309 (2017), 219–229. https://doi.org/10.1016/j.cam.2016.05.026 doi: 10.1016/j.cam.2016.05.026
    [35] D. F. Gleich, L. Zhukov, P. Berkhin, Fast parallel pagerank: A linear system approach, 2005.
    [36] Y. Lin, X. Shi, Y. Wei, On computing PageRank via lumping the Google matrix, J. Comput. Appl. Math., 224 (2009), 702–708. https://doi.org/10.1016/j.cam.2008.06.003 doi: 10.1016/j.cam.2008.06.003
    [37] Q. Yu, Z. Miao, G. Wu, Y. Wei, Lumping algorithms for computing Google's PageRank and its derivative, with attention to unreferenced nodes, Inf. Retr., 15 (2012), 503–526. https://doi.org/10.1007/s10791-012-9183-2 doi: 10.1007/s10791-012-9183-2
    [38] A. N. Langville, C. D. Meyer, A reordering for the PageRank problem, SIAM J. Sci. Comput., 27 (2006), 2112–2120. https://doi.org/10.1137/040607551 doi: 10.1137/040607551
    [39] Z. L. Shen, T. Z. Huang, B. Carpentieri, X. M. Gu, C. Wen, An efficient elimination strategy for solving PageRank problems, Appl. Math. Comput., 298 (2017), 111–122. https://doi.org/10.1016/j.amc.2016.10.031 doi: 10.1016/j.amc.2016.10.031
    [40] Z. L. Shen, T. Z. Huang, B. Carpentieri, C. Wen, X. M. Gu, X. Y. Tan, Off-diagonal low-rank preconditioner for difficult PageRank problems, J. Comput. Appl. Math., 346 (2019), 456–470. https://doi.org/10.1016/j.cam.2018.07.015 doi: 10.1016/j.cam.2018.07.015
    [41] Z. L. Shen, B. Carpentieri, Multi-Step Low-Rank Decomposition of Large PageRank Matrices, In: The 7th international conference on fuzzy systems and data mining, 340 (2021), 397–404. https://doi.org/10.3233/FAIA210212
    [42] D. J. Higham, N. J. Higham, MATLAB guide, SIAM press, 2016.
    [43] C. P. Lee, G. H. Golub, S. A. Zenios, Partial state space aggregation based on lumpability and its application to PageRank, Tech. Rep. Stanford Univ., 2003.
    [44] S. D. Kamvar, T. H. Haveliwala, C. D. Manning, G. H. Goloub, Exploiting the block structure of the web for computing PageRank, Tech. Rep. Stanford Univ., 2003.
    [45] A. Scime, Web mining: Applications and techniques, IGI Global Press, 2005. https://doi.org/10.4018/978-1-59140-414-9
    [46] Y. P. Hong, C. T. Pan, A lower bound for the smallest singular value, Linear Algebra Appl., 172 (1992), 27–32. https://doi.org/10.1016/0024-3795(92)90016-4 doi: 10.1016/0024-3795(92)90016-4
    [47] O. Axelsson, M. Neytcheva, A general approach to analyse preconditioners for two-by-two block matrices, Numer. Linear Algebra Appl., 20 (2013), 723–742. https://doi.org/10.1002/nla.830 doi: 10.1002/nla.830
    [48] T. A. Davis, Y. Hu, The University of Florida sparse matrix collection, ACM Trans. Math. Softw., 38 (2011), 1–25.
    [49] P. Boldi, S. Vigna, The webgraph framework I: Compression techniques, In: Proceedings of the 13th international conference on World Wide Web, 2004,595–602. https://doi.org/10.1145/988672.988752
    [50] P. Boldi, M. Rosa, M. Santini, S. Vigna, Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks, In: Proceedings of the 20th international conference on World Wide Web, 2011,587–596. https://doi.org/10.1145/1963405.1963488
    [51] P. Boldi, B. Codenotti, M. Santini, S. Vigna, Ubicrawler: A scalable fully distributed Web crawler, Softw. Pract. Exp., 34 (2004), 711–726. https://doi.org/10.1002/spe.587 doi: 10.1002/spe.587
    [52] Y. Saad, M. H. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Comput., 7 (1986), 856–869. https://doi.org/10.1137/0907058 doi: 10.1137/0907058
    [53] M. Bollhöefer, Y. Saad, O. Schenk, ILUPACK-preconditioning software package, 2010.
  • This article has been cited by:

    1. Chander Bhan, Ravi Karwasra, Sandeep Malik, Sachin Kumar, Ahmed H. Arnous, Nehad Ali Shah, Jae Dong Chung, Bifurcation, chaotic behavior and soliton solutions to the KP-BBM equation through new Kudryashov and generalized Arnous methods, 2024, 9, 2473-6988, 8749, 10.3934/math.2024424
    2. Chong-Dong Cheng, Bo Tian, Tian-Yu Zhou, Yuan Shen, Nonlinear localized waves and their interactions for a (2+1)-dimensional extended Bogoyavlenskii-Kadomtsev-Petviashvili equation in a fluid, 2024, 125, 01652125, 103246, 10.1016/j.wavemoti.2023.103246
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1391) PDF downloads(41) Cited by(0)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog