Centrality measures based on current flow
From MaRDI portal
Recommendations
Cited in
(44)- Structural evaluation for distribution networks with distributed generation based on complex network
- Machine learning for graph-based representations of three-dimensional discrete fracture networks
- A new measure of identifying influential nodes: efficiency centrality
- A variant of the current flow betweenness centrality and its application in urban networks
- Sparse randomized shortest paths routing with Tsallis divergence regularization
- Centrality
- Learning centrality by learning to route
- On decay centrality
- Randomized shortest paths with net flows and capacity constraints
- Generalization of effective conductance centrality for egonetworks
- Polynomial-time algorithms for submodular Laplacian systems
- A centrality measure in dense networks based on two-way random walk betweenness
- A modified Myerson value for determining the centrality of graph vertices
- Resistance-distance betweenness: definition, properties, and application in complex linguistic networks
- Fast approximation of centrality
- Alpha current flow betweenness centrality
- Generalized network measures based on modulus of families of walks
- Analyzing complex networks through correlations in centrality measurements
- Routing betweenness centrality
- SOME CENTRALITY RESULTS NEW AND OLD
- Fast Approximation of Centrality
- Effective graph classification based on topological and label attributes
- Central Positions in Social Networks
- Betweenness centrality in Cartesian product of graphs
- Computing top-k closeness centrality faster in unweighted graphs
- Modified Myerson value for determining the centrality of graph vertices
- Subcubic equivalences between graph centrality problems, APSP and diameter
- Chapter 3. Centrality indices
- Chapter 4. Algorithms for centrality indices
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
- Disjoint multipath closeness centrality
- An Edge Centrality Measure Based on the Kemeny Constant
- Axiomatic characterization of PageRank
- Estimating current-flow closeness centrality with a multigrid Laplacian solver
- Ranking edges by their impact on the spectral complexity of information diffusion over networks
- Resistance distances in directed graphs: definitions, properties, and applications
- A survey on optimization studies of group centrality metrics
- Diffusion and targeting centrality
- Diagonal of pseudoinverse of graph Laplacian: fast estimation and exact results
- Leader-driven social network reconstruction
- Current flow centrality based link prediction in unipartite and bipartite complex networks
- Measuring the flow of information among cities using the diffusion power
- A measure for a balanced workload and its extremal values
- Centrality measure in graphs
This page was built for publication: Centrality measures based on current flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710705)
