scholarly journals On Rayleigh–Ritz ratios of a generalized Laplacian matrix of directed graphs

2005 ◽  
Vol 402 ◽  
pp. 207-227 ◽  
Author(s):  
Chai Wah Wu
2018 ◽  
Vol 6 (1) ◽  
pp. 122-154 ◽  
Author(s):  
Carlos A. Alfaro ◽  
Carlos E. Valencia

Abstract The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. Previously, they have been used in the understanding and characterizing of the graphs with critical group with few invariant factors equal to one. However, critical ideals generalize the critical group, Smith group and the characteristic polynomials of the adjacency and Laplacian matrices of a graph. In this article we provide a set of minimal forbidden graphs for the set of graphs with at most three trivial critical ideals. Then we use these forbidden graphs to characterize the graphs with at most three trivial critical ideals and clique number equal to 2 and 3.


Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2841
Author(s):  
Juan-Luis García-Zapata ◽  
Clara Grácio

Spectral techniques are often used to partition the set of vertices of a graph, or to form clusters. They are based on the Laplacian matrix. These techniques allow easily to integrate weights on the edges. In this work, we introduce a p-Laplacian, or a generalized Laplacian matrix with potential, which also allows us to take into account weights on the vertices. These vertex weights are independent of the edge weights. In this way, we can cluster with the importance of vertices, assigning more weight to some vertices than to others, not considering only the number of vertices. We also provide some bounds, similar to those of Chegeer, for the value of the minimal cut cost with weights at the vertices, as a function of the first non-zero eigenvalue of the p-Laplacian (an analog of the Fiedler eigenvalue).


1984 ◽  
Author(s):  
Lawrence A. Rowe ◽  
Michael Davis ◽  
Eli Messinger ◽  
Carl Meyer ◽  
Charles Spirakis
Keyword(s):  

2021 ◽  
Vol 6 (1) ◽  
Author(s):  
Ruaridh A. Clark ◽  
Malcolm Macdonald

AbstractContact networks provide insights on disease spread due to the duration of close proximity interactions. For systems governed by consensus dynamics, network structure is key to optimising the spread of information. For disease spread over contact networks, the structure would be expected to be similarly influential. However, metrics that are essentially agnostic to the network’s structure, such as weighted degree (strength) centrality and its variants, perform near-optimally in selecting effective spreaders. These degree-based metrics outperform eigenvector centrality, despite disease spread over a network being a random walk process. This paper improves eigenvector-based spreader selection by introducing the non-linear relationship between contact time and the probability of disease transmission into the assessment of network dynamics. This approximation of disease spread dynamics is achieved by altering the Laplacian matrix, which in turn highlights why nodes with a high degree are such influential disease spreaders. From this approach, a trichotomy emerges on the definition of an effective spreader where, for susceptible-infected simulations, eigenvector-based selections can either optimise the initial rate of infection, the average rate of infection, or produce the fastest time to full infection of the network. Simulated and real-world human contact networks are examined, with insights also drawn on the effective adaptation of ant colony contact networks to reduce pathogen spread and protect the queen ant.


Sign in / Sign up

Export Citation Format

Share Document