Review Recurring Topics

The Functions of Sleep

  • Received: 03 May 2015 Accepted: 12 August 2015 Published: 24 August 2015
  • Sleep is a ubiquitous component of animal life including birds and mammals. The exact function of sleep has been one of the mysteries of biology. A considerable number of theories have been put forward to explain the reason(s) for the necessity of sleep. To date, while a great deal is known about what happens when animals sleep, there is no definitive comprehensive explanation as to the reason that sleep is an inevitable part of animal functioning. It is well known that sleep is a homeostatically regulated body process, and that prolonged sleep deprivation is fatal in animals. In this paper, we present some of the theories as to the functions of sleep and provide a review of some hypotheses as to the overall physiologic function of sleep. To better understand the purpose for sleeping, we review the effects of sleep deprivation on physical, neurocognitive and psychic function. A better understanding of the purpose for sleeping will be a great advance in our understanding of the nature of the animal kingdom, including our own.

    Citation: Samson Z Assefa, Montserrat Diaz-Abad, Emerson M Wickwire, Steven M Scharf. The Functions of Sleep[J]. AIMS Neuroscience, 2015, 2(3): 155-171. doi: 10.3934/Neuroscience.2015.3.155

    Related Papers:

    [1] Carey Caginalp . A minimization approach to conservation laws with random initialconditions and non-smooth, non-strictly convex flux. AIMS Mathematics, 2018, 3(1): 148-182. doi: 10.3934/Math.2018.1.148
    [2] Ye-Cong Han, Chuan-Yu Cai, Ti-Ren Huang . Monotonicity, convexity properties and inequalities involving Gaussian hypergeometric functions with applications. AIMS Mathematics, 2022, 7(4): 4974-4991. doi: 10.3934/math.2022277
    [3] C. T. J. Dodson . Information distance estimation between mixtures of multivariate Gaussians. AIMS Mathematics, 2018, 3(4): 439-447. doi: 10.3934/Math.2018.4.439
    [4] Tariq A. Alraqad, Hicham Saber . On the structure of finite groups associated to regular non-centralizer graphs. AIMS Mathematics, 2023, 8(12): 30981-30991. doi: 10.3934/math.20231585
    [5] Stefano Bonaccorsi, Bernard Hanzon, Giulia Lombardi . A generalized Budan-Fourier approach to generalized Gaussian and exponential mixtures. AIMS Mathematics, 2024, 9(10): 26499-26537. doi: 10.3934/math.20241290
    [6] H. M. Barakat, M. H. Dwes . Asymptotic behavior of ordered random variables in mixture of two Gaussian sequences with random index. AIMS Mathematics, 2022, 7(10): 19306-19324. doi: 10.3934/math.20221060
    [7] Yunfeng Tang, Huixin Yin, Miaomiao Han . Star edge coloring of $ K_{2, t} $-free planar graphs. AIMS Mathematics, 2023, 8(6): 13154-13161. doi: 10.3934/math.2023664
    [8] Jahfar T K, Chithra A V . Central vertex join and central edge join of two graphs. AIMS Mathematics, 2020, 5(6): 7214-7233. doi: 10.3934/math.2020461
    [9] Xiaofei Wang, Peihua Jiang, Wenzhen Liu . Accurate inference for the Youden index and its associated cutoff point based on the gamma and inverse Gaussian distributed assumption. AIMS Mathematics, 2024, 9(10): 26702-26720. doi: 10.3934/math.20241299
    [10] Li Xu, Lu Chen, Ti-Ren Huang . Monotonicity, convexity and inequalities involving zero-balanced Gaussian hypergeometric function. AIMS Mathematics, 2022, 7(7): 12471-12482. doi: 10.3934/math.2022692
  • Sleep is a ubiquitous component of animal life including birds and mammals. The exact function of sleep has been one of the mysteries of biology. A considerable number of theories have been put forward to explain the reason(s) for the necessity of sleep. To date, while a great deal is known about what happens when animals sleep, there is no definitive comprehensive explanation as to the reason that sleep is an inevitable part of animal functioning. It is well known that sleep is a homeostatically regulated body process, and that prolonged sleep deprivation is fatal in animals. In this paper, we present some of the theories as to the functions of sleep and provide a review of some hypotheses as to the overall physiologic function of sleep. To better understand the purpose for sleeping, we review the effects of sleep deprivation on physical, neurocognitive and psychic function. A better understanding of the purpose for sleeping will be a great advance in our understanding of the nature of the animal kingdom, including our own.


    For a simple, undirected, connected graph $ H = (V(H) $, $ E(H)) $, let $ \mathit{\boldsymbol{A}} $ represent the adjacency matrix of $ H $, and let $ d_u $ denote the degree of vertex $ u $ in $ H $. Assuming that the eigenvalues of $ \mathit{\boldsymbol{A}} $ are $ \mu_1 > \mu_2 \geq \cdots \geq \mu_n $.

    The centrality of the node study is a significant research direction in network science and graph theory. The centrality of a node describes how important a node is in a network [1,2]. The concept of node centrality comes from Leavitt's analysis of the influence between the behavior of small groups and their mode of communication in 1951[3]. Soon after, many scholars defined and studied the centrality index of nodes from different perspectives, such as degree centrality[4], closeness centrality[5], energy centrality[6], and so on[7]. The research on node centrality has excellent significance for the solution of practical problems such as the robustness of the actual network[8], the propagation efficiency in the control network[9], and the understanding of the structural characteristics of the network[10].

    The matrix functions have become an essential mathematical tool for studying network science[11]. The node centrality index is based on the matrix function with an adjacency matrix, including subgraph centrality[12,13], total communicability centrality[14], Katz centrality[15], and so on[16]. The above definition of centrality gives weight to the adjacency matrix's extreme eigenvalues (the largest and the smallest). Such a weighting scheme is characterized by hiding the primary structural information in other eigenvalues [17]. For example, consider a connected graph $ H $. If the spectral gap $ \mu_1 - \mu_2 $ is significantly large, then the matrix exponential $ \exp (\mathit{\boldsymbol{A}}) $ is primarily influenced by $ \mu_1 $ and its corresponding eigenvector. Consequently, the information the remaining part of the spectrum provides is largely overlooked [18]. An exception to this is the Gaussian function $ \exp (- \mathit{\boldsymbol{A}} ^2) $, which places greater emphasis on the zero eigenvalues (if they exist) and those eigenvalues that are close to it [19]. This matrix function explores the central part of the spectrum, revealing crucial structural information about the graphs and networks studied[17]. The zero eigenvalue and eigenvalues near zero of $ \mathit{\boldsymbol{A}} $ play a critical role in determining molecules' magnetic and stability properties when $ \mathit{\boldsymbol{A}} $ represents the tight-binding Hamiltonian in HMO (Hückel molecular orbital) theory[20,21]. Many chemical reactivities are closely linked to the HOMO-LUMO gap, which corresponds to the smallest positive and the largest negative eigenvalues of $ \mathit{\boldsymbol{A}} $ in frontier molecular orbital theory [22,23,24,25]. For example, the transfer of electrons from the HOMO of one molecule to the LUMO of another molecule is crucial in various organic chemical reactions [26]. Estrada et al. defined Gaussian subgraph centrality by exploring the influence of near-zero eigenvalues (i.e., "middle eigenvalues") on graph structure by the Gaussian function[17,18].

    For a vertex $ u \in V(G) $, the generalized Gaussian subgraph centrality of $ u $ [18] is defined as

    $ GSC(u,β)=exp(βA2)uu,
    $

    where $ \beta > 0 $. Furthermore, the generalized Gaussian Estrada index of a graph[18] is defined as

    $ GEE(H,β)=nu=1exp(βA2)uu=ni=1exp(βμ2i),
    $

    where $ \beta > 0 $. Notice that the $ GSC (u, 1) $ and $ GEE (H, 1) $ are called the Gaussian subgraph centrality and the Gaussian Estrada index, respectively. According to the rules of quantum mechanics, in a network of particles, the generalized Gaussian Estrada index can be interpreted as the partition function of the system, utilizing a Hamiltonian derived from the $ \mathit{\boldsymbol{A}}^2 $ folded spectrum method[27]. The $ GEE (H, \beta) $ relates to the time-dependent Schrödinger equation involving the squared Hamiltonian, which uncovers information in the eigenvalues close to zero[28,29]. In recent years, with the deepening research in network science [30,31,32]. Scholars have discovered that Gaussian functions have important applications in capturing the structural signals of graphs [33], graph classification [34], and graph representation learning [35] in random and dynamic networks.

    Equitable partition (EP) was initially introduced in [36,37] and is defined as follows. Consider $ H $ to be a graph with $ n $ vertices, and $ \tau $ to be a partition of $ V(H) $ with $ V_1 \cup V_2 \cup \cdots \cup V_t $. If constants $ b_{i j} $ exist so that every vertex in the cell $ V_i $ has $ b_{i j} $ neighbors in the cell $ V_j $ for all $ i, j \in\{1, 2, \ldots, t\} $, then $ \tau $ is an EP. The matrix $ \left(b_{i j}\right)_{t \times t} $ is the divisor matrix of $ \tau $. Every graph $ G $ possesses EP, as the orbits of any group of automorphisms of $ G $ create an EP [38]. EP has many applications in fields such as control theory, chemical analysis, and data clustering [39,40,41]. The spectrum of $ (b_{ij})_{t\times t} $ is contained in that of $ H $ [37]. The matrix $ \mathit{\boldsymbol{C}} $ serves as the characteristic matrix for $ \tau $, with its columns representing the characteristic vectors of the subsets $ V_1, \ldots, V_t $.

    The concept of the star set and the star complement was introduced by [38,45]. For an eigenvalue $ \mu $ of the graph $ H $ with multiplicity $ k $, a star set for $ \mu $ in $ H $ is a subset of vertices $ \mathbb{X} \subseteq $ $ V(H) $ such that $ |\mathbb{X}| = k $ and the induced subgraph $ G-\mathbb{X} $ do not possess $ \mu $ as an eigenvalue. In this scenario, $ G-\mathbb{X} $ is referred to as the star complement for $ \mu $ in $ H $. As well known, a star set exists for any eigenvalue of any graph [46,47]. Further investigations into star set and star complement are studied in [48,49].

    Since EP and star set exist for any eigenvalue of any graph, this study employs the methods of EP and star set to derive new equations for the $ GSC (u, \beta) $ of graphs. These equations can assist in calculating the $ GSC (u, \beta) $ of a large graph by utilizing the structures of a smaller graph. Moreover, some bounds for the $ GSC (u, \beta) $ of $ H $ are established based on the graph parameters of $ H $. The rest of this paper is structured as follows. In Section 2, we give some lemmas used later. Section 3 details the generalized Gaussian subgraph centrality calculation formula in the context of the equitable partitions of graphs and star complements technique method. The influence of the parameter $ \beta $ on the robustness of the formula is explored through experiments. Section 4 introduces some bounds for the generalized Gaussian Estrada index using the graph parameters for graph $ H $. Section 5 conclusions are given.

    In this paper, let $ \mathit{\boldsymbol{I}} $ denote the identity matrix and $ \mathit{\boldsymbol{A}} $ represent the adjacency matrix of the graph $ H $. For a graph $ H $ with order $ n $ that has an EP with $ V(H) = V_1 \cup V_2 \cup\cdots\cup V_t $, the corresponding characteristic matrix $ \mathit{\boldsymbol{C}} $ is an $ n \times t $ matrix whose columns consist of the characteristic vectors of $ V_1, \ldots, V_t $.

    Next, we present the relationship between the characteristic, adjacency, and divisor matrices.

    Lemma 2.1. [36] Let $ \tau $ be an EP of graph $ H $ with characteristic matrix $ \mathit{\boldsymbol{C}} $ and divisor matrix $ \mathit{\boldsymbol{B}} $. Then

    $ AC=CB.
    $

    Here is the standard for determining whether a vertex subset qualifies as a star set.

    Lemma 2.2. [46,47] Let $ \mathbb{X} \subseteq V(H) $ and the adjacency matrix of the subgraph induced by $ \mathbb{X} $ be $ \mathit{\boldsymbol{A}}_{\mathbb{X}} $, and $ \mathit{\boldsymbol{A}} = (AXTTP)

    $. Then $ \mathbb{X} $ is a star set for an eigenvalue $ \mu $ of $ H $ if and only if $ \mu $ is not an eigenvalue of $ \mathit{\boldsymbol{P}} $ and

    $ μIAX=T(μIP)1T.
    $

    Lemma 2.3. [54] Let $ G $ be a graph with $ n $ vertices and $ m $ edges. Then

    $ ni=1d2im(2mn1+n2).
    $

    We formulate the generalized Gaussian subgraph centrality using the EP for graph $ H $ and compute its values with a smaller order matrix as follows.

    Theorem 3.1. Suppose that $ H $ has an EP with $ V(G) = V_1 \cup V_2 \cup \cdots \cup V_t $ and $ V_1 = \{u\} $, then

    $ GSC(u,β)=(exp(βB2))V1V1,
    $

    where $ B $ is the divisor matrix of EP.

    Proof. Consider $ \mathit{\boldsymbol{C}} $ and $ \mathit{\boldsymbol{B}} $ as the characteristic and divisor matrices of EP, respectively. According to Lemma 2.1, then

    $ exp(βA2)C=k=01k!(β)kA2kC=Ck=01k!(β)kB2k=Cexp(βB2).
    $

    Since $ V_1 = \{u\} $, we get

    $ (expβA2)uu=(exp(βA2)C)uV1=(Cexp(βB2))uV1=(exp(βB2))V1V1.
    $

    Hence

    $ GSC(u,β)=(exp(βA2))uu=(exp(βB2))V1V1.
    $

    Let $ H_1 $ and $ H_2 $ be two graphs; the join of $ H_1 $ and $ H_2 $ is the graph $ H_1 \otimes H_2 $ such that $ V\left(H_1 \otimes H_2\right) = V\left(H_1\right) \cup V\left(H_2\right) $ and $ E\left(H_1 \otimes H_2\right) = E\left(H_1\right) \cup E\left(H_2\right) \cup\left\{x y: x \in V\left(H_1\right)\right. $ and $ \left.y \in V\left(H_2\right)\right\} $. Furthermore, if $ H_2 $ is a complete graph $ K_1 $, then $ H_1\otimes K_1 $ is also called a cone over $ H_1 $ [38].

    Theorem 3.2. Let $ H_1 $ be an $ r $-regular graph on $ n $ vertices and $ H = H_1 \otimes K_1 $. If $ u \in V(K_1) $, then

    $ GSC(u,β)=r+r2+4n2r2+4nexp(2r2+4n+2rr2+4n4β)+r+r2+4n2r2+4nexp(2r2+4n2rr2+4n4β).
    $

    Proof. Since $ H $ has an EP with $ V(H) = \{u\} \cup V(H_1) $, it follows that the divisor matrix of EP is $ \mathit{\boldsymbol{B}} = (0n1r)

    $. By matrix diagonalization, we have

    $ B=S(r+r2+4n200rr2+4n2)S1,
    $

    where the eigenvalues of divisor matrix $ \mathit{\boldsymbol{B}} $ are $ \mu_1(\mathit{\boldsymbol{B}}) = \frac{r+\sqrt{r^2+4 n}}{2} $ and $ \mu_2(\mathit{\boldsymbol{B}}) = \frac{r-\sqrt{r^2+4 n}}{2} $, respectively.

    Let

    $ S=(r+r2+4n2r+r2+4n211),
    $

    and

    $ S1=(1r2+4nr+r2+4n2r2+4n1r2+4nr+r2+4n2r2+4n).
    $

    So, we can obtain

    $ B2=S(2r2+4n+2rr2+4n4002r2+4n2rr2+4n4)S1.
    $

    Therefore,

    $ exp(βB2)=S(exp(2r2+4n+2rr2+4n4β)00exp(2r2+4n2rr2+4n4β))S1=S(1r2+4nexp(2r2+4n+2rr2+4n4β)r+r2+4n2r2+4nexp(2r2+4n+2rr2+4n4β)1r2+4nexp(2r2+4n2rr2+4n4β)r+r2+4n2r2+4nexp(2r2+4n2rr2+4n4β)).
    $

    According to Theorem 3.1, we have

    $ GSC(u,β)=r+r2+4n2r2+4nexp(2r2+4n+2rr2+4n4β)+r+r2+4n2r2+4nexp(2r2+4n2rr2+4n4β).
    $

    Next, we calculate the generalized Gaussian subgraph centrality for a windmill graph by Theorem 3.2.

    Example 3.3. The $ F_s = K_1 \otimes (sK_2) $ is also called the windmill graph with order $ 2s+1 $. The spectra of $ F_s $ are $ \left \{ \frac{1 \pm \sqrt{8s+1}}{2}, -1^{[m]}, 1^{[m-1]} \right \} $[38]. From Theorem 3.2, if $ u \in V(K_1) $, where its degree is $ 2s $, then

    $ GSC(u,β)=1+8s+128s+1exp(8s+1+4s+12β)+1+8s+128s+1exp(8s+14s12β).
    $

    The eigenvalues of $ F_s $ are known; we have

    $ GEE(Fs,β)=(2s1)exp(β)+exp(8s+1+4s+12β)+exp(8s+14s12β).
    $

    If $ v \in V(sK_2) $, where their degree is $ 2 $. Obviously, the $ GSC(v, \beta) $ values of these vertices are the same, then

    $ GSC(v,β)=12s((2s1)exp(β)+1+8s+128s+1exp(8s+1+4s+12β)+1+8s+121+8sexp(8s+14s12β)).
    $

    We further give the generalized Gaussian subgraph centrality formula of a class multicone graph by Theorem 3.2.

    Example 3.4. The $ R_{s, n} = K_1 \otimes (sC_n) $ is called the multicone graph with order $ sn+1 $, where $ n\geq 3 $. If $ s > 1 $, the spectra of $ R_{s, n} $ are $ \{ 1 \pm \sqrt{sn+1}, 2\cos\frac{2k \pi}{n}^{[s]}, 2^{[s-1]} \} $, where $ k = 1, 2, \cdots, n-1 $. If $ s = 1 $, the spectra of $ R_{s, n} $ are $ \{ 1 \pm \sqrt{n+1}, 2\cos\frac{2k \pi}{n} \} $, where $ k = 1, 2, \cdots, n-1 $ [50]. From Theorem 3.2, if $ u \in V(K_1) $, where its degree is $ sn $, then

    $ GSC(u,β)=1+sn+12sn+1exp((2+sn+2sn+1)β)+1+sn+12sn+1exp((2+sn2sn+1)β).
    $

    The eigenvalues of $ R_{s, n} $ are known; we have

    Case 1. If $ s = 1 $, then

    $ GEE(R1,n,β)=n1k=1exp(4cos22kπnβ)+exp((2+n+2n+1)β)+exp((2+n2n+1)β).
    $

    If $ v \in V(s C_n) $, where their degree is $ 3 $. Obviously, the $ GSC(v, \beta) $ values of these vertices are the same, then

    $ GSC(v,β)=1n(GEE(R1,n,β)GSC(u,β))=1n(n1i=1exp(4cos22kπnβ)+1+n+12n+1exp((2+n+2n+1)β)+n+112n+1exp((2+n2n+1)β)).
    $

    Case 2. If $ s > 1 $, then

    $ GEE(Rs,n,β)=sn1k=1exp(4cos22kπnβ)+exp((2+sn+2sn+1)β)+exp((2+sn2sn+1)β)+(s1)exp(4β).
    $

    If $ v \in V(sC_n) $, where their degree is $ 3 $. Obviously, the $ GSC(v, \beta) $ values of these vertices are the same, then

    $ GSC(v,β)=1sn(GEE(Rs,n,β)GSC(u,β))=1sn(sn1k=1exp(4cos22kπnβ)+(s1)exp(4β)+1+sn+12sn+1exp((2+sn+2sn+1)β)+sn+112sn+1exp((2+sn2sn+1)β)).
    $

    Remark 1. More studies of eigenvalues of multicone graphs (e.g., $ K_1 \otimes (sK_n) $, $ K_1 \otimes (s\overline{C_n}) $) are shown in [38]. Similar to the proof of examples 3.3 and 3.4, these graphs' generalized Gaussian subgraph centrality can be immediately obtained from the conclusion of Theorem 3.2. In addition, for some classes of graphs, such as the transitive graph (e.g., $ K_n $, Petersen graph) and the large symmetries graph (e.g., Dandelion graph, Cayley tree), the quotient matrix of the graphs used by Theorem 3.1 will be much smaller than the order of the adjacency matrix, so the convergence rate may be faster when using Theorems 3.1 and 3.2 to calculate the generalized Gaussian subgraph centrality than the adjacency matrix.

    Furthermore, we discuss the influence of the parameter $ \beta $ on the robustness of the generalized Gaussian subgraph centrality by calculating the parameter $ \beta $ change in examples 3.3 and 3.4. First, we give the change of the value of the generalized Gaussian subgraph centrality with the windmill and wheel graphs, respectively, by the formulas in examples 3.3 and 3.4, as shown in Tables 1 and 2 (the results are to be retained to four decimal places).

    Table 1.  Values of $ GSC(u, \beta) $ are obtained for windmill graph $ F_s $.
    $ Graph $ $ d_u $ $ \beta =0.5 $ $ \beta =0.7 $ $ \beta =1 $ $ \beta =1.5 $ $ \beta =2 $
    $ F_3 $ 6 0.0856 0.0372 0.0110 0.0015 0.0001
    2 0.5156 0.4181 0.3780 0.1861 0.1128
    $ F_4 $ 8 0.0366 0.0116 0.0021 0.0001 -
    2 0.5341 0.4355 0.3221 0.1953 0.1184
    $ F_5 $ 10 0.0155 0.0035 0.0004 - -
    2 0.5470 0.4472 0.3311 0.2008 0.1218
    $ F_6 $ 12 0.0065 0.0011 0.0001 - -
    2 0.5564 0.4553 0.3372 0.2045 0.1241
    $ F_7 $ 14 0.0027 0.0003 - - -
    2 0.5634 0.4611 0.3416 0.2072 0.1257

     | Show Table
    DownLoad: CSV
    Table 2.  Values of $ GSC(u, \beta) $ are obtained for wheel graph $ R_{1, n} $.
    $ Graph $ $ d_u $ $ \beta =0.5 $ $ \beta =0.7 $ $ \beta =1 $ $ \beta =1.5 $ $ \beta =2 $
    $ R_{1, 3} $ 3 0.4517 0.3729 0.2759 0.1673 0.1015
    3 0.4517 0.3729 0.2759 0.1673 0.1015
    $ R_{1, 4} $ 4 0.3385 0.2485 0.1570 0.0731 0.0341
    3 0.5670 0.5390 0.5196 0.5076 0.5033
    $ R_{1, 5} $ 5 0.2470 0.1619 0.0861 0.0301 0.0105
    3 0.4596 0.3838 0.3094 0.2360 0.1893
    $ R_{1, 6} $ 6 0.1783 0.1035 0.0459 0.0119 0.0031
    3 0.4404 0.3490 0.2518 0.1501 0.0905
    $ R_{1, 7} $ 7 0.1274 0.0652 0.0239 0.0045 0.0008
    3 0.4552 0.3788 0.3075 0.2425 0.2055

     | Show Table
    DownLoad: CSV

    Sandwich coordination compounds, also known as metallocenes, are a fascinating class of organometallic compounds characterized by a metal atom sandwiched between two cyclopentadienyl anions [51]. The molecular graph for metallocenes can be represented as $ R_{2, 5} = K_1 \otimes (2C_5) $, where $ K_1 $ stands for a transition metal (e.g., iron atoms, chromium atom), and $ C_5 $ represents the cyclopentadienyl ring [52]. Like ferrocene and chromocene, many molecular structures can be represented by the molecular graph $ R_{2, n} $ of the molecular sandwich structure. Therefore, our discussion on the influence of parameter $ \beta $ of generalized Gaussian subgraph centrality may further explain the physical and chemical properties of the molecular map of the sandwich structure, as shown in Table 3.

    Table 3.  Values of $ GSC(u, \beta) $ are obtained for multicone graph $ R_{2, n} $.
    $ Graph $ $ d_u $ $ \beta =0.5 $ $ \beta =0.7 $ $ \beta =1 $ $ \beta =1.5 $ $ \beta =2 $
    $ R_{2, 3} $ 6 0.1783 0.1035 0.0459 0.0119 0.0034
    3 0.4404 0.3490 0.2518 0.1501 0.0905
    $ R_{2, 4} $ 8 0.0903 0.0405 0.0122 0.0017 0.0002
    3 0.5564 0.5253 0.5076 0.5010 0.5001
    $ R_{2, 5} $ 10 0.0445 0.0152 0.0030 0.0002 -
    3 0.4544 0.3770 0.3042 0.2337 0.1885
    $ R_{2, 6} $ 12 0.0214 0.0055 0.0007 - -
    3 0.4392 0.3465 0.2499 0.1494 0.0903
    $ R_{2, 7} $ 14 0.0164 0.0019 0.0001 - -
    3 0.4565 0.3788 0.3071 0.2424 0.2055

     | Show Table
    DownLoad: CSV

    As seen from the results in Tables 1, 2, and 3. When $ \beta = 1 $ is used as the basis for calculating the generalized Gaussian subgraph centrality, $ F_7 $ requires more digits to compute. As the number of $ F_n $ nodes increases, higher precision is required to obtain the results for $ F_n $. Therefore, when $ \beta \leq 0.7 $, the result is conducive to the numerical analysis of the graph (network) and structural analysis. From a chemical analysis perspective, taking the molecular structure of ferrocene as an example, nodes with a higher degree are prone to substitution reactions, which correspond to nodes with generalized Gaussian subgraph centrality values close to 0. Therefore, appropriately increasing $ \beta $ may be beneficial in identifying the positions of atoms that are prone to substitution. So, the parameter $ \beta $ plays a significant role in understanding how variations in the molecular configuration can impact the reactivity and stability of metallocenes.

    Below is the generalized Gaussian subgraph centrality formula for the graph, which utilizes a star set of graphs.

    Theorem 3.5. Let $ \mathbb{X} \subseteq V(H) $ and the adjacency matrix of the subgraph induced by $ \mathbb{X} $ be $ \mathit{\boldsymbol{A}}_{\mathbb{X}}. $ Consider $ \mathbb{X} $ as a star set corresponding to an eigenvalue $ \mu $ of graph $ H $, and $ \mathit{\boldsymbol{A}} = (AXTTP)

    $. Suppose that $ \mathit{\boldsymbol{Q}} = \mathit{\boldsymbol{P}} -\mu \mathit{\boldsymbol{I}} $, $ \mathit{\boldsymbol{C}} = \mathit{\boldsymbol{Q}}^{-1} \mathit{\boldsymbol{T}} \mathit{\boldsymbol{T}}^{\top}+ \mathit{\boldsymbol{Q}} $. Then,

    $ (1) $ For any vertex $ u \in \mathbb{X} $, we have

    $ GSC(u,β)=u1,u2Nu(˜X)(C1(exp((C+μI)2β)exp(μ2β)I)Q1)u1u2+exp(μ2β),
    $

    where $ N_u(\widetilde{\mathbb{X}}) $ denotes the set of all adjacent vertices of $ u $ in $ \widetilde{\mathbb{X}} = V(H) \backslash \mathbb{X}. $

    $ (2) $ For any $ v \in \widetilde{\mathbb{X}} = V(H) \backslash \mathbb{X} $, we can obtain

    $ GSC(v,β)=(exp(μ2β)Q1TTC1+(IQ1TTC1)exp((C+μI)2β))vv.
    $

    Proof. According to Lemma 2.2 and $ C=Q1TT+Q=Q1(TT+Q2),

    $ we can obtain

    $ AμI=(AXμITTQ)=(I0Q1TI)(0T0C)(I0Q1TI).
    $

    Since $ \mathit{\boldsymbol{T}} \mathit{\boldsymbol{T}}^{\top}+\mathit{\boldsymbol{Q}}^2 $ is positive definite and $ \mathit{\boldsymbol{C}} $ is nonsingular, it follows that

    $ A=S(μI00C+μI)S1,
    $

    where

    $ S=(I0Q1TI)(ITC10I)=(ITC1Q1TIQ1TTC1),
    $
    $ S1=(ITC10I)(I0Q1TI)=(ITC1Q1TTC1Q1TI).
    $

    Then

    $ exp(βA2)=S(exp(μ2β)I00exp((C+μI)2β))S1=(ITC1Q1TIQ1TTC1)(exp(μ2β)I00exp((C+μI)2β))S1=(exp(μ2β)ITC1exp((C+μI)2β)exp(μ2β)Q1Texp((C+μI)2β)Q1TTC1exp((C+μI)2β))S1.
    $

    Therefore, we can obtain the generalized Gaussian subgraph centrality of $ H $ as follows:

    $ (1) $ For any vertex $ u \in \mathbb{X} $, we can obtain

    $ GSC(u,β)=u1,u2Nu(˜X)(C1(exp((C+μI)2β)exp(μ2β)I)Q1)u1u2+exp(μ2β),
    $

    where $ N_u(\widetilde{\mathbb{X}}) $ denotes the set of all adjacent vertices of $ u $ in $ \widetilde{\mathbb{X}} = V(H) \backslash \mathbb{X} $.

    $ (2) $ For any vertex $ v \in \widetilde{\mathbb{X}} $, we can obtain

    $ GSC(v,β)=(exp(μ2β)Q1TTC1+(IQ1TTC1)exp((C+μI)2β))vv.
    $

    Remark 2. The emergence of the star complement technique is a method to study the problem of graph space and graph isomorphism. However, it is still challenging to find the maximal graphs corresponding to nice star complements; literature [53] still gives some small $ \mu $-rank (the value of $ t = n-s $ is as small as possible, where $ s $ is the multiplicity of the eigenvalues of $ \mu $) graphs with good structural characteristics. The order of the matrices of these small $ \mu $-rank graphs is much smaller than that of the adjacency matrices. Therefore, Theorem 3.5 can significantly improve the convergence rate of calculating the centrality of generalized Gaussian subgraphs in theory. However, we cannot find a good way to obtain nice star complements of graphs, which is also our future research direction.

    In this section, we get some bounds of the generalized Gaussian Estrada index based on the count of vertices and edges in graph $ H $. We determine the bounds of $ GEE(H, \beta) $ by some graph parameters as follows.

    Theorem 4.1. Let $ H $ be a graph with $ n $ vertices and $ m $ edges, then

    $ n4βm+n(n1)e4βmnGEE(H,β)n2βm1ω+eω,
    $

    where $ \omega = \sqrt{2 m \beta^2+m \beta^2\left(\frac{2 m}{n-1}+n-2\right)} $ and the equality mentioned above is valid if and only if $ H \cong \overline{K_n} $.

    Proof. According to the generalized Gaussian Estrada index definition, we have

    $ GEE2(H,β)=ni=1e2βμ2i+21i<jneβμ2ieβμ2j.
    $

    From the arithmetic-geometric inequality $ \frac{\sum _{i = 1}^n x_i}{n} \geq \sqrt[n]{\prod_{i = 1}^n x_i} $ for positive number $ x $, in which equality holds if and only if $ x_1 = x_2 = \cdots = x_n $. For $ \sum_{i = 1}^n \mu_i^2 = 2m $, we can obtain

    $ 21i<jneβμ2ieβμ2jn(n1)(1i<jneβμ2ieβμ2j)2n(n1)=n(n1)(n1ineβμ2i)2n=n(n1)(eβni=1μ2i)2n=n(n1)e4βmn.
    $

    From the expansion of Taylor series $ e^{-x} = \sum^{\infty}_{k = 0} \frac{(-x)^k}{k!} $ and $ e^{-x} \geq 1- x $ for positive number $ x $, it follows that

    $ k=2(x)kk!=k=0(x)kk!(1x)=ex(1x)0.
    $

    So we can obtain

    $ ni=1e2βμ2i=ni=1k=0(2βμ2i)kk!=n4βm+ni=1k=2(2βμ2i)kk!n4βm.
    $

    By substituting the mentioned formula and solving for $ GEE(H, \beta) $, we obtained

    $ GEE2(H,β)n4βm+n(n1)e4βmn,
    $

    then

    $ GEE(H,β)n4βm+n(n1)e4βmn,
    $

    where $ \beta > 0 $.

    We also give an upper bound by Lemma 2.3.

    $ GEE(H,β)=n2βm+ni=1k=2(βμ2i)kk!n2βm+k=21k!ni=1|βμ2i|kn2βm+k=21k!(ni=1β2μ2i)k/2n2βm+k=21k!(2mt2+mt2(2mn1+n2))k/2=n2βm1ω+k=0ωkk!=n2βm1ω+eω,
    $

    where $ \omega = \sqrt{2 m \beta^2+m \beta^2\left(\frac{2 m}{n-1}+n-2\right)} $.

    Based on the previous derivation, it is evident that equality holds if and only if graph $ H $ has all eigenvalues equal to zero. This condition is only satisfied by the empty graph $ \overline{K_n} $.

    Next, we give another simple lower bound for $ GEE(H, \beta) $.

    Theorem 4.2. Let $ H $ be a graph with $ n $ vertices and $ m $ edges, then

    $ GEE(H,β)n2βm,
    $

    the equality holds if and only if $ H \cong \overline{K_n} $.

    Proof. Similar to the analysis of Theorem 4.1, we have

    $ GEE(H,β)=ni=1k=0(βμ2i)kk!=n2βm+ni=1k=2(βμ2i)kk!
    $

    From the expansion of Taylor series $ e^{-x} = \sum^{\infty}_{k = 0} \frac{(-x)^k}{k!} $ and $ e^{-x} \geq 1- x $ for positive number $ x $, it follows that

    $ k=2(x)kk!=k=0(x)kk!(1x)=ex(1x)0.
    $

    Consequently, for any $ \epsilon \in[0, 1] $, we have

    $ GEE(H,β)n2βm+ϵni=1k=2(βμ2i)kk!=n2βmϵn+2βmϵ+ϵni=1k=0(βμ2i)kk!=(1ϵ)n+2(ϵ1)βm+ϵGEE(H,β).
    $

    For $ \epsilon < 1 $, it follows that

    $ GEE(H,β)(1ϵ)n+2(ϵ1)βm1ϵ=n2βm.
    $

    Based on the previous derivation, it is evident that equality holds if and only if graph $ H $ has all eigenvalues equal to zero. This condition is only satisfied by the empty graph $ \overline{K_n} $.

    The Estrada index and subgraph centrality for exploring network structure and properties focus more on the influence of extreme eigenvalues on network structure and properties. Unlike the well-known Estrada index and subgraph centrality, $ GSC(u, \beta) $ and $ GEE(H, \beta) $, under the Gaussian function definition, assign more weight to zero eigenvalues (if they exist) and near-zero eigenvalues to the network structure. At the same time, $ GSC(u, \beta) $ and $ GEE(H, \beta) $ are highly related to frontier orbital theory in quantum chemistry, so studying $ GSC(u, \beta) $ and $ GEE(H, \beta) $ is valuable. In this paper, since every graph has EP and a star set, against this background, we give some new formulas to calculate $ GSC(u, \beta) $. We can obtain $ GSC(u, \beta) $ formulas using a smaller matrix than the adjacency matrix. The influence of the parameter $ \beta $ on the robustness of the formula is explored through experiments. In addition, we also give some bounds for $ GEE(H, \beta) $. Based on the above research and recent research results, our future work will study $ GSC(u, \beta) $ and $ GEE(H, \beta) $ of random and dynamic graphs.

    Yang Yang: Writing-review & editing, Writing-original draft, Visualization, Validation, Supervision, Software, Project administration, Methodology, Investigation, Formal analysis, Data curation, Conceptualization. Yanyan Song: Writing-review & editing. Haifeng Fan: Writing-review & editing, Writing-original draft, Methodology, Investigation, Funding acquisition. Haiyan Qiao: Writing-review & editing, Funding acquisition. Yang Yang and Yanyan Song contribute equally to the article.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors would like to thank the editor and the kind anonymous referees for their insightful comments that helped to improve the paper's final edition. Hebei Province high-level talent funding project(B20221014, C20221079).

    The authors declare no conflict of interest.

    [1] Rechtschaffen A (1971) The control of sleep. In Hynt WA (ed): Human Behavior and its control. Cambridge, MA; Shenkman Publishing Company, Inc.
    [2] Rechtschaffen (1998) Current perspectives on the function of sleep. Perspect Biol Med 41(3): 359 (32).
    [3] Destexhe A, Contreras D, Steriade M (1999) Spatiotemporal analysis of local field potentials and unit discharges in cat cerebral cortex during natural wake and sleep states. J Neurosci 19(11):4595-4608.
    [4] Borbely AA (1982) A two process model of sleep regulation. Hum Neurobiol 1: 195-204.
    [5] Aristotle (1908) On sleep and sleeplessness; Translated by John Isaac Beare; 2014; Kindle Edition.
    [6] Piéron H (1912) Le problème Physiologique du Sommeil Paris; Maison Et Cie; Editeurs; Libraires de L'Académie de Médicine
    [7] Morrison AR (2013) Coming to grips with a “new” state of consciousness: the study of Rapid Eye Movement Sleep in the 1960's. J Hist Neurosci 22: 392-407. doi: 10.1080/0964704X.2013.777230
    [8] Shepard JW, Biysse DJ, Chesson AL Jr, et al. (2005) History of the development of sleep medicine in the United States. J Clin Sleep Med 1: 61-82.
    [9] Schmidt MH (2014) The energy allocation function of sleep: A unifying theory of sleep, torpor, and continuous wakefulness. Neurosci Biobehav Rev 47(0): 122-153.
    [10] Weitzman E D, Nogeire C, Perlow M, et al. (1974) Effects of a prolonged 3-hour sleep-wake cycle on sleep stages, plasma cortisol, growth hormone and body temperature in man. J Clin Endoc Metab 38(6): 1018-1030.
    [11] Guyon A, Balbo M, Morselli, et al. (2014) Adverse effects of two nights of sleep restriction on the hypothalamic-pituitary-adrenal axis in healthy men. J Clin Endoc Metab 99(8): 2861-2868.
    [12] Van Cauter E, Plat L (1996) Physiology of growth hormone secretion during sleep. J Pediatr 128(5 Pt 2): S32-37.
    [13] Van Cauter E, Blackman JD, Roland D, et al. (1991) Modulation of glucose regulation and insulin secretion by circadian rhythmicity and sleep. J Clin Invest 88(3): 934-942.
    [14] Spiegel K, Luthringer R, Follenius M, et al. (1995) Temporal relationship between prolactin secretion and slow-wave electroencephalic activity during sleep. Sleep 18(7): 543-548.
    [15] Luboshitzky R, Herer P, Levi, et al. (1999) Relationship between rapid eye movement sleep and testosterone secretion in normal men. J Androlo 20(6): 731-737.
    [16] Jung CM, Melanson EL, Frydendall EJ, et al. (2011) Energy expenditure during sleep, sleep deprivation and sleep following sleep deprivation in adult humans. J Physiolo 589 (Pt 1): 235-244.
    [17] Klingenberg L, Sjodin A, Holmback U, et al. (2012) Short sleep duration and its association with energy metabolism. Obesity Reviews: An Official Journal of the International Association for the Study of Obesity 13(7): 565-577.
    [18] Spiegel K, Tasali E, Penev P, et al. (2004) Brief communication: sleep curtailment in healthy young men is associated with decreased leptin levels, elevated ghrelin levels, and increased hunger and appetite. Ann Int Medi 141(11): 846-850.
    [19] Spaeth AM, Dinges DF, Goel N (2013) Effects of experimental sleep restriction on weight gain, caloric intake, and meal timing in healthy adults. Sleep 36(7): 981-990.
    [20] Lange T, Dimitrov S, Bollinger, et al. (2011) Sleep after vaccination boosts immunological memory. J Immunol (Baltimore, Md.: 1950), 187(1): 283-290.
    [21] Irwin MR, Wang M, Campomayor CO, et al. (2006) Sleep deprivation and activation of morning levels of cellular and genomic markers of inflammation. Arch Int Med 166(16): 1756-1762.
    [22] Tamakoshi A, Ohno Y, JACC Study Group (2004) Self-reported sleep duration as a predictor of all-cause mortality: Results from the JACC study, japan. Sleep 27(1): 51-54.
    [23] Rod NH, Kumari M, Lange T, et al. (2014) The joint effect of sleep duration and disturbed sleep on cause-specific mortality: Results from the whitehall II cohort study. PloS One 9(4): e91965.
    [24] Altman NG, Izci-Balserak B, Schopfer E, et al. (2012) Sleep duration versus sleep insufficiency as predictors of cardiometabolic health outcomes. Sleep Med 13(10): 1261-1270.
    [25] Van Leeuwen WM, Lehto M, Karisola P, et al. (2009) Sleep restriction increases the risk of developing cardiovascular diseases by augmenting proinflammatory responses through IL-17 and CRP. PloS One 4(2): e4589.
    [26] Spiegel K, Leproult R, Van Cauter E (1999) Impact of sleep debt on metabolic and endocrine function. Lancet 354(9188): 1435-1439.
    [27] Tochikubo O, Ikeda A, Miyajima E, et al. (1996) Effects of insufficient sleep on blood pressure monitored by a new multibiomedical recorder. Hypertension 27(6), 1318-1324.
    [28] Banks S, Dinges DF (2007) Behavioral and physiological consequences of sleep restriction. J Clin Sleep Med: JCSM: Official Publication of the American Academy of Sleep Medicine 3(5): 519-528.
    [29] Walker MP, Brakefield T, Morgan A, et al. (2002) Practice with sleep makes perfect: Sleep-dependent motor skill learning. Neuron 35(1): 205-211.
    [30] Nishida M, Walker MP (2007) Daytime naps, motor memory consolidation and regionally specific sleep spindles. PloS One 2(4): e341.
    [31] Gais S, Molle M, Helms K, et al. (2002) Learning-dependent increases in sleep spindle density. J Neurosci: The Official Journal of the Society for Neuroscience 22(15): 6830-6834.
    [32] Marshall L, Helgadottir H, Molle M, et al. (2006) Boosting slow oscillations during sleep potentiates memory. Nature 444(7119): 610-613.
    [33] Astill RG, Piantoni G, Raymann RJ, et al. (2014) Sleep spindle and slow wave frequency reflect motor skill performance in primary school-age children. Frontiers Hum Neurosci 8: 910.
    [34] De Koninck J, Lorrain D, Christ, et al. (1989) Intensive language learning and increases in rapid eye movement sleep: Evidence of a performance factor. Int J Psychophysiol: Official Journal of the International Organization of Psychophysiology 8(1): 43-47.
    [35] Abel T, Havekes R, Saletin, et al. (2013) Sleep, plasticity and memory from molecules to whole-brain networks. Curr Biolo: CB 23(17): R774-788.
    [36] Walker MP (2009) The Year in Cognitive Neuroscience. Ann NY Acad Sci 1156: 168-197. doi: 10.1111/j.1749-6632.2009.04416.x
    [37] Goldstein AN, Walker MP (2014) The role of sleep in emotional brain function. Ann Rev Clin Psycholo 10: 679-708.
    [38] Lim J, Dinges D F (2010) A meta-analysis of the impact of short-term sleep deprivation on cognitive variables. Psycholo Bulletin 136(3): 375-389.
    [39] Belenky G, Wesensten NJ, Thorne DR, et al. (2003) Patterns of performance degradation and restoration during sleep restriction and subsequent recovery: A sleep dose-response study. J Sleep Res 12(1): 1-12.
    [40] Dinges D, Powell J (1985) Microcomputer analyses of performance on a portable, simple visual RT task during sustained operations. Behav Res Method Instrum Comput 17(6): 652-655.
    [41] Van Dongen HP, Maislin G, Mullington JM, et al. (2003) The cumulative cost of additional wakefulness: Dose-response effects on neurobehavioral functions and sleep physiology from chronic sleep restriction and total sleep deprivation. Sleep 26(2): 117-126.
    [42] Rupp TL, Wesensten NJ, Bliese PD, et al. (2009) Banking sleep: Realization of benefits during subsequent sleep restriction and recovery. Sleep 32(3): 311-321.
    [43] Meddis R (1975) On the function of sleep. Animal Behav 23: 676-691. doi: 10.1016/0003-3472(75)90144-X
    [44] Webb W (1974) Sleep as an adaptive response. Perceptual Motor Skills 38: 1023-1027. doi: 10.2466/pms.1974.38.3c.1023
    [45] Webb WB (1979) Theories of sleep functions and some clinical implications. The Functions of Sleep: 19-35.
    [46] Siegel JM (2009) Sleep viewed as a state of adaptive inactivity. Nat Rev Neurosci 10: 747-753
    [47] Berger RJ, Phillips NH (1993) Sleep and energy conservation. Physiolo 8: 276-281.
    [48] Berger RJ, Phillips NH (1995) Energy conservation and sleep. Behav Brain Res 69(1-2): 65-73.
    [49] Adam K (1980) Sleep as a restorative process and a theory to explain why. Prog Brain Res 53: 289-305. doi: 10.1016/S0079-6123(08)60070-9
    [50] Oswald I (1980) Sleep as restorative process: Human clues. Prog Brain Res 53: 279-288.
    [51] Clugston GA, Garlick P J (1982) The response of protein and energy metabolism to food intake in lean and obese man. Hum Nutr: Clin Nutr 36(1): 57-70.
    [52] Karnovsky M L, Reich P, Anchors JM, et al (1983) Changes in brain glycogen during slow-wave sleep in the rat. J Neurochem 41(5): 1498-1501.
    [53] Benington JH, Heller HC (1995) Restoration of brain energy metabolism as the function of sleep. Prog Neurobiolo 45(4): 347-360.
    [54] Benington JH (2000) Sleep homeostasis and the function of sleep. Sleep 23(7): 959-966.
    [55] Reimund E (1994) The free radical flux theory of sleep. Med Hypotheses 43(4): 231-233.
    [56] Siegel JM (2005) Clues to the functions of mammalian sleep. Nature 437(7063): 1264-1271.
    [57] Xie L, Kang H, Xu Q, et al. (2013) Sleep drives metabolite clearance from the adult brain. Science (New York, N.Y.) 342(6156): 373-377.
    [58] Moruzzi G (1966) Functional significance of sleep for brain mechanisms. In: Eccles JC, ed. Brain and conscious experience. Berlin: Springer-Verlag: 345-388.
    [59] Moruzzi G (1972) The sleep-waking cycle. Ergeb Physiol 64: 1-165
    [60] Krueger JM, Obal F (1993) A neuronal group theory of sleep function. J Sleep Res 2(2): 63-69.
    [61] Kavanau JL (1996) Memory, sleep, and dynamic stabilization of neural circuitry: evolutionary perspectives. Neurosci Biobehav Rev 20: 289-311.
    [62] Kavanau JL (1997a) Memory, sleep and the evolution of mechanisms of synaptic efficacy maintenance. Neurosci 79: 7-44.
    [63] Kavanau JL (1997b) Origin and evolution of sleep: roles of vision and endothermy. Brain Res Bulletin 42: 245-264.
    [64] Kavanau JL (1994) Sleep and dynamic stabilization of neural circuitry: A review and synthesis. Behav Brain Res 63(2): 111-126.
    [65] Jouvet M (1975) The function of dreaming: a neurophysiologist's point of view. In: Gazzaniga, M.S., Blakemore, C. (Eds.), Handbook of Psychobiology. Academic Press, Inc., New York, pp. 499-527.
    [66] Crick F, Mitchison G (1983) The function of dream sleep. Nature 304(5922): 111-114.
  • Reader Comments
  • © 2015 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(23407) PDF downloads(3591) Cited by(74)

Figures and Tables

Tables(1)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog