The matrix-forest theorem and measuring relations in small social groups
From MaRDI portal
Publication:1290688
zbMath0920.92042MaRDI QIDQ1290688
E. V. Shamis, Pavel Yu. Chebotarev
Publication date: 4 July 1999
Published in: Automation and Remote Control (Search for Journal in Brave)
Applications of statistics to social sciences (62P25) Applications of graph theory (05C90) Distance in graphs (05C12) Mathematical sociology (including anthropology) (91D99)
Related Items
Models of latent consensus ⋮ Randomized shortest paths with net flows and capacity constraints ⋮ Metric and ultrametric inequalities for directed graphs ⋮ Invariants for weighted digraphs under one-sided state splittings ⋮ Loop-erased partitioning of a graph: mean-field analysis ⋮ Measuring centrality by a generalization of degree ⋮ A comprehensive comparison of network similarities for link prediction and spurious link elimination ⋮ Further results on digraphs with completely real Laplacian spectra ⋮ Geometry of complex networks and topological centrality ⋮ Incremental Computation of Pseudo-Inverse of Laplacian ⋮ A bag-of-paths framework for network data analysis ⋮ Cauchy-Binet for pseudo-determinants ⋮ Drazin-inverse and heat capacity for driven random walkers on the ring ⋮ Algebraic connectivity and disjoint vertex subsets of graphs ⋮ A class of graph-geodetic distances generalizing the shortest-path and the resistance distances ⋮ The walk distances in graphs ⋮ Commute times for a directed graph using an asymmetric Laplacian ⋮ On the first passage time of a simple random walk on a tree ⋮ An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification ⋮ On the properties of von Neumann kernels for link analysis ⋮ A recursion formula for resistance distances and its applications ⋮ Linear estimation in models based on a graph ⋮ Network diffusion with centrality measures to identify disease-related genes ⋮ Spanning forests and the golden ratio ⋮ Doubly stochastic matrices of trees ⋮ Which digraphs with ring structure are essentially cyclic? ⋮ The graph bottleneck identity ⋮ Developments in the theory of randomized shortest paths with a comparison of graph node distances ⋮ Hierarchical centralities of information transmissions in reaching a consensus ⋮ Sparse randomized shortest paths routing with Tsallis divergence regularization ⋮ Algebraic connectivity and doubly stochastic tree matrices ⋮ Predicting missing links via local information ⋮ Vertex degrees and doubly stochastic graph matrices ⋮ Integrating social influence modeling and user modeling for trust prediction in signed networks ⋮ Similarities on graphs: kernels versus proximity measures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Link prediction techniques, applications, and performance: a survey ⋮ Unnamed Item ⋮ A note on doubly stochastic graph matrices ⋮ A simple extension of the bag-of-paths model weighting path lengths by a Poisson distribution ⋮ Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices ⋮ Forest matrices around the Laplacian matrix ⋮ Link prediction in multiplex networks
