Next Article in Journal
Efficient Data Structures for Range Shortest Unique Substring Queries
Next Article in Special Issue
Spectrum-Adapted Polynomial Approximation for Matrix Functions with Applications in Graph Signal Processing
Previous Article in Journal
Short-Term Firm-Level Energy-Consumption Forecasting for Energy-Intensive Manufacturing: A Comparison of Machine Learning and Deep Learning Models
Previous Article in Special Issue
Online Topology Inference from Streaming Stationary Graph Signals with Partial Connectivity Information
Open AccessArticle

Spikyball Sampling: Exploring Large Networks via an Inhomogeneous Filtered Diffusion

LTS2, EPFL, Station 11, CH-1015 Lausanne, Switzerland
*
Author to whom correspondence should be addressed.
Algorithms 2020, 13(11), 275; https://doi.org/10.3390/a13110275
Received: 13 August 2020 / Revised: 22 October 2020 / Accepted: 27 October 2020 / Published: 30 October 2020
(This article belongs to the Special Issue Efficient Graph Algorithms in Machine Learning)
Studying real-world networks such as social networks or web networks is a challenge. These networks often combine a complex, highly connected structure together with a large size. We propose a new approach for large scale networks that is able to automatically sample user-defined relevant parts of a network. Starting from a few selected places in the network and a reduced set of expansion rules, the method adopts a filtered breadth-first search approach, that expands through edges and nodes matching these properties. Moreover, the expansion is performed over a random subset of neighbors at each step to mitigate further the overwhelming number of connections that may exist in large graphs. This carries the image of a “spiky” expansion. We show that this approach generalize previous exploration sampling methods, such as Snowball or Forest Fire and extend them. We demonstrate its ability to capture groups of nodes with high interactions while discarding weakly connected nodes that are often numerous in social networks and may hide important structures. View Full-Text
Keywords: networks; data over networks; snowball sampling; large scale networks; data over networks; snowball sampling; large scale
Show Figures

Figure 1

MDPI and ACS Style

Ricaud, B.; Aspert, N.; Miz, V. Spikyball Sampling: Exploring Large Networks via an Inhomogeneous Filtered Diffusion. Algorithms 2020, 13, 275. https://doi.org/10.3390/a13110275

AMA Style

Ricaud B, Aspert N, Miz V. Spikyball Sampling: Exploring Large Networks via an Inhomogeneous Filtered Diffusion. Algorithms. 2020; 13(11):275. https://doi.org/10.3390/a13110275

Chicago/Turabian Style

Ricaud, Benjamin; Aspert, Nicolas; Miz, Volodymyr. 2020. "Spikyball Sampling: Exploring Large Networks via an Inhomogeneous Filtered Diffusion" Algorithms 13, no. 11: 275. https://doi.org/10.3390/a13110275

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop