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