Results 201 to 210 of about 76,384 (242)

The role of connectivity for the degeneracy of the brain's resting state dynamics. [PDF]

J Comput Neurosci
Gudibanda K, Fousek J, Petkoski S, Jirsa V.   +3 more
europepmc   +1 more source

Optimal tracking consensus for swarm systems with leader-following switching topologies. [PDF]

Sci Rep
Zhang Q, Wang C, Zhao M, Xi J, Zheng Y.
europepmc   +1 more source

CTFacTomo: Reconstructing 3D spatial structures of RNA tomography transcriptomes by collapsed tensor factorization. [PDF]

PLoS Comput Biol
Song T, Nguyen Q, Broadbent C, Kuang R.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Laplacian Dynamics on General Graphs

Bulletin of Mathematical Biology, 2013
In previous work, we have introduced a "linear framework" for time-scale separation in biochemical systems, which is based on a labelled, directed graph, G, and an associated linear differential equation, dx/dt = L(G) ∙ x, where L(G) is the Laplacian matrix of G. Biochemical nonlinearity is encoded in the graph labels. Many central results in molecular
Mirzaev, Inomzhon, Gunawardena, Jeremy
openaire   +2 more sources

Intrinsic Graph Structure Estimation Using Graph Laplacian

Neural Computation, 2014
A graph is a mathematical representation of a set of variables where some pairs of the variables are connected by edges. Common examples of graphs are railroads, the Internet, and neural networks. It is both theoretically and practically important to estimate the intensity of direct connections between variables. In this study, a problem of estimating
Noda, Atsushi, Hino, Hideitsu, Tatsuno, Masami, Akaho, Shotaro, Murata, Noboru   +4 more
openaire   +2 more sources

Laplacian Controllability for Graphs with Integral Laplacian Spectrum

Mediterranean Journal of Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Laplacian borderenergetic graphs

Journal of Information and Optimization Sciences, 2019
The graph G of order n is said to be Laplacian (signless Laplacian) borderenergetic if its Laplacian (signless Laplacian) energy equals the Laplacian (signless Laplacian) energy of the complete gra...
Mardjan Hakimi-Nezhaad, Modjtaba Ghorbani   +1 more
openaire   +1 more source

Graphs and Laplacians

2017
In this chapter, we are interested in exploring questions such as the following. If a group G acts on a graph \(\Gamma \), what is the relationship between the spectrum of \(\Gamma \) and the spectrum of the quotient \(\Gamma /G\)?
W. David Joyner, Caroline Grant Melles
openaire   +1 more source