2012
DOI: 10.1007/s10910-012-0033-7
|View full text |Cite
|
Sign up to set email alerts
|

Determining polyhedral arrangements of atoms using PageRank

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
8
1

Relationship

4
5

Authors

Journals

citations
Cited by 23 publications
(18 citation statements)
references
References 2 publications
0
17
0
Order By: Relevance
“…Analyzing this network via PageRank produces a mathematically unique PageRank (PR) value; each PR corresponds to a specific solvation geometry. 59,60 For example, the PR of an ion in a tricapped trigonalprismatic solvation environment is 0.148144. For each snapshot of simulation data, the calculated PR is compared to a library of PR values for different polyhedral arrangements; when the calculated PR is matched with the PR of known polyhedra, the solvation structure can be identified on a snapshot-by-snapshot basis.…”
Section: ■ Computational Methodsmentioning
confidence: 99%
“…Analyzing this network via PageRank produces a mathematically unique PageRank (PR) value; each PR corresponds to a specific solvation geometry. 59,60 For example, the PR of an ion in a tricapped trigonalprismatic solvation environment is 0.148144. For each snapshot of simulation data, the calculated PR is compared to a library of PR values for different polyhedral arrangements; when the calculated PR is matched with the PR of known polyhedra, the solvation structure can be identified on a snapshot-by-snapshot basis.…”
Section: ■ Computational Methodsmentioning
confidence: 99%
“…Consider that eigenvalues or eigenvectors of the adjacency matrix (or its related matrices) can be related to specific edge patterns within a graph, as in the use of PageRank as a tool to identify polyhedral arrangement of particles and as a collective variable for chemical transformations. 93 , 142 , 143 Leveraging recent developments in computational topology, one can use other meaningful features to characterize the graph topology together with metric information, such as the length sequence of the minimal cycle base of a weighted graph. 144 A particular general framework is via persistent homology, which can map an input (metric or weighted) graph into a persistence diagram feature representation, via the use of the intrinsic Čech filtration over the input graph (equipped with the shortest path metric), 145 or induced by the clique complexes (for both directed or undirected graphs), 146 149 or induced by the so-called path homology when the input graph is directed.…”
Section: The Many-body Roadmapmentioning
confidence: 99%
“…In the former, the entire hydrogen bond network of the simulated water was first converted into a graph, wherein the oxygen atoms are vertices and the intermolecular hydrogen bonds between water molecules are edges. The PageRank of the solute was then used to investigate the specific organization patterns of water about a solute, and was shown to be an effective data‐mining tool for understanding solvation structure as a function of time . This algorithm is available within the moleculaRnetworks software program .…”
Section: Introductionmentioning
confidence: 99%