Online estimating the k central nodes of a network (original) (raw)

Estimation of vertex degrees in a sampled network

Apratim Ganguly

2017 51st Asilomar Conference on Signals, Systems, and Computers, 2017

View PDFchevron_right

Identification of top-K nodes in large networks using Katz centrality

Sweta Gurung

Journal of Big Data, 2017

View PDFchevron_right

Heuristical top-k: fast estimation of centralities in complex networks

Erwan le merrer

Information Processing Letters, 2014

View PDFchevron_right

Online sampling of high centrality individuals in social networks

Tanya Berger-Wolf

2010

View PDFchevron_right

M-Centrality: identifying key nodes based on global position and local degree variation

Hocine Cherifi

Journal of Statistical Mechanics: Theory and Experiment, 2018

View PDFchevron_right

Network Sampling: Methods and Applications

Mohammad Al Hasan

View PDFchevron_right

Resampling-Based Gap Analysis for Detecting Nodes with High Centrality on Large Social Network

Hiroshi Motoda

Lecture Notes in Computer Science, 2015

View PDFchevron_right

Estimating the Degree Centrality Ranking of a Node

Vaibhav Malik

ArXiv, 2015

View PDFchevron_right

Identifying Central Nodes in Directed and Weighted Networks

sharanjit Kaur

International Journal of Advanced Computer Science and Applications

View PDFchevron_right

Information Gain Model for Efficient Influential Node Identification in Social Networks

Kaushik Dutta

2019 Amity International Conference on Artificial Intelligence (AICAI), 2019

View PDFchevron_right

Improving detection of influential nodes in complex networks

Arman Shokrollahi, Mohammad Nematbakhsh

Physica A: Statistical Mechanics and its Applications, 2015

View PDFchevron_right

Betweenness Centrality Estimation via Sampling

Athanasios Agrafiotis

View PDFchevron_right

Top-K Nodes Identification in Big Networks Based on Topology and Activity Analysis

Sweta Gurung

2016

View PDFchevron_right

A branching process approach to the identification of influential nodes in complex networks

Ailbhe Cassidy

2019

View PDFchevron_right

A Survey on Recent Methods of Finding Influential Nodes in Complex Networks

Murali Enduri, Koduru Hajarathaiah, WARSE The World Academy of Research in Science and Engineering

International Journal of Advanced Trends in Computer Science and Engineering, 2021

View PDFchevron_right

Network Sampling via Edge-based Node Selection with Graph Induction

Nesreen Ahmed

2011

View PDFchevron_right

Influential Nodes Identification in Complex Networks via Information Entropy

Mustapha Machkour

Entropy, 2020

View PDFchevron_right

Statistics for Re-identification in Network Models

Kobi Abayomi

2012

View PDFchevron_right

Influential nodes identification in complex networks: a comprehensive literature review

Mustapha Machkour

Beni-Suef University Journal of Basic and Applied Sciences, 2023

View PDFchevron_right

Integrating local and global information to identify influential nodes in complex networks

Siti Haryanti Hairol Anuar

Scientific Reports

View PDFchevron_right

The risk of node re-identification in labeled social graphs

John Skvoretz

Applied Network Science

View PDFchevron_right

Rank Degree: An Efficient Algorithm for Graph Sampling. ASONAM 2016 IEEE/ACM (Acceptance rate: 13,6%)

Elli Voudigari, Theodore Papageorgiou, Nikos Salamanos, Emmanuel J Yannakoudakis

View PDFchevron_right

A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood

毅 肖

Artificial intelligence review, 2024

View PDFchevron_right

A New Estimation Method for Calculation of Betweenness Centrality in Large Graphs

ijcswn Publication, Narges Gol

View PDFchevron_right

Unbiased sampling of network ensembles

Tiziano Squartini

New Journal of Physics, 2015

View PDFchevron_right

A graph exploration method for identifying influential spreaders in complex networks

elli voudigari

Applied Network Science

View PDFchevron_right

Identifying Influential Spreaders by Graph Sampling

Elli Voudigari, Nikos Salamanos, Emmanuel J Yannakoudakis

Salamanos N, Voudigari E, Yannakoudakis EJ (2016) Identifying influential spreaders by graph sampling. In: Proceedings of the 5th International Workshop on Complex Networks and their Applications, Milan, Italy, November 30 - December 02, 2016

View PDFchevron_right

K-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases.” Nov. 2005. [Online]. Available: http://arxiv.org/abs/cs/0511007

JOSE IGNACIO ALVAREZ HAMELIN

2015

View PDFchevron_right

Most Powerful Node Identification in Complex Network Using A Multiperspective Approach

Auwal T I J J A N I Amshi

2019 IEEE 5th International Conference on Computer and Communications (ICCC) , 2019

View PDFchevron_right

Sampling networks by nodal attributes

Janos Kertesz

Physical review, 2019

View PDFchevron_right

Betweenness Ordering Problem : An Efficient Non-Uniform Sampling Technique for Large Graphs

DR.SHUBHAM CHAUDHARY

2014

View PDFchevron_right

Tail-scope: Using friends to estimate heavy tails of degree distributions in large-scale complex networks

Hang-Hyun Jo

View PDFchevron_right

Social network sampling using spanning trees

Alireza Rezvanian

International Journal of Modern Physics C, 2016

View PDFchevron_right

Estimation of spanning tree mean-edge using node sampling

Narendra Thakur

Model Assisted Statistics and …, 2009

View PDFchevron_right

Influential Node Ranking in Complex Information Networks Using A Randomized Dynamics-Sensitive Approach

Hamid Khayyam

arXiv (Cornell University), 2021

View PDFchevron_right