Jeffrey S. Rosenthal

Orcid: 0000-0002-5118-6808

Affiliations:
  • University of Toronto, Department of Statistics, Canada


According to our database1, Jeffrey S. Rosenthal authored at least 31 papers between 1993 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Optimization via Rejection-Free Partial Neighbor Search.
Stat. Comput., December, 2023

Introducing a New High-Resolution Handwritten Digits Data Set with Writer Characteristics.
SN Comput. Sci., 2023

2022
Convergence rate bounds for iterative random functions using one-shot coupling.
Stat. Comput., 2022

Skew brownian motion and complexity of the alps algorithm.
J. Appl. Probab., 2022

Distinguishing luck from skill through statistical simulation: a case study.
Commun. Stat. Simul. Comput., 2022

2021
Jump Markov chains and rejection-free Metropolis algorithms.
Comput. Stat., 2021

2020
Weight-preserving simulated tempering.
Stat. Comput., 2020

BEST: a decision tree algorithm that handles missing values.
Comput. Stat., 2020

Analysis of a high-resolution hand-written digits data set with writer characteristics.
CoRR, 2020

An evaluation of machine learning techniques to predict the outcome of children treated for Hodgkin-Lymphoma on the AHOD0031 trial.
Appl. Artif. Intell., 2020

2018
Stochastic simulation of sequential game-theory voting models.
Commun. Stat. Simul. Comput., 2018

A Deep Latent-Variable Model Application to Select Treatment Intensity in Survival Analysis.
CoRR, 2018

Handling Missing Values using Decision Trees with Branch-Exclusive Splits.
CoRR, 2018

Predicting University Students' Academic Success and Choice of Major using Random Forests.
CoRR, 2018

2017
Automatically tuned general-purpose MCMC via new adaptive diagnostics.
Comput. Stat., 2017

2016
Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits.
J. Appl. Probab., 2016

2014
The Containment Condition and Adapfail Algorithms.
J. Appl. Probab., 2014

2012
Decrypting classical cipher text using Markov chain Monte Carlo.
Stat. Comput., 2012

2011
Towards optimal scaling of metropolis-coupled Markov chain Monte Carlo.
Stat. Comput., 2011

2007
AMCMC: An R interface for adaptive MCMC.
Comput. Stat. Data Anal., 2007

2005
Link analysis ranking: algorithms, theory, and experiments.
ACM Trans. Internet Techn., 2005

2004
Achieving limiting distributions for Markov chains using back buttons.
Stat. Comput., 2004

2003
A case study in the meta-reasoning procedure ND.
J. Exp. Theor. Artif. Intell., 2003

2002
Introduction to mathematical systems theory. a behavioral approach [Book Review].
IEEE Trans. Autom. Control., 2002

2001
Finding authorities and hubs from link structures on the World Wide Web.
Proceedings of the Tenth International World Wide Web Conference, 2001

2000
Efficient use of exact samples.
Stat. Comput., 2000

Extension of Fill's perfect rejection sampling algorithm to general chains.
Random Struct. Algorithms, 2000

1998
A simulation approach to convergence rates for Markov chain Monte Carlo algorithms.
Stat. Comput., 1998

1996
Analysis of the Gibbs sampler for a model related to James-Stein estimators.
Stat. Comput., 1996

1995
Convergence Rates for Markov Chains.
SIAM Rev., 1995

1993
Linear-Algebraic Results Associated with Antiferromagnetic Heisenberg Chains.
SIAM J. Matrix Anal. Appl., July, 1993


  Loading...