Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. Micchelli, R. Willoughby (1979)
On functions which preserve the class of Stieltjes matricesLinear Algebra and its Applications, 23
L. Avena, A. Gaudilliere (2013)
On some random forests with determinantal rootsarXiv: Probability
G. Kirchhoff
Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wirdAnnalen der Physik, 148
Ben Morris, Y. Peres (2003)
Evolving sets, mixing and heat kernel boundsProbability Theory and Related Fields, 133
M. Vetterli, J. Kovacevic, Vivek Goyal (2014)
Foundations of Signal Processing
E. Scoppola (1993)
Renormalization group for Markov chains and application to metastabilityJournal of Statistical Physics, 73
B. Ricaud, P. Borgnat, Nicolas Tremblay, Paulo Gonçalves, P. Vandergheynst (2019)
Fourier could be a data scientist: From graph Fourier transform to signal processing on graphsComptes Rendus Physique
We begin the construction of Φ (cid:48) using Wilson’s algorithm starting from x .
L Avena (2018)
1975J. Theor. Probab., 31
L Avena (2020)
949Appl. Comput. Harmon. Anal., 48
Anton Bovier (2016)
Metastability: A Potential-Theoretic Approach
P. Diaconis, J. Fill (1990)
Strong Stationary Times Via a New Form of DualityAnnals of Probability, 18
R Andersen (2016)
1J. ACM, 63
L. Avena, A. Gaudilliere (2018)
Two Applications of Random Spanning ForestsJournal of Theoretical Probability, 31
(1984)
Random pertubations of dynamical systems
L. Miclo (2020)
On the construction of measure-valued dual processesElectronic Journal of Probability, 25
E. Olivieri, M. Vares (2005)
Large deviations and metastability
J. Propp, D. Wilson (1998)
How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed GraphJ. Algorithms, 27
D. Shuman, S. Narang, P. Frossard, Antonio Ortega, P. Vandergheynst (2012)
The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domainsIEEE Signal Processing Magazine, 30
D. Hammond, P. Vandergheynst, R. Gribonval (2009)
Wavelets on Graphs via Spectral Graph TheoryArXiv, abs/0912.3848
S. Mallat (1998)
A wavelet tour of signal processing
(1847)
Über die Auflösung der Gleichungen
(2009)
Wavelets on graphs via spectral graph theory: Applied and Computational Harmonic Analysis
What kind of subsampling should one use? What could “one every second node” mean?
(1981)
Markov functions, Ann
P. Carmona, F. Petit, M. Yor (1998)
Beta-gamma random variables and intertwining relations between certain Markov processesRevista Matematica Iberoamericana, 14
H. Matsumoto, M. Yor (2000)
An analogue of Pitman’s 2M – X theorem for exponential Wiener functionals: Part I: A time-inversion approachNagoya Mathematical Journal, 159
H. Matsumoto, M. Yor (2001)
An Analogue of Pitman’s 2M — X Theorem for Exponential Wiener Functionals Part II: The Role of the Generalized Inverse Gaussian LawsNagoya Mathematical Journal, 162
W. Murray, M. Aitchison (1997)
Where we go
Reid Andersen, S. Gharan, Y. Peres, L. Trevisan (2016)
Almost Optimal Local Graph Clustering Using Evolving SetsJournal of the ACM (JACM), 63
L. Miclo (2010)
On absorption times and Dirichlet eigenvaluesEsaim: Probability and Statistics, 14
(2015)
Random forests , Markov matrix spectra and well distributed points
L. Avena, F. Castell, A. Gaudilliere, Clothilde Mélot (2017)
Intertwining wavelets or Multiresolution analysis on graphs through random forestsArXiv, abs/1707.04616
D. Wilson (1996)
Generating random spanning trees more quickly than the cover time
L. Miclo, P. Patie (2019)
On intertwining relations between Ehrenfest, Yule and Ornstein-Uhlenbeck processesarXiv: Probability
C. Donati-Martin, Yan Doumerc, H. Matsumoto, M. Yor (2004)
Some Properties of the Wishart Processes and a Matrix Extension of the Hartman-Watson Laws †Publications of The Research Institute for Mathematical Sciences, 40
J. Warren (2005)
Dyson's Brownian motions, intertwining and interlacingElectronic Journal of Probability, 12
[For different reversible Markov kernels on finite state spaces, we look for families of probability measures for which the time evolution almost remains in their convex hull. Motivated by signal processing problems and metastability studies we are interested in the case when the size of such families is smaller than the size of the state space, and we want such distributions to be with “small overlap” among them. To this aim we introduce a squeezing function to measure the common overlap of such families, and we use random forests to build random approximate solutions of the associated intertwining equations for which we can bound from above the expected values of both squeezing and total variation errors. We also explain how to modify some of these approximate solutions into exact solutions by using those eigenvalues of the associated Laplacian with the largest size.]
Published: Nov 4, 2020
Keywords: Intertwining; Markov process; Finite networks; Multiresolution analysis; Metastability; Random spanning forests; 05C81; 15A15; 60J28
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.