Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2024
Distributed Pseudo-Likelihood Method for Community Detection in Large-Scale Networks
ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 18, Issue 7Article No.: 181, Pages 1–25https://doi.org/10.1145/3657300This paper proposes a distributed pseudo-likelihood method (DPL) to conveniently identify the community structure of large-scale networks. Specifically, we first propose a block-wise splitting method to divide large-scale network data into several ...
- research-articleJuly 2022
Multi-threadaed unbalanced power flow of large-scale networks with advanced bus classification
Computers and Electrical Engineering (CENG), Volume 101, Issue Chttps://doi.org/10.1016/j.compeleceng.2022.108134Highlights- Power flow calculation of large-scale networks has been changed due to the incorporation of electronically coupled energy resources.
The multi-threaded implementations of the power flow calculation procedures became more and more popular as they decreased calculation speeds. The multi-threaded power flow calculation with the integration of the control strategies of ...
Graphical Abstract.
Display Omitted
- research-articleOctober 2020
Fast Attributed Multiplex Heterogeneous Network Embedding
CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge ManagementPages 995–1004https://doi.org/10.1145/3340531.3411944In recent years, heterogeneous network representation learning has attracted considerable attentions with the consideration of multiple node types. However, most of them ignore the rich set of network attributes (attributed network) and different types ...
- surveyApril 2020
A Critical Survey of the Multilevel Method in Complex Networks
- Alan Valejo,
- Vinícius Ferreira,
- Renato Fabbri,
- Maria Cristina Ferreira de Oliveira,
- Alneu de Andrade Lopes
ACM Computing Surveys (CSUR), Volume 53, Issue 2Article No.: 39, Pages 1–35https://doi.org/10.1145/3379347Multilevel optimization aims at reducing the cost of executing a target network-based algorithm by exploiting coarsened, i.e., reduced or simplified, versions of the network. There is a growing interest in multilevel algorithms in networked systems, ...
- research-articleJanuary 2020
Scaling density-based community detection to large-scale social networks via MapReduce framework
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology (JIFS), Volume 38, Issue 2Pages 1663–1674https://doi.org/10.3233/JIFS-182765Community detection from networks is one of the long standing and challenging tasks in the field of complex network research. Detection of communities poses numerous challenges in terms of their overlapping and hierarchical nature, dynamics of networks ...
-
- research-articleFebruary 2018
FACH: Fast Algorithm for Detecting Cohesive Hierarchies of Communities in Large Networks
WSDM '18: Proceedings of the Eleventh ACM International Conference on Web Search and Data MiningPages 486–494https://doi.org/10.1145/3159652.3159704Vertices in a real-world social network can be grouped into densely connected communities that are sparsely connected to other groups. Moreover, these communities can be partitioned into successively more cohesive communities. Despite an ever-growing ...
- invited-talkJune 2017
Delay Scalings and Mean-Field Limits in Networked Systems
SIGMETRICS '17 Abstracts: Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer SystemsPage 1https://doi.org/10.1145/3078505.3080572Load balancing mechanisms and scheduling algorithms play a critical role in achieving efficient server utilization and providing robust delay performance in a wide range of networked systems. We will review some celebrated schemes and optimality results ...
Also Published in:
ACM SIGMETRICS Performance Evaluation Review: Volume 45 Issue 1 - articleJanuary 2017
Convergence analysis of distributed inference with vector-valued Gaussian belief propagation
This paper considers inference over distributed linear Gaussian models using factor graphs and Gaussian belief propagation (BP). The distributed inference algorithm involves only local computation of the information matrix and of the mean vector, and ...
- articleJanuary 2016
Metric tree-like structures in real-world networks: an empirical study
Based on solid theoretical foundations, we present strong evidence that a number of real-world networks, taken from different domains such as Internet measurements, biological data, web graphs, and social and collaboration networks exhibit tree-like ...
- research-articleSeptember 2015
Distributed multi‐object localisation by consensus on compressive sampling received signal strength fingerprints
IET Communications (CMU2), Volume 9, Issue 14Pages 1738–1745https://doi.org/10.1049/iet-com.2014.1155Recent growing interest for location‐based services has created a demand on object localisation approaches with low cost and high accuracy. In this study, the problem of distributed multi‐object localisation using fingerprints of received signal strength ...
- research-articleJanuary 2014
Counting Triangles in Massive Graphs with MapReduce
SIAM Journal on Scientific Computing (SISC), Volume 36, Issue 5Pages S48–S77https://doi.org/10.1137/13090729XGraphs and networks are used to model interactions in a variety of contexts. There is a growing need to quickly assess the characteristics of a graph in order to understand its underlying structure. Some of the most useful metrics are triangle-based and give ...
- research-articleNovember 2013
Channel reservation protocol for over-subscribed channels and destinations
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and AnalysisArticle No.: 52, Pages 1–12https://doi.org/10.1145/2503210.2503213Channels in system-wide networks tend to be over-subscribed due to the cost of bandwidth and increasing traffic demands. To make matters worse, workloads can overstress specific destinations, creating hotspots. Lossless networks offer attractive ...
- ArticleNovember 2012
Rich-Club Connectivity in Large-Scale Complex Networks
CGC '12: Proceedings of the 2012 Second International Conference on Cloud and Green ComputingPages 730–735https://doi.org/10.1109/CGC.2012.103In the real-world network, i.e., Internet, the nodes with high degrees are found closely connected with each other, which is stated as the rich-club connectivity. Obtaining the rich club connectivity is an easy job for small graphs. However, with the ...
- ArticleSeptember 2011
A Modeling Framework for Gossip-based Information Spread
QEST '11: Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTemsPages 245–254https://doi.org/10.1109/QEST.2011.39We present an analytical framework for gossip protocols based on the pair wise information exchange between interacting nodes. This framework allows for studying the impact of protocol parameters on the performance of the protocol. Previously, gossip-...
- ArticleJuly 2011
Parallel Evolutionary P2P Networking for Realizing Adaptive Large-Scale Networks
SAINT '11: Proceedings of the 2011 IEEE/IPSJ International Symposium on Applications and the InternetPages 532–537https://doi.org/10.1109/SAINT.2011.98The present paper proposes a parallel evolutionary P2P networking technique (P-EP2P) that applies an evolutionary networking technique (EP2P) in parallel to small networks into which an entire P2P network is divided. EP2P dynamically and adaptively ...
- ArticleJune 2011
ECOFEN: An End-to-end energy Cost mOdel and simulator For Evaluating power consumption in large-scale Networks
WOWMOM '11: Proceedings of the 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia NetworksPages 1–6https://doi.org/10.1109/WoWMoM.2011.5986203Wired networks are increasing in size and their power consumption is becoming a matter of concern. Evaluating the end-to-end electrical cost of new network architectures and protocols is difficult due to the lack of monitored realistic infrastructures. ...
- research-articleNovember 2010
Software and Hardware Techniques for Power-Efficient HPC Networking
Computing in Science and Engineering (IEEECS_CISE-NEW), Volume 12, Issue 6Pages 30–37https://doi.org/10.1109/MCSE.2010.96Although most large-scale systems are designed with the network as a central component, the interconnection network's energy consumption has received little attention. However, several software and hardware approaches can increase the interconnection ...
- research-articleMay 2010
Higher dimensional consensus: learning in large-scale networks
IEEE Transactions on Signal Processing (TSP), Volume 58, Issue 5Pages 2836–2849https://doi.org/10.1109/TSP.2010.2042482The paper considers higher dimensional consensus (HDC). HDC is a general class of linear distributed algorithms for large-scale networks that generalizes average-consensus and includes other interesting distributed algorithms, like sensor localization, ...
- articleMay 2008
A GA-based QoS multicast routing algorithm for large-scale networks
International Journal of High Performance Computing and Networking (IJHPCN), Volume 5, Issue 5/6Pages 381–387https://doi.org/10.1504/IJHPCN.2008.025557For multimedia applications, the routing algorithms should consider many Quality of Service (QoS) parameters. However, to find routes with two or more QoS parameters is an NP-hard problem. Therefore, recently many researchers are trying to use heuristic ...
- posterApril 2008
A framework for fast community extraction of large-scale networks
WWW '08: Proceedings of the 17th international conference on World Wide WebPages 1215–1216https://doi.org/10.1145/1367497.1367733Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modification proposed by Danon, Diaz and Arenas (DDA) obtains better modularity among ...