Results 301 to 310 of about 2,218,762 (336)

Characteristics of spontaneous anterior-posterior oscillation-frequency convergences in the alpha band. [PDF]

eNeuro
Suzuki S, Grabowecky M, Menceloglu M.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On New Laplacian Matrix with a User-Assigned Nullspace in Distributed Control of Multiagent Systems

American Control Conference, 2020
Most distributed control results utilize the benchmark consensus algorithm, which is built on the well-known Laplacian matrix whose nullspace spans the vector of ones.
Dzung Tran, T. Yucelen
semanticscholar   +1 more source

The Laplacian matrix in chemistry

Journal of Chemical Information and Computer Sciences, 1994
The Laplacian matrix, its spectrum, and its polynomial are discussed. An algorithm for computing the number of spanning trees of a polycyclic graph, based on the corresponding Laplacian spectrum, is outlined. Also, a technique using the Le Verrier-Faddeev-Frame method for computing the Laplacian polynomial of a graph is detailed.
Nenad Trinajstić, Zlatko Mihalić, Darko Babić, Dragan Amić, Sonja Nikolić, Dejan Plavsic   +5 more
openaire   +3 more sources

Community Detection in Sparse Networks Using the Symmetrized Laplacian Inverse Matrix (SLIM)

Statistica sinica, 2021
There is increasing interest in the study of community detection for sparse networks. Here, we propose a new method for detecting communities in sparse networks that uses the symmetrized Laplacian inverse matrix (SLIM) to measure the closeness between ...

semanticscholar   +1 more source

Learning Laplacian Matrix from Bandlimited Graph Signals

IEEE International Conference on Acoustics, Speech, and Signal Processing, 2019
In this paper, we present a method for learning an underlying graph topology using observed graph signals as training data. The novelty of our method lies on the combination of two assumptions that are imposed as constraints to the graph learning process:
B. L. Bars, Pierre Humbert, L. Oudre, Argyris Kalogeratos   +3 more
semanticscholar   +1 more source

Brouwer type conjecture for the eigenvalues of distance signless Laplacian matrix of a graph

Linear and multilinear algebra, 2019
Let G be a simple connected graph with n vertices, m edges and having distance signless Laplacian eigenvalues . For , let and be respectively the sum of k-largest distance signless Laplacian eigenvalues and the sum of k-smallest distance signless ...
A. Alhevaz, M. Baghipur, H. A. Ganie, S. Pirzada   +3 more
semanticscholar   +1 more source

The perturbed laplacian matrix of a graph

Linear and Multilinear Algebra, 2001
For a graph G, we define its perturbed Laplacian matrix as D−A(G) where A(G) is the adjacency matrix of G and D is an arbitrary diagonal matrix. Both the Laplacian matrix and the negative of the adjacency matrix are special instances of the perturbed Laplacian.
Steve Kirkland, Ravindra B. Bapat, S. Pati   +2 more
openaire   +2 more sources

Eigenvalue Assignment for the Laplacian Matrix of Directed Graphs

American Control Conference, 2019
This paper considers the problem of designing the edge weights of directed graphs such that their Laplacian matrix has a prescribed spectrum. We provide a parametrization of the Laplacian matrix which is suitable for solving the problem numerically.
Jonathan Hermann, U. Konigorski
semanticscholar   +1 more source