Results 41 to 50 of about 150 (120)
Sensitivity of Perron and Fiedler Eigenpairs to Structural Perturbations of a Network
Numerical Linear Algebra with Applications, Volume 32, Issue 5, October 2025.ABSTRACT One can estimate the change of the Perron and Fiedler values for a connected network when the weight of an edge is perturbed by analyzing relevant entries of the Perron and Fiedler vectors. This is helpful for identifying edges whose weight perturbation causes the largest change in the Perron and Fiedler values.
Silvia Noschese, Lothar Reichel
wiley +1 more source
Journal of Function Spaces, Volume 2025, Issue 1, 2025.Algebraic curves and topological sequences play a crucial role in mathematics and graph theory, serving as a bridge between geometry, algebra, and number theory. They facilitate structural analysis in various applications, including chemistry, network analysis, and computer science.
Mohammad Mazyad Hazzazi +5 more
wiley +1 more source
Model‐based clustering in simple hypergraphs through a stochastic blockmodel
Scandinavian Journal of Statistics, Volume 51, Issue 4, Page 1661-1684, December 2024.Abstract We propose a model to address the overlooked problem of node clustering in simple hypergraphs. Simple hypergraphs are suitable when a node may not appear multiple times in the same hyperedge, such as in co‐authorship datasets. Our model generalizes the stochastic blockmodel for graphs and assumes the existence of latent node groups and ...
Luca Brusa, Catherine Matias
wiley +1 more source
A note on the Laplacian Estrada index of trees
, 2016 The Laplacian Estrada index of a graph G is defined as LEE(G) = Σni=1 eμi , where μ1 ≥ μ2 ≥ ··· ≥ μn−1 ≥ μn = 0 are the eigenvalues of its Laplacian matrix. An unsolved problem in [19] is whether Sn(3, n − 3) or Cn(n − 5) has the third maximal Laplacian Estrada index among all trees on n vertices, where Sn(3, n − 3) is the double tree formed by adding ...
Deng, H, Zhang, J
openaire +2 more sources
Methods in Ecology and Evolution, Volume 15, Issue 6, Page 1113-1128, June 2024.Abstract Characterizing and understanding the processes that shape the structure of ecological networks, which represent who interacts with whom in a community, has many implications in ecology, evolutionary biology and conservation. A highly debated question is whether and how the structure of a bipartite ecological network differs between ...
Benoît Pichon +3 more
wiley +1 more source
Heat Kernel of Networks with Long‐Range Interactions
Complexity, Volume 2024, Issue 1, 2024.The heat kernel associated with a discrete graph Laplacian is the basic solution to the heat diffusion equation of a strict graph or network. In addition, this kernel represents the heat transfer that occurs over time across the network edges. Its computation involves exponentiating the Laplacian eigensystem with respect to time.
Franck Kalala Mutombo +3 more
wiley +1 more source
A New Like Quantity Based on "Estrada Index"
Journal of Inequalities and Applications, 2010 We first define a new Laplacian spectrum based on Estrada index, namely, Laplacian Estrada-like invariant, LEEL, and two new Estrada index-like quantities, denoted by S and , respectively, that are generalized versions of the Estrada index. After that,
Güngör ADilek
doaj
Frontiers in PhysicsThe study centered on Quantitative Structure Property Relationship (QSPR) analysis with a focus on various graph energies, investigating drugs like Mefloquinone, Sertraline, Niclosamide, Tizoxanide, PHA-690509, Ribavirin, Emricasan, and Sofosbuvir ...
Ali Raza, Muhammad Mobeen Munir
doaj +1 more source
Sharp bounds on the signless Laplacian Estrada index of graphs
Filomat, 2014 Let G be a connected graph with n vertices and m edges. Let q1, q2,..., qn be the eigenvalues of the signless Laplacian matrix of G, where q1 ? q2 ? ... ? qn. The signless Laplacian Estrada index of G is defined as SLEE(G) = nPi=1 eqi. In this paper, we present some sharp lower bounds for SLEE(G) in terms of the k-degree and the first ...
Shan Gao, Huiqing Liu
openaire +2 more sources
New lower bounds for the Estrada and Signless Laplacian Estrada Index of a Graph
, 2018 Let $G$ be a graph on $n$ vertices and $λ_1,λ_2,\ldots,λ_n$ its eigenvalues. The Estrada index of $G$ is defined as $EE(G)=\sum_{i=1}^n e^{λ_i}.$ In this work, using a different demonstration technique, new lower bounds are obtained for the Estrada index, that depends on the number of vertices, the number of edges and the energy of the graph is given ...
Aguayo, Juan L. +2 more
openaire +2 more sources