Developments in the theory of randomized shortest paths with a comparison of graph node distances (Q1782487): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NetKit / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065229575 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1212.1666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5489870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical analysis of network data. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3100186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The electrical resistance of a graph captures its commute and cover times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Shortest-Path Problems: Two Related Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of graph-geodetic distances generalizing the shortest-path and the resistance distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4224235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3091593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances and volumina for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matrix-forest theorem and measuring relations in small social groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The walk distances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern multidimensional scaling: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communicability distance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric and Euclidean properties of dissimilarity coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Learning: ECML 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303321897735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Semi-Supervised Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explaining all three-alternative voting outcomes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:58, 16 July 2024

scientific article
Language Label Description Also known as
English
Developments in the theory of randomized shortest paths with a comparison of graph node distances
scientific article

    Statements

    Developments in the theory of randomized shortest paths with a comparison of graph node distances (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 September 2018
    0 references
    0 references
    graph node distances
    0 references
    free energy
    0 references
    randomized shortest paths
    0 references
    shortest path distance
    0 references
    commute time and resistance distance
    0 references
    clustering
    0 references
    0 references
    0 references