Co-clustering directed graphs to discover asymmetries and directional communities
From MaRDI portal
Publication:4646235
DOI10.1073/pnas.1525793113zbMath1406.91306OpenAlexW2536263232WikidataQ30828887 ScholiaQ30828887MaRDI QIDQ4646235
Publication date: 11 January 2019
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.1525793113
Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (16)
Networks beyond pairwise interactions: structure and dynamics ⋮ Discovering political topics in facebook discussion threads with graph contextualization ⋮ Identifiability and parameter estimation of the overlapped stochastic co-block model ⋮ SONIC: social network analysis with influencers and communities ⋮ A distributed community detection algorithm for large scale networks under stochastic block models ⋮ Lead-lag detection and network clustering for multivariate time series with an application to the us equity market ⋮ Community network auto-regression for high-dimensional time series ⋮ Directed Community Detection With Network Embedding ⋮ Unnamed Item ⋮ Bipartite network influence analysis of a two-mode network ⋮ Estimating mixed-memberships using the symmetric Laplacian inverse matrix ⋮ Statistical embedding: beyond principal components ⋮ Bayesian estimation of the latent dimension and communities in stochastic blockmodels ⋮ Core–periphery structure in directed networks ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Co-clustering directed graphs to discover asymmetries and directional communities
