Results 231 to 240 of about 79,461 (254)

PHLOWER leverages single-cell multimodal data to infer complex, multi-branching cell differentiation trajectories. [PDF]

Nat Methods
Cheng M, Jansen J, Reimer KC, Grande VP, Nagai JS, Li Z, Kießling P, Grasshoff M, Kuppe C, Schaub MT, Kramann R, Costa IG.   +11 more
europepmc   +1 more source

Evolution problems with perturbed 1-Laplacian type operators on random walk spaces. [PDF]

Math Ann
Górny W, Mazón JM, Toledo J.
europepmc   +1 more source

Enhancing the accuracy of seismic velocity in near-surface layers through Laplacian spectra analysis of weighted graphs. [PDF]

Sci Rep
Alfuraidan MR, Al-Shuhail AA, Hanafy SM, Sarumi IO.   +3 more
europepmc   +1 more source

Rolling Bearing Fault Diagnosis Based on Multi-Source Domain Joint Structure Preservation Transfer with Autoencoder. [PDF]

Sensors (Basel)
Jiang Q, Shi T, Hou X, Miao B, Zhang Z, Jin Y, Wang Z, Zhou H.   +7 more
europepmc   +1 more source

Memristance and transmemristance in multiterminal memristive systems

Milano G, Pilati D, Michieletti F, Cultrera A, Ricciardi C, Miranda E.   +5 more
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