Estimating Fiedler value on large networks based on random walk observations - Archive ouverte HAL Access content directly
Conference Papers Year :

Estimating Fiedler value on large networks based on random walk observations

(1, 2) , (3, 4) , (5)
1
2
3
4
5

Abstract

In this paper, we describe an iterative scheme which is able to estimate the Fiedler value of a network when the topology is initially unknown. The only available information is the one obtained through a random walk process over the network. Our algorithm is based on the Rayleigh quotient optimization problem and the theory of stochastic approximation. We explain the different tools used to construct our algorithm and we describe our iterative scheme. Finally, we illustrate its performance through a numerical study. Index Terms Fiedler value, stochastic approximation, random walk based observations.
Fichier principal
Vignette du fichier
Tracking_algebraic_connectivity_of_a_dynamic_graph.pdf (278.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02974433 , version 1 (21-10-2020)

Identifiers

Cite

Alexandre Reiffers-Masson, Thierry Chonavel, Yezekael Hayel. Estimating Fiedler value on large networks based on random walk observations. ICASSP 2021: IEEE International Conference on Acoustics, Speech and Signal Processing, Jun 2021, Toronto, Canada. ⟨10.1109/ICASSP39728.2021.9413713⟩. ⟨hal-02974433⟩
79 View
401 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More