The Fiedler vector of a graph is the eigenvector corresponding to the smallest non-trivial
eigenvalue of the graph's Laplacian matrix. The entries of the Fiedler vector are known to …

This article explained how nodes in a network graph can infer information about the network
topology or its topology related properties, based on in-network distributed learning, ie …

Performing random walks in networks is a fundamental primitive that has found applications
in many areas of computer science, including distributed computing. In this article, we focus …

We consider the problem of self-healing in reconfigurable networks (eg peer-to-peer and
wireless mesh networks) that are under repeated attack by an omniscient adversary and …

We study a fundamental question that arises in social recommender systems: whether it is
possible to simultaneously maximize: 1) an individual's benefit from using a social network …

The paper investigates efficient distributed computation in dynamic networks in which the
network topology changes (arbitrarily) from round to round. Random walks are a …

We focus on the problem of performing random walks efficiently in a distributed network.
Given bandwidth constraints, the goal is to minimize the number of rounds required to obtain …

Performing random walks in networks is a fundamental primitive that has found numerous
applications in communication networks such as token management, load balancing …

In this paper, we design a distributed mechanism that is able to create a social convention
within a large convention space for multiagent systems (MAS) operating on various …

A method includes obtaining a matrix defining a topology of a multi-hop network, where the
topology identifies nodes and links between the nodes in the multi-hop network. The method …