Ben Morris

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Mixing time of the torus shuffle 2024 Olena Blumberg
Ben Morris
Alto Senda
+ Transience of Simple Random Walks With Linear Entropy Growth 2023 Ben Morris
Hamilton Samraj Santhakumar
+ Format Preserving Encryption in the Bounded Retrieval Model 2023 Ben Morris
Hans Oberschelp
Hamilton Samraj Santhakumar
+ PDF Chat Transience of simple random walks with linear entropy growth 2023 Ben Morris
Hamilton Samraj Santhakumar
+ Mixing Time of the Overlapping Cycles Shuffle 2023 Ben Morris
Hans Oberschelp
+ A Probabilistic Proof of the nCPA to CCA Bound 2022 Ben Morris
Hans Oberschelp
+ PDF Chat The social network model on infinite graphs 2020 Jonathan Hermon
Ben Morris
Chuan Qin
Allan Sly
+ PDF Chat Transience in growing subgraphs via evolving sets 2017 Amir Dembo
Ruojun Huang
Ben Morris
Yuval Peres
+ PDF Chat How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function? 2017 Shoni Gilboa
Shay Gueron
Ben Morris
+ Mixing time of the fifteen puzzle 2017 Ben Morris
Anastasia Raymer
+ Improved bounds for the mixing time of the random-to-random shuffle 2017 Chuan Qin
Ben Morris
+ The social network model on infinite graphs 2016 Jonathan Hermon
Ben Morris
Chuan Qin
Allan Sly
+ The social network model on infinite graphs 2016 Jonathan Hermon
Ben Morris
Chuan Qin
Allan Sly
+ Transience in growing subgraphs via evolving sets 2015 Amir Dembo
Ruojun Huang
Ben Morris
Yuval Peres
+ Transience in growing subgraphs via evolving sets 2015 Amir Dembo
Ruojun Huang
Ben Morris
Yuval Peres
+ PDF Chat Mixing time of the card-cyclic-to-random shuffle 2014 Ben Morris
Weiyang Ning
Yuval Peres
+ Improved bounds for the mixing time of the random-to-random insertion shuffle 2014 Ben Morris
Chuan Qin
+ The mixing time of the fifteen puzzle 2013 Ben Morris
Anastasia Raymer
+ PDF Chat Improved Mixing Time Bounds for the Thorp Shuffle 2012 Ben Morris
+ An Enciphering Scheme Based on a Card Shuffle 2012 Viet Tung Hoang
Ben Morris
Phillip Rogaway
+ PDF Chat Coalescing systems of non-Brownian particles 2012 Steven N. Evans
Ben Morris
Arnab Sen
+ Mixing time of the Card-Cyclic-to-Random shuffle 2012 Ben Morris
Weiyang Ning
Yuval Peres
+ An Enciphering Scheme Based on a Card Shuffle 2012 Viet Tung Hoang
Ben Morris
Phillip Rogaway
+ PDF Chat Linear cover time is exponentially unlikely 2011 Itaı Benjamini
Ori Gurel-Gurevich
Ben Morris
+ Linear Cover Time is Exponentially Unlikely 2010 Itaı Benjamini
Ori Gurel-Gurevich
Ben Morris
+ Coalescing systems of Brownian particles on the Sierpinski gasket and stable particles on the line or circle 2009 Steven N. Evans
Ben Morris
Arnab Sen
+ PDF Chat Improved mixing time bounds for the Thorp shuffle and L-reversal chain 2009 Ben Morris
+ Coalescing systems of non-Brownian particles 2009 Steven N. Evans
Ben Morris
Arnab Sen
+ Improved mixing time bounds for the Thorp shuffle 2009 Ben Morris
+ PDF Chat Spectral gap for the interchange process in a box 2008 Ben Morris
+ PDF Chat The Mixing Time of the Thorp Shuffle 2008 Ben Morris
+ Improved mixing time bounds for the Thorp shuffle and L-reversal chain 2008 Ben Morris
+ Spectral gap for the interchange process in a box 2008 Ben Morris
+ The birthday problem and Markov chain Monte Carlo 2007 Itaı Benjamini
Ben Morris
+ PDF Chat Spectral gap for the zero range process with constant rate 2006 Ben Morris
+ PDF Chat The mixing time for simple exclusion 2006 Ben Morris
+ PDF Chat Evolving sets, mixing and heat kernel bounds 2005 Ben Morris
Yuval Peres
+ PDF Chat The mixing time of the thorp shuffle 2005 Ben Morris
+ The mixing time of the Thorp shuffle 2005 Ben Morris
+ Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions 2004 Ben Morris
Alistair Sinclair
+ Evolving sets and mixing 2003 Ben Morris
Yuval Peres
+ PDF Chat The components of the Wired Spanning Forest are recurrent 2003 Ben Morris
+ Random walks on truncated cubes and sampling 0-1 knapsack solutions 2003 Ben Morris
Alistair Sinclair
+ Evolving sets, mixing and heat kernel bounds 2003 Ben Morris
Yuval Peres
+ Evolving sets and mixing 2003 Ben Morris
Yuval Peres
+ Improved bounds for sampling contingency tables 2002 Ben Morris
+ Improved Bounds for Sampling Contingency Tables 1999 Ben Morris
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Strong Stationary Times Via a New Form of Duality 1990 Persi Diaconis
James Allen Fill
9
+ PDF Chat Comparison Theorems for Reversible Markov Chains 1993 Persi Diaconis
Laurent Saloff‐Coste
9
+ PDF Chat Evolving sets, mixing and heat kernel bounds 2005 Ben Morris
Yuval Peres
9
+ PDF Chat Approximating the Permanent 1989 Mark Jerrum
Alistair Sinclair
8
+ PDF Chat Logarithmic Sobolev inequality for some models of random walks 1998 Tzong-Yow Lee
Horng‐Tzer Yau
6
+ PDF Chat Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, with an Application to the Exclusion Process 1991 James Allen Fill
6
+ PDF Chat Logarithmic Sobolev inequalities for finite Markov chains 1996 Persi Diaconis
Laurent Saloff‐Coste
6
+ PDF Chat The mixing time for simple exclusion 2006 Ben Morris
5
+ Lectures on finite Markov chains 1997 Laurent Saloff‐Coste
5
+ PDF Chat Mixing times of lozenge tiling and card shuffling Markov chains 2004 David B. Wilson
5
+ PDF Chat Logarithmic Sobolev inequality for generalized simple exclusion processes 1997 Horng‐Tzer Yau
5
+ Random generation of combinatorial structures from a uniform distribution 1986 Mark Jerrum
Leslie G. Valiant
Vijay V. Vazirani
4
+ PDF Chat Spectral gap and logarithmic Sobolev inequality for Kawasaki and Glauber dynamics 1993 Sheng Lin Lu
Horng‐Tzer Yau
4
+ Interacting Particle Systems 2016 Thomas M. Liggett
4
+ PDF Chat Isoperimetry and heat kernel decay on percolation clusters 2004 Pierre Mathieu
Élisabeth RĂ©my
4
+ Group representations in probability and statistics 1988 Persi Diaconis
3
+ PDF Chat Geometric Bounds for Eigenvalues of Markov Chains 1991 Persi Diaconis
Daniel W. Stroock
3
+ LÉVY PROCESSES (Cambridge Tracts in Mathematics 121) 1998 S. J. Taylor
3
+ PDF Chat A geometric approach to on-diagonal heat kernel lower bounds on groups 2001 Thierry Coulhon
Alexander Grigor'yan
Christophe Pittet
3
+ PDF Chat On the Duality between Coalescing Brownian Motions 2005 Jie Xiong
Xiaowen Zhou
3
+ Conductance and convergence of Markov chains-a combinatorial treatment of expanders 1989 Milena Mihail
3
+ Isoperimetric Invariants For Product Markov Chains and Graph Products 2004 Christian Houdré
Prasad Tetali
3
+ λ1, Isoperimetric inequalities for graphs, and superconcentrators 1985 Noga Alon
Vitali Milman
3
+ Nonrandom Shuffling with Applications to the Game of Faro 1973 Edward O. Thorp
3
+ PDF Chat Trailing the Dovetail Shuffle to its Lair 1992 Dave Bayer
Persi Diaconis
3
+ PDF Chat Brownian motion on nested fractals 1990 Tom LindstrĂžm
3
+ Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow 1992 Alistair Sinclair
3
+ PDF Chat The Brownian web: Characterization and convergence 2004 Luiz Renato Fontes
Marco Isopi
Charles M. Newman
K. Ravishankar
3
+ PDF Chat On the Duality between Coalescing Brownian Particles and the Heat Equation Driven by Fisher-Wright Noise 2005 Tim Hobson
Rodge Tribe
3
+ Rates of convergence for lamplighter processes 1997 Olle HĂ€ggstr om
Johan Jonasson
3
+ PDF Chat Eigenvalues of Graphs and Sobolev Inequalities 1995 Frank R. Chung
Stephen Yau
3
+ PDF Chat Reflection and coalescence between independent one-dimensional Brownian paths 2000 Florin Soucaliuc
BĂĄlint TĂłth
Wendelin Werner
3
+ PDF Chat Continuum-sites stepping-stone models, coalescing exchangeable partitions and random trees 2000 Peter Donnelly
Steven N. Evans
Klaus Fleischmann
Thomas G. Kurtz
Xiaowen Zhou
3
+ PDF Chat Brownian motion on the Sierpinski gasket 1988 Martin T. Barlow
Edwin Perkins
3
+ PDF Chat A random polynomial-time algorithm for approximating the volume of convex bodies 1991 Martin Dyer
Alan Frieze
Ravi Kannan
3
+ PDF Chat Flows, coalescence and noise 2004 Yves Le Jan
Olivier Raimond
3
+ PDF Chat Comparison Techniques for Random Walk on Finite Groups 1993 Persi Diaconis
Laurent Saloff‐Coste
3
+ PDF Chat Bounds on the 𝐿ÂČ spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality 1988 Gregory F. Lawler
Alan D. Sokal
3
+ Ultracontractivity and Nash Type Inequalities 1996 Thierry Coulhon
3
+ PDF Chat Eigenvalues and expanders 1986 Ilan Alon
3
+ PDF Chat On the mixing time of a simple random walk on the super critical percolation cluster 2003 Itaı Benjamini
Elchanan Mossel
3
+ PDF Chat A lower bound for the mixing time of the random-to-random Insertions shuffle 2013 Eliran Subag
3
+ PDF Chat Cluster formation in a stepping-stone model with continuous, hierarchically structured sites 1996 Steven N. Evans
Klaus Fleischmann
3
+ Probability on Trees and Networks 2016 Russell Lyons
Yuval Peres
3
+ PDF Chat Clustering Behavior of a Continuous-Sites Stepping-Stone Model with Brownian Migration 2003 Xiaowen Zhou
3
+ Mixing times of the biased card shuffling and the asymmetric exclusion process 2005 Itaı Benjamini
Noam Berger
Christopher Hoffman
Elchanan Mossel
3
+ On the spectral gap of Kawasaki dynamics under a mixing condition revisited 2000 Nicoletta Cancrini
Fabio Martinelli
3
+ PDF Chat Mathematical Aspects of Mixing Times in Markov Chains 2005 Ravi Montenegro
Prasad Tetali
3
+ PDF Chat On Recurrent and Transient Sets of Inhomogeneous Symmetric Random Walks 2001 Giambattista Giacomin
Gustavo Posta
2
+ PDF Chat Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses 1992 Alberto Gandolfi
Michaël Keane
Charles M. Newman
2