Searcharxiv⌕ Search

arXiv subjects

Clothilde Mélot

Publications and source records attributed to Clothilde Mélot.

3 recordsLinked to original sources

Spectrum Estimation through Kirchhoff Random Forests

Given a non-oriented edge-weighted graph, we show how to make some estimation of the associated Laplacian eigenvalues through Monte Carlo evaluation of spectral quantities computed along Kirchhoff random rooted spanning forest trajectories. The sampling cost of this estimation is only linear in the node number, up to a logarithmic factor. By associating a double cover of such a graph with any symmetric real matrix, we can then perform spectral estimation in the same way for the latter.

math.PR↗

Intertwining wavelets or Multiresolution analysis on graphs through random forests

We propose a new method for performing multiscale analysis of functions defined on the vertices of a finite connected weighted graph. Our approach relies on a random spanning forest to downsample the set of vertices, and on approximate solutions of Markov intertwining relation to provide a subgraph structure and a filter bank leading to a wavelet basis of the set of functions. Our construction involves two parameters q and q'. The first one controls the mean number of kept vertices in the downsampling, while the second one is a tuning parameter between space localization and frequency localization. We provide an explicit reconstruction formula, bounds on the reconstruction operator norm and on the error in the intertwining relation, and a Jackson-like inequality. These bounds lead to recommend a way to choose the parameters q and q'. We illustrate the method by numerical experiments.

cs.IT↗

Exponential moments of self-intersection local times of stable random walks in subcritical dimensions

Let $(X_t, t \geq 0)$ be an $α$-stable random walk with values in $\Z^d$. Let $l_t(x) = \int_0^t δ_x(X_s) ds$ be its local time. For $p>1$, not necessarily integer, $I_t = \sum_x l_t^p(x)$ is the so-called $p$-fold self- intersection local time of the random walk. When $p(d -α) < d$, we derive precise logarithmic asymptotics of the probability $P(I_t \geq r_t)$ for all scales $r_t \gg \E(I_t)$. Our result extends previous works by Chen, Li and Rosen 2005, Becker and König 2010, and Laurent 2012.

math.PR↗