my.bib

Mossel:98

Recursive reconstruction on periodic trees
E. Mossel
Random Structures Algorithms  13  81--97  (1998)
http://www.stat.berkeley.edu/~mossel/publications/recursive.pdf

HaggstromMossel:98

Nearest-neighbor walks with low predictability profile and percolation in {$2+\epsilon$} dimensions
O. Häggström and E. Mossel
Ann. Probab.  26  1212--1231  (1998)
http://www.stat.berkeley.edu/~mossel/publications/olle_ising.pdf

BeHaMo:00

On random graph homomorphisms into {${\bf Z}$}
I. Benjamini and O. Häggström and E. Mossel
J. Combin. Theory Ser. B  78  86--114  (2000)
http://www.stat.berkeley.edu/~mossel/publications/random_homo.pdf

JoMoPe:00

Percolation in a dependent random environment
J. Jonasson and E. Mossel and Y. Peres
Random Structures Algorithms  16  333--343  (2000)
http://www.stat.berkeley.edu/~mossel/publications/percre.pdf

Mossel:01

Reconstruction on trees: beating the second eigenvalue
E. Mossel
Ann. Appl. Probab.  11  285--300  (2001)
http://www.stat.berkeley.edu/~mossel/publications/second.pdf

HoffmanMossel:01

Energy of flows on percolation clusters
C. Hoffman and E. Mossel
Potential Anal.  14  375--385  (2001)
http://www.stat.berkeley.edu/~mossel/publications/energy.pdf

KeMoPe:01

Glauber dynamics on trees and hyperbolic graphs
C. Kenyon and E. Mossel and Y. Peres
42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001)      568--578  (2001)
http://www.stat.berkeley.edu/~mossel/publications/mix_ising.pdf

MosselUmans:01

On the complexity of approximating the {VC} dimension
E. Mossel and C. Umans
Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 18-21 June 2001, Chicago, Illinois, USA.      220--225  (2001)
http://www.stat.berkeley.edu/~mossel/publications/procvc.pdf

Mossel:02

The minesweeper game: percolation and complexity
E. Mossel
Combin. Probab. Comput.  11  487--499  (2002)
http://www.stat.berkeley.edu/~mossel/publications/mine_sweeper.pdf

MosselODonnell:02

On the noise sensitivity of monotone functions
E. Mossel and R. O'Donnell
Mathematics and computer science, II (Versailles, 2002)      481--495  (2002)
http://www.stat.berkeley.edu/~mossel/publications/rec_maj.pdf

MosselUmans:02

On the complexity of approximating the {VC} dimension
E. Mossel and C. Umans
J. Comput. System Sci.  65  660--671  (2002)
http://www.stat.berkeley.edu/~mossel/publications/vc.pdf

Mossel:03

On the impossibility of reconstructing ancestral data and phylogenies
E. Mossel
Jour. Comput. Bio.  10  669--678  (2003)
http://www.stat.berkeley.edu/~mossel/publications/jcb_impossibility.pdf

BenjaminiMossel:03

On the mixing time of a simple random walk on the super critical percolation cluster
I. Benjamini and E. Mossel
Probab. Theory Related Fields  125  408--420  (2003)
http://front.math.ucdavis.edu/math.PR/0011092

MosselPeres:03

Information flow on trees
E. Mossel and Y. Peres
Ann. Appl. Probab.  13  817--844  (2003)
http://front.math.ucdavis.edu/math.PR/0107033

MosselOdonnell:03

On the noise sensitivity of monotone functions
E. Mossel and R. O'Donnell
Random Structures Algorithms  23  333--350  (2003)
http://www.stat.berkeley.edu/~mossel/publications/rec_maj2.pdf

MoOdSe:03

Learning Juntas
E. Mossel and R. O'Donnell and R. Servedio
Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC) San-Diego      206--212  (2003)
http://www.stat.berkeley.edu/~mossel/publications/learning_juntas.pdf

BMOS:03

Learning {DNF}'s from random walks
N. H. Bshouty and E. Mossel and R. O'Donnell and R. Servedio
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), Cambridge, MA      189--198  (2003)
http://www.stat.berkeley.edu/~mossel/publications/cnf_rw.pdf

MoShTr:03

On $\epsilon$-biased generators in $NC_0$
E. Mossel and A. Shpilka and L. Trevisan
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), Cambridge, MA      136--145  (2003)
http://www.stat.berkeley.edu/~mossel/publications/prginnc0.pdf

MosselSteel:04a

A phase transition for a random cluster model on phylogenetic trees
E. Mossel and M. Steel
Math. Biosci.  187  189--203  (2004)
http://www.stat.berkeley.edu/~mossel/publications/Phylogey_mike.pdf

Mossel:04

Survey: Information flow on trees
E. Mossel
Graphs, Morphisms and Statistical Physics. DIMACS series in discrete mathematics and theoretical computer science      155--170  (2004)
http://front.math.ucdavis.edu/0406.5446

JansonMossel:04

Robust reconstruction on trees is determined by the second eigenvalue
S. Janson and E. Mossel
Ann. Probab.  32  2630--2649  (2004)
http://front.math.ucdavis.edu/0406.5447

Mossel:04a

Phase transitions in Phylogeny
E. Mossel
Trans. Amer. Math. Soc.  356  2379--2404 (electronic)  (2004)
http://front.math.ucdavis.edu/0304.5491

LMMS:04

On Approximately Fair Allocations of Indivisible Goods
R. Lipton and V. Markakis and E. Mossel and A. Saberi
Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), New York, NY, USA, May 17-20, 2004      125--131  (2004)
http://www.stat.berkeley.edu/~mossel/publications/happy.pdf

MoOdSe:04

Learning functions of {$k$} relevant variables
E. Mossel and R. O'Donnell and R. A. Servedio
J. Comput. System Sci.  69  421--434  (2004)
http://www.stat.berkeley.edu/~mossel/publications/learning_k.pdf

MosselSteel:04c

Random biochemical networks and the probability of self-sustaining autocatalysis
E. Mossel and M. Steel
J. Theoret. Biol.  233  327--336  (2005)
http://front.math.ucdavis.edu/0406.6644

KKMO:04

Optimal Inapproximability Results for MAX-CUT and Other 2-variable CSPs?
S. Khot and G. Kindler and E. Mossel and R. O'Donnell
Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science      146--154  (2004)
http://www.stat.berkeley.edu/~mossel/publications/max_cut_focs.pdf

MoPeSi:04

Shuffling by semi-random transpositions
E. Mossel and Y. Peres and A. Sinclair
Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04) October 17 - 19, 2004, Rome, Italy      572--581  (2004)
http://www.stat.berkeley.edu/~mossel/publications/rc4_focs.pdf

FMMPSSUW:05

Online Conflict-Free Coloring for intervals
A. Fiat and M. Levy and J. Matou\v{s}ek and E. Mossel and J. Pach and M. Sharir and S. Smorodinsky and U. Wagner and E. Welzl
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 23--25, 2005, Vancouver, Canada (SODA05)      545--554  (2005)
http://www.stat.berkeley.edu/~mossel/publications/onlinecf_intervals.pdf

MaMoWa:05

A New look at Survey Propogation and its Generalizations (extended abstract)
E. Maneva and E. Mossel and M. J. Wainwright
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 23--25, 2005, Vancouver, Canada (SODA05)      1089--1098  (2005)
http://www.stat.berkeley.edu/~mossel/publications/SP_soda.pdf

MosselSteel:05

How much can evolved characters tell us about the tree that generated them?
E. Mossel and M. Steel
Mathematics Of Evolution And Phylogeny      384--412  (2005)
http://front.math.ucdavis.edu/0406.6648

BeKeMoPe:05

Glauber dynamics on trees and hyperbolic graphs
N. Berger and C. Kenyon and Y. Mossel, E. and Peres
Probab. Theory Related Fields  131  311--340  (2005)
http://front.math.ucdavis.edu/0308.5284

MosselRoch:05

Learning Nonsingular Phylogenies and Hidden Markov Models
E. Mossel and S. Roch
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, Baltimore (STOC05), MD, USA      366--376  (2005)
http://www.stat.berkeley.edu/~mossel/publications/hmm-stoc.pdf

BBHM:05

Mixing times of the biased card shuffling and the asymmetric exclusion process
I. Benjamini and N. Berger and C. Hoffman and E. Mossel
Trans. Amer. Math. Soc.  357  3013--3029 (electronic)  (2005)
http://front.math.ucdavis.edu/0207.5199

MosselODonnell:05

Coin flipping from a cosmic source: On error correction of truly random bits
E. Mossel and R. O'Donnell
Random Structures Algorithms  26  418--436  (2005)
http://front.math.ucdavis.edu/0406.5504

MosselVigoda:05

Phylogenetic MCMC Are Misleading on Mixtures of Trees (short report)
E. Mossel and E. Vigoda
Science  309  2207--2209  (2005)
http://www.cc.gatech.edu/~vigoda/Science

BMOS:05

Learning {DNF} from random walks
N. H. Bshouty and E. Mossel and R. A. O'Donnell, R. and Servedio
J. Comput. System Sci.  71  250--265  (2005)
http://www.stat.berkeley.edu/~mossel/publications/dnfrw_final.pdf

MoOdOl:05

Noise stability of functions with low influences: invariance and optimality (extended abstract)
E. Mossel and R. O'Donnell and K. Oleszkiewicz
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings      21--30  (2005)
http://www.stat.berkeley.edu/~mossel/publications/moo-focs-final.pdf

HiMoPe:05

New coins from old: computing with unknown bias
E. Mossel and Y. Peres
Combinatorica  25  707--724  (2005)
http://front.math.ucdavis.edu/0304.5143

DHJMMR:06

Maximal Accurate Forests from Distance Matrices.
C. Daskalakis and C. Hill and A. Jaffe and R. Mihaescu and E. Mossel and S. Rao
Research in Computational Molecular Biology, 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings (RECOMB 2006)    3909  281-295  (2006)
http://www.stat.berkeley.edu/~mossel/publications/recomb2006.pdf

DiMoRe:06

Conditional Hardness for Approximate Coloring
I. Dinur and E. Mossel and O. Regev
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing (STOC 2006)      344--353  (2006)
http://www.stat.berkeley.edu/~mossel/publications/coloring_stoc.pdf

DaMoRo:06

Optimal Phylogenetic Reconstruction
C. Daskalakis and E. Mossel and S. Roch
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing (STOC 2006)      159--168  (2006)
http://www.stat.berkeley.edu/~mossel/publications/log_stoc.pdf

HaKaMo:06

A Law of Large Numbers for Weighted Majority
O. Häggström and G. Kalai and E. Mossel
Advances in Applied Mathematics  37  112--123  (2006)
http://front.math.ucdavis.edu/0406.5509

MosselRoch:06a

Learning Nonsingular Phylogenies and Hidden Markov Models
E. Mossel and S. Roch
Ann. Appl. Probab.  16  583--614  (2006)
http://front.math.ucdavis.edu/0502.6076

MORSS:06

Non-interactive correlation distillation, inhomogeneous {M}arkov chains, and the reverse {B}onami-{B}eckner inequality
E. Mossel and R. O'Donnell and J. E. Regev, O. and Steif and B. Sudakov
Israel J. Math.  154  299-336  (2006)
http://front.math.ucdavis.edu/0410.5560

MoShTr:06

On $\epsilon$-biased generators in ${\rm NC}\sp 0$
E. Mossel and A. Shpilka and L. Trevisan
Random Structures Algorithms  29  56--81  (2006)
http://www.stat.berkeley.edu/~mossel/publications/prg_final.pdf

FeMoVi:06

Complete convergence of message passing algorithms for some satisfiability problems
U. Feige and E. Mossel and D. Vilenchik
Proceedings of Random 2006      339--350  (2006)
http://www.stat.berkeley.edu/~mossel/publications/WP_RANDOM.pdf

BCMR:06

The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels
C. Borgs and J. Chayes and E. Mossel and S. Roch
Proceedings of IEEE FOCS 2006      518--530  (2006)
http://www.stat.berkeley.edu/~mossel/publications/sg_focs.pdf

CFMMPSSUW:06

Online Conflict-Free Coloring for intervals
K. Chen and A. Fiat and H. Kaplan and M. Levy and J. Matou\v{s}ek and E. Mossel and J. Pach and M. Sharir and S. Smorodinsky and U. Wagner and E. Welzl
SIAM Journal on Computing  36  956-973  (2006)
http://www.stat.berkeley.edu/~mossel/publications/coloring_sicomp.pdf

MosselVigoda:06

Limitations of Markov Chain Monte Carlo Algorithms for Bayesian Inference of Phylogeny
E. Mossel and E. Vigoda
Ann. Appl. Probab.  16  2215--2234  (2006)
http://front.math.ucdavis.edu/0505.6602

MosselVigoda:06a

Response to comment on Phylogenetic MCMC are misleading on mixtures of trees
E. Mossel and E. Vigoda
Science  312  367  (2006)
http://www.sciencemag.org/cgi/content/abstract/sci;312/5772/367b

Mossel:07

Distorted metrics on trees and phylogenetic forests
E. Mossel
IEEE Computational Biology and Bioinformatics  4  108--116  (2007)
http://front.math.ucdavis.edu/0403.5508

MosselRoch:07a

Slow Emergence of Cooperation for Win-Stay Lose-Shift on Trees
E. Mossel and S. Roch
Machine Learning  67  7--22  (2007)
http://front.math.ucdavis.edu/0509.5576

KKMO:07

Optimal Inapproximability Results for MAX-CUT and Other 2-variable CSPs?
S. Khot and G. Kindler and E. Mossel and R. O'Donnell
Siam Jounral on Computing  37  319--357  (2007)
http://www.stat.berkeley.edu/~mossel/publications/max_cut_final.pdf

MosselRoch:07b

On the Submodularity of Influence in Social Networks
E. Mossel and S. Roch
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing      128--134  (2007)
http://front.math.ucdavis.edu/0612.5046

MaMoWa:07

A New look at Survey Propogation and its Generalizations
E. Maneva and E. Mossel and M. J. Wainwright
Journal of the ACM  54  41 pages  (2007)
http://www.stat.berkeley.edu/~mossel/publications/max_cut_final.pdf

MoOdOl:07

Noise stability of functions with low influences: invariance and optimality
E. Mossel and R. O'Donnell and K. Oleszkiewicz
To appear in Ann. Math.      (2007)
http://front.math.ucdavis.edu/0503.5503

BrEtMo:07

Mafia : A Theoretical Study Of Players and Coalitions in a Partial Information Environment
M. Braverman and O. Etesami and E. Mossel
To appear in Annals of Applied Probability      (2007)
http://front.math.ucdavis.edu/0609.5534

BravermanMossel:07

Noisy sorting without resampling
M. Braverman and E. Mossel
To Appear in SODA 2008        (2007)
http://front.math.ucdavis.edu/0707.1051

MosselSly:07

Rapid Mixing of Gibbs Sampling on Graphs that are Sparse on Average
E. Mossel and A. Sly
To Appear in SODA 2008        (2007)
http://front.math.ucdavis.edu/0704.3603

MoWeWo:07

On the hardness of sampling independent sets beyond the tree threshold
E. Mossel and D. Weitz and N. Wormald
To Appear in Prob. Theory Related. Fields      (2007)
http://front.math.ucdavis.edu/0701.5471

DiMoRe:07

Conditional Hardness for Approximate Coloring
I. Dinur and E. Mossel and O. Regev
To Appear in SIAM J. Comput.      (2007)
http://front.math.ucdavis.edu/0504.6062

MaMoSt:07

Mixed-up trees: the structure of phylogenetic mixtures
F. A. Matsen and E. Mossel and M. Steel
To Appear in Bull. Math. Bio.      (2007)
http://front.math.ucdavis.edu/0705.4328

DaDiMo:07

Connectivity and Equilibrium in Random Games
C. Daskalakis and A. G. Dimakis and E. Mossel
      (2007)
http://front.math.ucdavis.edu/0703.5902

Mossel:07b

Gaussian bounds for noise correlation of functions
E. Mossel
      (2007)
http://front.math.ucdavis.edu/0703.5683

DKMRV:07

Sorting and Selection in Posets
C. Daskalakis and R. M. Karp and E. Mossel and S. Riesenfeld and E. Verbin
      (2007)
http://front.math.ucdavis.edu/0707.1532

MosselSly:07b

Gibbs Rapidly Samples Colorings of G(n,d/n)
E. Mossel and A. Sly
      (2007)
http://front.math.ucdavis.edu/0707.3241

MosselRoch:07c

Incomplete Lineage Sorting: Consistent Phylogeny Estimation From Multiple Loci
E. Mossel and S. Roch
      (2007)
http://front.math.ucdavis.edu/0710.0262