323 citations
- Claremont Graduate UniversityUS16 papers
- Scripps CollegeUS10 papers
- Pomona CollegeUS9 papers
- Harvey Mudd CollegeUS7 papers
- Pitzer CollegeUS7 papers
- Georgia Institute of TechnologyUS4 papers
- Arizona State UniversityUS3 papers
- Jagiellonian UniversityPL3 papers
- Massachusetts Institute of TechnologyUS3 papers
- University of California, Los AngelesUS3 papers
- University of ConnecticutUS3 papers
- University of South FloridaUS3 papers
7 papers · 1 filter
Construction and Analysis of Random Networks with Explosive Percolation
Eric J. Friedman, Adam S. Landsberg
The existence of explosive phase transitions in random (Erd\H os Rényi-type) networks has been recently documented by Achlioptas et al.\ [Science {\bf 323}, 1453 (2009)] via simula…
Rack shadows and their invariants
Wesley Chang, Sam Nelson
A rack shadow is a set X with a rack action by a rack R, analogous to a vector space over a field. We use shadow colorings of classical link diagrams to define enhanced rack counti…
Simulation reductions for the Ising model
Mark L. Huber
Polynomial time reductions between problems have long been used to delineate problem classes. Simulation reductions also exist, where an oracle for simulation from some probability…
Perfect simulation of Vervaat perpetuities
James Allen Fill, Mark Huber
We use coupling into and from the past to sample perfectly in a simple and provably fast fashion from the Vervaat family of perpetuities. The family includes the Dickman distributi…
Reducing the Ising model to matchings
Mark Huber, Jenny Law
Canonical paths is one of the most powerful tools available to show that a Markov chain is rapidly mixing, thereby enabling approximate sampling from complex high dimensional distr…
The column group and its link invariants
Johanna Hennig, Sam Nelson
The column group is a subgroup of the symmetric group on the elements of a finite blackboard birack generated by the column permutations in the birack matrix. We use subgroups of t…