B
Boleslaw K. Szymanski
Researcher at Rensselaer Polytechnic Institute
Publications - 549
Citations - 14952
Boleslaw K. Szymanski is an academic researcher from Rensselaer Polytechnic Institute. The author has contributed to research in topics: Wireless sensor network & Routing protocol. The author has an hindex of 55, co-authored 537 publications receiving 13828 citations. Previous affiliations of Boleslaw K. Szymanski include Wrocław University of Technology & University of Pennsylvania.
Papers
More filters
Journal ArticleDOI
Overlapping community detection in networks: The state-of-the-art and comparative study
TL;DR: A framework is proposed for evaluating algorithms' ability to detect overlapping nodes, which helps to assess overdetection and underdetection, and for low overlapping density networks, SLPA, OSLOM, Game, and COPRA offer better performance than the other tested algorithms.
Proceedings ArticleDOI
SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process
TL;DR: A novel, general framework to detect and analyze both individual overlapping nodes and entire communities, in which nodes exchange labels according to dynamic interaction rules is presented.
Journal ArticleDOI
Social consensus through the influence of committed minorities.
Jierui Xie,Sameet Sreenivasan,Gyorgy Korniss,Weituo Zhang,Chjan C. Lim,Boleslaw K. Szymanski +5 more
TL;DR: It is shown how the prevailing majority opinion in a population can be rapidly reversed by a small fraction p of randomly distributed committed agents who consistently proselytize the opposing opinion and are immune to influence.
Book ChapterDOI
Towards linear time overlapping community detection in social networks
Jierui Xie,Boleslaw K. Szymanski +1 more
TL;DR: A fast algorithm, called SLPA, for overlapping community detection in large-scale networks, which can be applied to both unipartite and bipartite networks and is able to uncover overlapping nested hierarchy.
Proceedings ArticleDOI
In-Network Outlier Detection in Wireless Sensor Networks
TL;DR: This work develops an algorithm that is flexible with respect to the outlier definition, works in-network with a communication load proportional to the outcome, and reveals its outcome to all sensors.