A simple counting estimator of network agents' behaviors: Asymptotics. Marano, S. & Willett, P. In 2016 24th European Signal Processing Conference (EUSIPCO), pages 1523-1527, Aug, 2016.
A simple counting estimator of network agents' behaviors: Asymptotics [pdf]Paper  doi  abstract   bibtex   
Recent works address the problem of estimating agents' behaviors in complex networks, of which social networks are a prominent example. Many of the proposed techniques work but at the cost of a substantial computational complexity, which is not permitted when dealing with big data real-time analysis. This raises the question of whether a very simple nonparametric counting estimator works in practical problems. We propose such an estimator and investigate its asymptotic properties for large number of agents N and/or for large network observation time T. The asymptotic optimality of the estimator is proven and computer experiments are provided to assess its performance for finite values of N and T.
@InProceedings{7760503,
  author = {S. Marano and P. Willett},
  booktitle = {2016 24th European Signal Processing Conference (EUSIPCO)},
  title = {A simple counting estimator of network agents' behaviors: Asymptotics},
  year = {2016},
  pages = {1523-1527},
  abstract = {Recent works address the problem of estimating agents' behaviors in complex networks, of which social networks are a prominent example. Many of the proposed techniques work but at the cost of a substantial computational complexity, which is not permitted when dealing with big data real-time analysis. This raises the question of whether a very simple nonparametric counting estimator works in practical problems. We propose such an estimator and investigate its asymptotic properties for large number of agents N and/or for large network observation time T. The asymptotic optimality of the estimator is proven and computer experiments are provided to assess its performance for finite values of N and T.},
  keywords = {Big Data;complex networks;computational complexity;data analysis;network theory (graphs);social networking (online);network agent behaviors;agent behavior estimation;complex networks;social networks;substantial computational complexity;Big Data real-time analysis;asymptotic optimality;Computers;Random variables;Europe;Limiting;Electronic mail;Complex networks},
  doi = {10.1109/EUSIPCO.2016.7760503},
  issn = {2076-1465},
  month = {Aug},
  url = {https://www.eurasip.org/proceedings/eusipco/eusipco2016/papers/1570251534.pdf},
}
Downloads: 0