Pages that link to "Item:Q1290688"

The following pages link to The matrix-forest theorem and measuring relations in small social groups (Q1290688):

Displayed 44 items.

• Predicting missing links via local information (Q148014) ‎ (← links)
• Link prediction in multiplex networks (Q258449) ‎ (← links)
• Cauchy-Binet for pseudo-determinants (Q401214) ‎ (← links)
• The walk distances in graphs (Q427888) ‎ (← links)
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification (Q448318) ‎ (← links)
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances (Q628311) ‎ (← links)
• On the first passage time of a simple random walk on a tree (Q634583) ‎ (← links)
• The graph bottleneck identity (Q719327) ‎ (← links)
• Which digraphs with ring structure are essentially cyclic? (Q984026) ‎ (← links)
• Algebraic connectivity and doubly stochastic tree matrices (Q1002267) ‎ (← links)
• Measuring centrality by a generalization of degree (Q1642790) ‎ (← links)
• Further results on digraphs with completely real Laplacian spectra (Q1664250) ‎ (← links)
• Geometry of complex networks and topological centrality (Q1673137) ‎ (← links)
• Developments in the theory of randomized shortest paths with a comparison of graph node distances (Q1782487) ‎ (← links)
• Forest matrices around the Laplacian matrix (Q1855402) ‎ (← links)
• On the properties of von Neumann kernels for link analysis (Q1959638) ‎ (← links)
• Linear estimation in models based on a graph (Q1970440) ‎ (← links)
• Network diffusion with centrality measures to identify disease-related genes (Q1981320) ‎ (← links)
• Sparse randomized shortest paths routing with Tsallis divergence regularization (Q2036747) ‎ (← links)
• Integrating social influence modeling and user modeling for trust prediction in signed networks (Q2060752) ‎ (← links)
• Link prediction techniques, applications, and performance: a survey (Q2070200) ‎ (← links)
• A simple extension of the bag-of-paths model weighting path lengths by a Poisson distribution (Q2086590) ‎ (← links)
• Randomized shortest paths with net flows and capacity constraints (Q2127057) ‎ (← links)
• Metric and ultrametric inequalities for directed graphs (Q2127613) ‎ (← links)
• Loop-erased partitioning of a graph: mean-field analysis (Q2144347) ‎ (← links)
• A comprehensive comparison of network similarities for link prediction and spurious link elimination (Q2150388) ‎ (← links)
• A bag-of-paths framework for network data analysis (Q2181053) ‎ (← links)
• Algebraic connectivity and disjoint vertex subsets of graphs (Q2193366) ‎ (← links)
• Hierarchical centralities of information transmissions in reaching a consensus (Q2285175) ‎ (← links)
• Similarities on graphs: kernels versus proximity measures (Q2311350) ‎ (← links)
• Models of latent consensus (Q2362339) ‎ (← links)
• Invariants for weighted digraphs under one-sided state splittings (Q2375676) ‎ (← links)
• Commute times for a directed graph using an asymmetric Laplacian (Q2431186) ‎ (← links)
• A recursion formula for resistance distances and its applications (Q2444563) ‎ (← links)
• Spanning forests and the golden ratio (Q2476266) ‎ (← links)
• Doubly stochastic matrices of trees (Q2484618) ‎ (← links)
• A note on doubly stochastic graph matrices (Q2568396) ‎ (← links)
• Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices (Q2568982) ‎ (← links)
• Incremental Computation of Pseudo-Inverse of Laplacian (Q2942445) ‎ (← links)
• Vertex degrees and doubly stochastic graph matrices (Q3081308) ‎ (← links)
• (Q5150563) ‎ (← links)
• (Q5708561) ‎ (← links)
• (Q5708562) ‎ (← links)
• Drazin-inverse and heat capacity for driven random walkers on the ring (Q6072911) ‎ (← links)