default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPersi Diaconis
Person information
- affiliation: Stanford University, USA
- award (1997): Josiah Willard Gibbs Lectureship
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j40]Sourav Chatterjee
, Persi Diaconis:
Isomorphisms between random graphs. J. Comb. Theory B 160: 144-162 (2023)- 2022
- [j39]Persi Diaconis, Ronald L. Graham, Xiaoyu He, Sam Spiro:
Card guessing with partial feedback. Comb. Probab. Comput. 31(1): 1-20 (2022) - [j38]Persi Diaconis, Ronald L. Graham, Sam Spiro:
Guessing about Guessing: Practical Strategies for Card Guessing with Feedback. Am. Math. Mon. 129(7): 607-622 (2022) - 2021
- [j37]Fan Chung, Persi Diaconis, Ron Graham:
Permanental generating functions and sequential importance sampling. Adv. Appl. Math. 126: 101916 (2021) - [j36]Persi Diaconis, Brett Kolesnik:
Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs. Adv. Appl. Math. 131: 102247 (2021) - [i1]Yeganeh Alimohammadi, Persi Diaconis, Mohammad Roghani, Amin Saberi:
Sequential importance sampling for estimating expectations over the space of perfect matchings. CoRR abs/2107.00850 (2021)
2010 – 2019
- 2019
- [j35]Persi Diaconis, Robert C. Griffiths:
Reproducing kernel orthogonal polynomials on the multinomial distribution. J. Approx. Theory 242: 1-30 (2019) - 2017
- [j34]Persi Diaconis, Angela Hicks:
Probabilizing parking functions. Adv. Appl. Math. 89: 125-155 (2017) - 2016
- [j33]Steve Butler, Persi Diaconis, Ron Graham:
The Mathematics of the Flip and Horseshoe Shuffles. Am. Math. Mon. 123(6): 542-556 (2016) - 2015
- [j32]Bobbie Chern, Persi Diaconis, Daniel M. Kane, Robert C. Rhoades:
Central limit theorems for some set partition statistics. Adv. Appl. Math. 70: 92-105 (2015) - [j31]Sergio Bacallado, Persi Diaconis, Susan P. Holmes:
de Finetti Priors using Markov chain Monte Carlo computations. Stat. Comput. 25(4): 797-808 (2015) - 2014
- [j30]Persi Diaconis, Jason Fulman:
Combinatorics of balanced carries. Adv. Appl. Math. 59: 8-25 (2014) - [j29]Persi Diaconis, Steven N. Evans, Ron Graham:
Unseparated pairs and fixed points in random permutations. Adv. Appl. Math. 61: 102-124 (2014) - [j28]Persi Diaconis, Xuancheng Shao, Kannan Soundararajan:
Carries, Group Theory, and Additive Combinatorics. Am. Math. Mon. 121(8): 674-688 (2014) - 2013
- [j27]Persi Diaconis, Philip Matchett Wood:
Random doubly stochastic tridiagonal matrices. Random Struct. Algorithms 42(4): 403-437 (2013) - 2011
- [j26]Persi Diaconis, Laurent Miclo:
On Barycentric Subdivision. Comb. Probab. Comput. 20(2): 213-237 (2011) - [j25]Joseph K. Blitzstein, Persi Diaconis:
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees. Internet Math. 6(4): 489-522 (2011) - 2010
- [j24]Christos A. Athanasiadis, Persi Diaconis:
Functions of random walks on hyperplane arrangements. Adv. Appl. Math. 45(3): 410-437 (2010)
2000 – 2009
- 2009
- [j23]Persi Diaconis, Jason Fulman:
Carries, shuffling, and symmetric functions. Adv. Appl. Math. 43(2): 176-196 (2009) - [j22]Stephen P. Boyd, Persi Diaconis, Pablo A. Parrilo, Lin Xiao:
Fastest Mixing Markov Chain on Graphs with Symmetries. SIAM J. Optim. 20(2): 792-819 (2009) - [j21]Persi Diaconis, Jason Fulman:
Carries, Shuffling, and an Amazing Matrix. Am. Math. Mon. 116(9): 788-803 (2009) - 2008
- [j20]Persi Diaconis, Susan P. Holmes, Svante Janson:
Threshold Graph Limits and Random Threshold Graphs. Internet Math. 5(3): 267-320 (2008) - [c5]Persi Diaconis:
Shuffling cards, adding numbers, and symmetric functions. SODA 2008: 560 - 2007
- [j19]Persi Diaconis, Susan P. Holmes, Richard Montgomery:
Dynamical Bias in the Coin Toss. SIAM Rev. 49(2): 211-235 (2007) - 2006
- [j18]Persi Diaconis, Nicholas Eriksson:
Markov bases for noncommutative Fourier analysis of ranked data. J. Symb. Comput. 41(2): 182-195 (2006) - [j17]Jun Sun, Stephen P. Boyd, Lin Xiao, Persi Diaconis:
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem. SIAM Rev. 48(4): 681-699 (2006) - [j16]Stephen P. Boyd, Persi Diaconis, Jun Sun, Lin Xiao:
Fastest Mixing Markov Chain on a Path. Am. Math. Mon. 113(1): 70-74 (2006) - 2005
- [j15]Stephen P. Boyd, Persi Diaconis, Pablo A. Parrilo, Lin Xiao:
Symmetry Analysis of Reversible Markov Chains. Internet Math. 2(1): 31-71 (2005) - 2004
- [j14]Persi Diaconis, Alexander Gamburd:
Random Matrices, Magic Squares and Matching Polynomials. Electron. J. Comb. 11(2) (2004) - [j13]Persi Diaconis, J. W. Neuberger:
Numerical Results for the Metropolis Algorithm. Exp. Math. 13(2): 207-213 (2004) - [j12]Stephen P. Boyd, Persi Diaconis, Lin Xiao:
Fastest Mixing Markov Chain on a Graph. SIAM Rev. 46(4): 667-689 (2004) - [c4]Xiang Yan, Persi Diaconis, Paat Rusmevichientong, Benjamin Van Roy:
Solitaire: Man Versus Machine. NIPS 2004: 1553-1560 - 2003
- [c3]Persi Diaconis:
Who cares about permanents? SODA 2003: 708-708 - 2002
- [j11]Daniel Bump, Persi Diaconis:
Toeplitz Minors. J. Comb. Theory A 97(2): 252-271 (2002) - 2001
- [j10]Fan Chung, Persi Diaconis, Ronald L. Graham:
Combinatorics for the East Model. Adv. Appl. Math. 27(1): 192-206 (2001) - 2000
- [j9]Persi Diaconis, Steven N. Evans:
Immanants and Finite Point Processes. J. Comb. Theory A 91(1-2): 305-321 (2000)
1990 – 1999
- 1999
- [j8]Persi Diaconis, David Freedman:
Iterated Random Functions. SIAM Rev. 41(1): 45-76 (1999) - 1998
- [j7]Persi Diaconis, Laurent Saloff-Coste:
What Do We Know about the Metropolis Algorithm? J. Comput. Syst. Sci. 57(1): 20-36 (1998) - 1995
- [j6]Persi Diaconis, Michael McGrath, Jim Pitman:
Riffle Shuffles, Cycles, and Descents. Comb. 15(1): 11-29 (1995) - [c2]Persi Diaconis, Laurent Saloff-Coste:
What do we know about the Metropolis algorithm? STOC 1995: 112-129 - 1992
- [j5]Persi Diaconis, James Allen Fill, Jim Pitman:
Analysis of Top To Random Shuffles. Comb. Probab. Comput. 1: 135-155 (1992) - [j4]Persi Diaconis, Ronald L. Graham:
Binomial coefficient codes over GF(2). Discret. Math. 106-107: 181-188 (1992) - [j3]Fan R. K. Chung, Persi Diaconis, Ronald L. Graham:
Universal cycles for combinatorial structures. Discret. Math. 110(1-3): 43-59 (1992) - 1991
- [c1]Persi Diaconis, Daniel N. Rockmore:
Efficient Computation of Isotypic Projections for the Symmetric Group 87. Groups And Computation 1991: 87-104 - 1990
- [j2]Persi Diaconis, Ronald L. Graham, John A. Morrison:
Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions. Random Struct. Algorithms 1(1): 51-72 (1990)
1980 – 1989
- 1980
- [j1]Persi Diaconis:
Average Running Time of the Fast Fourier Transform. J. Algorithms 1(2): 187-208 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
