DeepAI AI Chat
Log In Sign Up

Aggregate Graph Statistics

by   Giorgio Audrito, et al.
University of Bologna
Università di Torino

Collecting statistic from graph-based data is an increasingly studied topic in the data mining community. We argue that these statistics have great value as well in dynamic IoT contexts: they can support complex computational activities involving distributed coordination and provision of situation recognition. We show that the HyperANF algorithm for calculating the neighbourhood function of vertices of a graph naturally allows for a fully distributed and asynchronous implementation, thanks to a mapping to the field calculus, a distribution model proposed for collective adaptive systems. This mapping gives evidence that the field calculus framework is well-suited to accommodate massively parallel computations over graphs. Furthermore, it provides a new "self-stabilising" building block which can be used in aggregate computing in several contexts, there including improved leader election or network vulnerabilities detection.


page 1

page 2

page 3

page 4


Computation Against a Neighbour

Recent works in contexts like the Internet of Things (IoT) and large-sca...

Field-based Coordination with the Share Operator

Field-based coordination has been proposed as a model for coordinating c...

Time-Fluid Field-Based Coordination through Programmable Distributed Schedulers

Emerging application scenarios, such as cyber-physical systems (CPSs), t...

Engineering Resilient Collective Adaptive Systems by Self-Stabilisation

Collective adaptive systems are an emerging class of networked computati...

Maiter: An Asynchronous Graph Processing Framework for Delta-based Accumulative Iterative Computation

Myriad of graph-based algorithms in machine learning and data mining req...

Stability and Resilience of Distributed Information Spreading in Aggregate Computing

Spreading information through a network of devices is a core activity fo...

A Distributed Conductance Tester Without Global Information Collection

Given an undirected graph G and a conductance parameter α, the problem o...