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. 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
{"_id":"ZjCnN47uBT92cBx92","bibbaseid":"marano-willett-asimplecountingestimatorofnetworkagentsbehaviorsasymptotics-2016","authorIDs":[],"author_short":["Marano, S.","Willett, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["S."],"propositions":[],"lastnames":["Marano"],"suffixes":[]},{"firstnames":["P."],"propositions":[],"lastnames":["Willett"],"suffixes":[]}],"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","bibtex":"@InProceedings{7760503,\n author = {S. Marano and P. Willett},\n booktitle = {2016 24th European Signal Processing Conference (EUSIPCO)},\n title = {A simple counting estimator of network agents' behaviors: Asymptotics},\n year = {2016},\n pages = {1523-1527},\n 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.},\n 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},\n doi = {10.1109/EUSIPCO.2016.7760503},\n issn = {2076-1465},\n month = {Aug},\n url = {https://www.eurasip.org/proceedings/eusipco/eusipco2016/papers/1570251534.pdf},\n}\n\n","author_short":["Marano, S.","Willett, P."],"key":"7760503","id":"7760503","bibbaseid":"marano-willett-asimplecountingestimatorofnetworkagentsbehaviorsasymptotics-2016","role":"author","urls":{"Paper":"https://www.eurasip.org/proceedings/eusipco/eusipco2016/papers/1570251534.pdf"},"keyword":["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"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/Roznn/EUSIPCO/main/eusipco2016url.bib","creationDate":"2021-02-13T17:31:52.111Z","downloads":0,"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"],"search_terms":["simple","counting","estimator","network","agents","behaviors","asymptotics","marano","willett"],"title":"A simple counting estimator of network agents' behaviors: Asymptotics","year":2016,"dataSources":["koSYCfyY2oQJhf2Tc","JiQJrC76kvCnC3mZd"]}