scholarly journals Distributed computation in dynamic networks via random walks

2015 ◽  
Vol 581 ◽  
pp. 45-66 ◽  
Author(s):  
Atish Das Sarma ◽  
Anisur Rahaman Molla ◽  
Gopal Pandurangan
Keyword(s):  
Random Walks ◽  
Dynamic Networks ◽  
Distributed Computation

scholarly journals Fast Distributed Computation in Dynamic Networks via Random Walks

2012 ◽  
pp. 136-150 ◽  
Author(s):  
Atish Das Sarma ◽  
Anisur Rahaman Molla ◽  
Gopal Pandurangan
Keyword(s):  
Random Walks ◽  
Dynamic Networks ◽  
Distributed Computation

Mathematics of networks

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Random Walks ◽  
Adjacency Matrix ◽  
Graph Partitioning ◽  
Dynamic Networks ◽  
Graph Laplacian ◽  
Network Visualization ◽  
Final Part ◽  
Bipartite Networks ◽  
Component Structure ◽  
Basic Properties

An introduction to the mathematical tools used in the study of networks. Topics discussed include: the adjacency matrix; weighted, directed, acyclic, and bipartite networks; multilayer and dynamic networks; trees; planar networks. Some basic properties of networks are then discussed, including degrees, density and sparsity, paths on networks, component structure, and connectivity and cut sets. The final part of the chapter focuses on the graph Laplacian and its applications to network visualization, graph partitioning, the theory of random walks, and other problems.

Detection of local community structures in complex dynamic networks with random walks

2009 ◽  
Vol 3 (4) ◽  
pp. 266-278 ◽  
Author(s):  
G.S. Thakur ◽  
A.W.M. Dress ◽  
R. Tiwari ◽  
S.-S. Chen ◽  
M.T. Thai
Keyword(s):  
Random Walks ◽  
Local Community ◽  
Dynamic Networks ◽  
Community Structures ◽  
Complex Dynamic

scholarly journals Resource location based on precomputed partial random walks in dynamic networks

2016 ◽  
Vol 103 ◽  
pp. 165-180 ◽  
Author(s):  
Víctor M. López Millán ◽  
Vicent Cholvi ◽  
Antonio Fernández Anta ◽  
Luis López
Keyword(s):  
Random Walks ◽  
Dynamic Networks ◽  
Resource Location

Edge-attractor random walks on dynamic networks

2016 ◽  
pp. cnw009
Author(s):  
Giulio Iacobelli ◽  
Daniel Ratton Figueiredo
Keyword(s):  
Random Walks ◽  
Dynamic Networks

AN ADAPTIVE RANDOM WALK BASED DISTRIBUTED CLUSTERING ALGORITHM

2012 ◽  
Vol 23 (04) ◽  
pp. 803-830 ◽  
Author(s):  
ALAIN BUI ◽  
ABDURUSUL KUDIRETI ◽  
DEVAN SOHIER
Keyword(s):  
Random Walk ◽  
Random Walks ◽  
Adaptive Algorithm ◽  
Clustering Algorithm ◽  
Dynamic Networks ◽  
Maximum Size ◽  
Distributed Clustering ◽  
The Core ◽  
Topological Change ◽  
Bounded Size

In this paper, we present a fully distributed random walk based clustering algorithm intended to work on dynamic networks of arbitrary topologies. A bounded-size core is built through a random walks based procedure. Its neighboring nodes that do not belong to any cluster are recruited by the core as ordinary nodes. Using cores allow us to formulate constraints on the clustering and fulfill them on any topology. The correctness and termination of our algorithm are proven. We also prove that when two clusters are adjacent, at least one of them has a complete core (i.e. a core with the maximum size allowed by the parameter). One of the important advantages of our mobility-adaptive algorithm is that the re-clustering is local: the management of the connections or disconnections of links and reorganization of nodes affect only the clusters in which they are, possibly adjacent clusters, and at worst, the ordinary nodes of the clusters adjacent to the neighboring clusters. This allows us to bound the diameter of the portion of the network that is affected by a topological change.

Sign in / Sign up

Export Citation Format

Share Document