Gaussian networks generated by random walks
From MaRDI portal
Abstract: We propose a random walks based model to generate complex networks. Many authors studied and developed different methods and tools to analyze complex networks by random walk processes. Just to cite a few, random walks have been adopted to perform community detection, exploration tasks and to study temporal networks. Moreover, they have been used also to generate scale-free networks. In this work, we define a random walker that plays the role of "edges-generator". In particular, the random walker generates new connections and uses these ones to visit each node of a network. As result, the proposed model allows to achieve networks provided with a Gaussian degree distribution, and moreover, some features as the clustering coefficient and the assortativity show a critical behavior. Finally, we performed numerical simulations to study the behavior and the properties of the cited model.
Recommendations
- Random-walk models of network formation and sequential Monte Carlo methods for graphs
- Generating random networks from a given distribution
- Random walks and diffusion on networks
- Growth model for fractal scale-free networks generated by a random walk
- Random graph generation using multiple switches of edges
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- Collective dynamics of `small-world' networks
- Emergence of Scaling in Random Networks
- Exploring complex networks
- First-passage properties of the Erdos–Renyi random graph
- On the Cover Time for Random Walks on Random Graphs
- Perception of similarity: a model for social network dynamics
- Random walk: A modern introduction
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
Cited in
(2)
This page was built for publication: Gaussian networks generated by random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2351789)
