Results 221 to 230 of about 67,630 (266)

A cohomology-based Gromov-Hausdorff metric approach for quantifying molecular similarity. [PDF]

Sci Rep
Wee J, Gong X, Tuschmann W, Xia K.
europepmc   +1 more source

Enhancing energy predictions in multi-atom systems with multiscale topological learning.

J Mater Chem A Mater
Chen D, Wang R, Wei GW, Pan F.
europepmc   +1 more source

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

Further Exploration of an Upper Bound for Kemeny's Constant. [PDF]

Entropy (Basel)
Kooij RE, Dubbeldam JLA.
europepmc   +1 more source

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

Large-<i>n</i> asymptotics for Weil-Petersson volumes of moduli spaces of bordered hyperbolic surfaces. [PDF]

Commun Math Phys
Hide W, Thomas J.
europepmc   +1 more source

Topology-preserving Hodge decomposition in the Eulerian representation. [PDF]

Beijing J Pure Appl Math
Su Z, Tong Y, Wei GW.
europepmc   +1 more source

Conformal bounds for the first eigenvalue of the $\left(p,q\right)$-Laplacian system

Mohammad Javad Habibi Vosta Kolaei, Shahroud Azami   +1 more
openalex   +2 more sources

Memristance and transmemristance in multiterminal memristive systems. [PDF]

Sci Rep
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:

Graph Embeddings and Laplacian Eigenvalues

SIAM Journal on Matrix Analysis and Applications, 2000
Summary: Graph embeddings are useful in bounding the smallest nontrivial eigenvalues of Laplacian matrices from below. For an \(n \times n\) Laplacian, these embedding methods can be characterized as follows: The lower bound is based on a clique embedding into the underlying graph of the Laplacian. An embedding can be represented by a matrix \(\Gamma\);
Guattery, Stephen, Miller, Gary L.
openaire   +1 more source