The concerted responses of eusocial insects to environmental stimuli are often referred to as
collective cognition at the level of the colony. To achieve collective cognition, a group can …

Motivated by real world networks and use of algorithms based on random walks on these
networks we study the simple random walks on dynamic undirected graphs with fixed …

A complex network can be modeled as a graph representing the “who knows who”
relationship. In the context of graph theory for social networks, the notion of centrality is used …

We use distributed computing tools to provide a new perspective on the behavior of
cooperative biological ensembles. We introduce the Ants Nearby Treasure Search (ANTS) …

A graph embedding is a representation of graph vertices in a low-dimensional space, which
approximately preserves properties such as distances between nodes. Vertex sequence …

A graph-based system to simulate the movements and interactions of multiple random
walkers (MRW) is proposed in this work. In the MRW system, multiple agents traverse a …

We study properties of multiple random walks on a graph under various assumptions of
interaction between the particles. To give precise results, we make the analysis for random …

We present a randomized distributed algorithm that computes a minimum spanning tree in τ
(G)· 2O (√(log n log log n))) rounds, in any n-node graph G with mixing time τ (G). This result …

The study of motifs can help researchers uncover links between the structure and function of
networks in biology, sociology, economics, and many other areas. Empirical studies of …

Abstract We study Plurality Consensus in the Model over a network of n anonymous agents.
Each agent supports an initial opinion or color. We assume that at the onset, the number of …