Results 61 to 70 of about 120,979 (218)

Network Coherence in a Family of Book Graphs

Frontiers in Physics, 2020
In this paper, we study network coherence characterizing the consensus behaviors with additive noise in a family of book graphs. It is shown that the network coherence is determined by the eigenvalues of the Laplacian matrix.
Jing Chen, Yifan Li, Weigang Sun
doaj   +1 more source

Perfect State Transfer in Laplacian Quantum Walk [PDF]

, 2014
For a graph $G$ and a related symmetric matrix $M$, the continuous-time quantum walk on $G$ relative to $M$ is defined as the unitary matrix $U(t) = \exp(-itM)$, where $t$ varies over the reals.
Alvir, R., Dever, S., Lovitz, B, Myer, J., Tamon, C., Xu, Y., Zhan, H.   +6 more
core  

Asymptotic behavior of the number of Eulerian orientations of graphs

, 2012
We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations.
B. D. McKay, R. W. Robinson, B. Mohar, M. Fiedler, M. Isaev, M. Las Vergnas, M. Mihail, P. Winkler   +5 more
core   +3 more sources

Laplacian Constrained Precision Matrix Estimation: Existence and High Dimensional Consistency [PDF]

, 2021
Eduardo Pavéz
openalex   +2 more sources

Random walks with long-range steps generated by functions of Laplacian matrices

, 2018
In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix.
Collet, B. A., Michelitsch, T. M., Nicolleau, F. C. G. A., Nowakowski, A. F., Riascos, A. P.   +4 more
core   +1 more source

Moment-Based Spectral Analysis of Large-Scale Generalized Random Graphs

IEEE Access, 2017
This paper investigates the spectra of the adjacency matrix and Laplacian matrix for an artificial complex network model-the generalized random graph. We deduce explicit expressions for the first four asymptotic spectral moments of the adjacency matrix ...
Qun Liu, Zhishan Dong, En Wang
doaj   +1 more source

New Spectral Results for Laplacian Harary Matrix and the Harary Laplacian-Energy-like Applying a Matrix Order Reduction

Mathematics, 2023
In this paper, we introduce the concepts of Harary Laplacian-energy-like for a simple undirected and connected graph G with order n. We also establish novel matrix results in this regard. Furthermore, by employing matrix order reduction techniques, we derive upper and lower bounds utilizing existing graph invariants and vertex connectivity. Finally, we
Luis Medina, Jonnathan Rodríguez, Macarena Trigo   +2 more
openaire   +2 more sources

On the Eigenvalues and Energy of the Seidel and Seidel Laplacian Matrices of Graphs

Discrete Dynamics in Nature and Society
Let SΓ be a Seidel matrix of a graph Γ of order n and let DΓ=diagn−1−2d1,n−1−2d2,…,n−1−2dn be a diagonal matrix with di denoting the degree of a vertex vi in Γ. The Seidel Laplacian matrix of Γ is defined as SLΓ=DΓ−SΓ.
J. Askari, Kinkar Chandra Das, Yilun Shang   +2 more
doaj   +1 more source

On the Eigenvalues of General Sum-Connectivity Laplacian Matrix [PDF]

Journal of the Operations Research Society of China, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deng, Hanyuan, Huang, He, Zhang, Jie
openaire   +3 more sources

On Path Laplacian Eigenvalues and Path Laplacian Energy of Graphs

Journal of New Theory, 2018
We introduce the concept of Path Laplacian Matrix for a graph and explore the eigenvalues of this matrix. The eigenvalues of this matrix are called the path Laplacian eigenvalues of the graph.
Shridhar Chandrakant Patekar, Maruti Mukinda Shikare   +1 more
doaj