On the public citation graph
Estimating a smooth function on a large graph by Bayesian Laplacian regularisation
0 signed · 46 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11776420_7openalex-snapshot
Uniform Convergence of Adaptive Graph-Based Regularization
inferredcites →https://doi.org/10.1007/978-0-387-88146-1_9openalex-snapshot
Analysis of Network Flow Data
inferredcites →https://doi.org/10.1007/978-3-0348-8829-5_4openalex-snapshot
Small Deviation Probabilities of Sums of Independent Random Variables
inferredcites →https://doi.org/10.1007/978-3-540-27819-1_43openalex-snapshot
Regularization and Semi-supervised Learning on Large Graphs
inferredcites →https://doi.org/10.1007/978-3-540-45167-9_12openalex-snapshot
Kernels and Regularization on Graphs
inferredcites →https://doi.org/10.1007/bf01789463openalex-snapshot
Eigenvalues, diameter, and mean distance in graphs
inferredcites →https://doi.org/10.1007/s00440-013-0493-0openalex-snapshot
Thomas Bayes’ walk on manifolds
inferredcites →https://doi.org/10.1016/j.aam.2013.10.002openalex-snapshot
From quasirandom graphs to graph limits and graphlets
inferredcites →https://doi.org/10.1016/j.jctb.2006.05.002openalex-snapshot
Limits of dense graph sequences
inferredcites →https://doi.org/10.1016/s0169-7161(01)19019-xopenalex-snapshot
Gaussian processes: Inequalities, small ball probabilities and applications
inferredcites →https://doi.org/10.1038/30918openalex-snapshot
Collective dynamics of ‘small-world’ networks
inferredcites →https://doi.org/10.1038/msb4100129openalex-snapshot
Network‐based prediction of protein function
inferredcites →https://doi.org/10.1090/tran/7543openalex-snapshot
An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
inferredcites →https://doi.org/10.1109/icassp.2004.1326716openalex-snapshot
Tikhonov regularization and semi-supervised learning on large graphs
inferredcites →https://doi.org/10.1109/tip.2013.2294543openalex-snapshot
Image Interpolation via Graph-Based Bayesian Label Propagation
inferredcites →https://doi.org/10.1214/009053607000000613openalex-snapshot
Rates of contraction of posterior distributions based on Gaussian process priors
inferredcites →https://doi.org/10.1214/074921708000000156openalex-snapshot
Reproducing kernel Hilbert spaces of Gaussian priors
inferredcites →https://doi.org/10.1214/11-aos897openalex-snapshot
The sparse Laplacian shrinkage estimator for high-dimensional regression
inferredcites →https://doi.org/10.1214/13-ejs768openalex-snapshot
Semiparametric Bernstein–von Mises for the error standard deviation
inferredcites →https://doi.org/10.1214/14-aos1270openalex-snapshot
Frequentist coverage of adaptive nonparametric Bayesian credible sets
inferredcites →https://doi.org/10.1214/16-aos1469openalex-snapshot
Asymptotic behaviour of the empirical Bayes posteriors associated to maximum marginal likelihood estimator
inferredcites →https://doi.org/10.5860/choice.48-0921openalex-snapshot
An introduction to the theory of graph spectra
inferredcites →https://doi.org/10.7551/mitpress/3206.001.0001openalex-snapshot
Gaussian Processes for Machine Learning
inferredcites →https://doi.org/10.7551/mitpress/7503.003.0009openalex-snapshot
Learning on Graph with Laplacian Regularization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.acha.2021.11.005openalex-snapshot
Error analysis for denoising smooth modulo signals on a graph
inferred← citeshttps://doi.org/10.1016/j.acha.2022.02.004openalex-snapshot
Improved spectral convergence rates for graph Laplacians on ε-graphs and k-NN graphs
inferred← citeshttps://doi.org/10.1016/j.csda.2017.11.008openalex-snapshot
Nonparametric Bayesian label prediction on a graph
inferred← citeshttps://doi.org/10.1016/j.jmva.2021.104876openalex-snapshot
Optimal Bayesian smoothing of functional observations over a large graph
inferred← citeshttps://doi.org/10.1016/j.spasta.2019.01.003openalex-snapshot
Efficient Bayesian modeling of large lattice data using spectral properties of Laplacian matrix
inferred← citeshttps://doi.org/10.1080/03610918.2019.1634202openalex-snapshot
Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization
inferred← citeshttps://doi.org/10.1088/1361-6420/ac1e80openalex-snapshot
Posterior consistency of semi-supervised regression on graphs
inferred← citeshttps://doi.org/10.1093/imaiai/iaad034openalex-snapshot
Minimax optimal regression over Sobolev spaces via Laplacian Eigenmaps on neighbourhood graphs
inferred← citeshttps://doi.org/10.1111/sjos.12560openalex-snapshot
Interactions and computer experiments
inferred← citeshttps://doi.org/10.1111/sjos.12562openalex-snapshot
Bayesian nonparametric estimation in the current status continuous mark model
inferred← citeshttps://doi.org/10.1137/19m1245372openalex-snapshot
A Maximum Principle Argument for the Uniform Convergence of Graph Laplacian Regressors
inferred← citeshttps://doi.org/10.1137/20m1356610openalex-snapshot
Lipschitz Regularity of Graph Laplacians on Random Data Clouds
inferred← citeshttps://doi.org/10.1145/3617695.3617714openalex-snapshot
Research on Bayesian Network garbage classification based on multi-source information fusion
inferred← citeshttps://doi.org/10.1146/annurev-statistics-040522-115238openalex-snapshot
Manifold Learning: What, How, and Why
inferred← citeshttps://doi.org/10.1214/18-ejs1407openalex-snapshot
Minimax lower bounds for function estimation on graphs
inferred← citeshttps://doi.org/10.1214/19-aos1881openalex-snapshot
Asymptotic frequentist coverage properties of Bayesian credible sets for sieve priors
inferred← citeshttps://doi.org/10.1214/25-ejs2353openalex-snapshot
Road traffic estimation and distribution-based route selection
inferred← citeshttps://doi.org/10.1214/26-ss157openalex-snapshot
Bayesian inference in high-dimensional models
inferred← citeshttps://doi.org/10.48550/arxiv.1710.04772openalex-snapshot
Edge sampling using network local information
inferred← citeshttps://doi.org/10.48550/arxiv.1910.13476openalex-snapshot
Improved spectral convergence rates for graph Laplacians on epsilon-graphs and k-NN graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2008.11809openalex-snapshot
Unlabeled Data Help in Graph-Based Semi-Supervised Learning: A Bayesian Nonparametrics Perspective
inferred← citeshttps://doi.org/10.48550/arxiv.2111.07394openalex-snapshot
Minimax Optimal Regression over Sobolev Spaces via Laplacian Eigenmaps on Neighborhood Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.