Jennifer T. Chayes

According to our database1, Jennifer T. Chayes authored at least 80 papers between 1999 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
The Disparate Equilibria of Algorithmic Decision Making when Individuals Invest Rationally.
CoRR, 2019

Efficient sampling and counting algorithms for the Potts model on Zd at all temperatures.
CoRR, 2019

What's in a Name? Reducing Bias in Bios without Access to Protected Attributes.
CoRR, 2019

Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Setting.
CoRR, 2019

Algorithmic Greenlining: An Approach to Increase Diversity.
Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 2019

2018
Private Algorithms Can Always Be Extended.
CoRR, 2018

Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation.
CoRR, 2018

2017
Convergent sequences of sparse graphs: A large deviations approach.
Random Struct. Algorithms, 2017

Sparse Exchangeable Graphs and Their Limits via Graphon Processes.
J. Mach. Learn. Res., 2017

Graphons: A Nonparametric Method to Model, Estimate, and Design Algorithms for Massive Networks.
CoRR, 2017

Thy Friend is My Friend: Iterative Collaborative Filtering for Sparse Matrix Estimation.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes.
Proc. Natl. Acad. Sci. U.S.A., 2016

Entropy-SGD: Biasing Gradient Descent Into Wide Valleys.
CoRR, 2016

Unreasonable Effectiveness of Learning Neural Nets: Accessible States and Robust Ensembles.
CoRR, 2016

Graphons and Machine Learning: Modeling and Estimation of Sparse Massive Networks.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

An Axiomatic Approach to Community Detection.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
Bargaining dynamics in exchange networks.
J. Economic Theory, 2015

Private Graphon Estimation for Sparse Graphs.
CoRR, 2015

2014
Optimal Multiperiod Pricing with Service Guarantees.
Management Science, 2014

Multiscale Matrix Sampling and Sublinear-Time PageRank Computation.
Internet Mathematics, 2014

Fixed-Points of Social Choice: An Axiomatic Approach to Network Communities.
CoRR, 2014

Maximizing Social Influence in Nearly Optimal Time.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Sharing Information to Reconstruct Patient-Specific Pathways in Heterogeneous Diseases.
Proceedings of the Biocomputing 2014: Proceedings of the Pacific Symposium, 2014

2013
Left and right convergence of graphs with bounded degree.
Random Struct. Algorithms, 2013

Simultaneous Reconstruction of Multiple Signaling Pathways via the Prize-Collecting Steiner Forest Problem.
Journal of Computational Biology, 2013

Finding Endogenously Formed Communities.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Pricing and queueing.
SIGMETRICS Performance Evaluation Review, 2012

Influence Maximization in Social Networks: Towards an Optimal Algorithmic Solution
CoRR, 2012

The Power of Local Information in Social Networks
CoRR, 2012

Sublinear Time Algorithm for PageRank Computations and Related Applications
CoRR, 2012

I Like Her more than You: Self-determined Communities
CoRR, 2012

The Power of Local Information in Social Networks.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

A Sublinear Time Algorithm for PageRank Computations.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

2011
Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions.
SIAM J. Discrete Math., 2011

Limits of randomly grown graph sequences.
Eur. J. Comb., 2011

Finding undetected protein associations in cell signaling by belief propagation
CoRR, 2011

We know who you followed last summer: inferring social link creation times in twitter.
Proceedings of the 20th International Conference on World Wide Web, 2011

Optimal Multi-period Pricing with Service Guarantees - Working Paper.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

2010
How to distribute antidote to control epidemics.
Random Struct. Algorithms, 2010

The myth of the Folk Theorem.
Games and Economic Behavior, 2010

Tight Bounds for Mixing of the Swendsen-Wang Algorithm at the Potts Transition Point
CoRR, 2010

The Hitchhiker's Guide to Affiliation Networks: A Game-Theoretic Approach
CoRR, 2010

Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
CoRR, 2010

A Novel Approach to Propagating Distrust.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Game-Theoretic Models of Information Overload in Social Networks.
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

2009
Proof of the local REM conjecture for number partitioning. II. Growing energy scales.
Random Struct. Algorithms, 2009

Proof of the local REM conjecture for number partitioning. I: Constant energy scales.
Random Struct. Algorithms, 2009

A Natural Dynamics for Bargaining on Exchange Networks
CoRR, 2009

2008
Local Computation of PageRank Contributions.
Internet Mathematics, 2008

Trust-based recommendation systems: an axiomatic approach.
Proceedings of the 17th International Conference on World Wide Web, 2008

On the Stability of Web Crawling and Web Search.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Robust PageRank and locally computable spam detection features.
Proceedings of the AIRWeb 2008, 2008

2007
Degree distribution of the FKP network model.
Theor. Comput. Sci., 2007

Emergence of tempered preferential attachment from optimization.
Proc. Natl. Acad. Sci. U.S.A., 2007

The Myth of the Folk Theorem.
Electronic Colloquium on Computational Complexity (ECCC), 2007

Fitting the WHOIS Internet data
CoRR, 2007

First to Market is not Everything: an Analysis of Preferential Attachment with Fitness.
CoRR, 2007

Dynamics of bid optimization in online advertisement auctions.
Proceedings of the 16th International Conference on World Wide Web, 2007

First to market is not everything: an analysis of preferential attachment with fitness.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels.
CoRR, 2006

Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube.
Combinatorica, 2006

Graph limits and parameter testing.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Random subgraphs of finite graphs: I. The scaling window under the triangle condition.
Random Struct. Algorithms, 2005

Degree Distribution of Competition-Induced Preferential Attachment Graphs
CoRR, 2005

On the spread of viruses on the internet.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Multi-unit auctions with budget-constrained bidders.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

2004
Competition-Induced Preferential Attachment
CoRR, 2004

Constrained Integer Partitions.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Exploring the community structure of newsgroups.
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

2003
Phase Diagram for the Constrained Integer Partitioning Problem
CoRR, 2003

Directed scale-free graphs.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Phase Transitions in Computer Science.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Phase transition and finite-size scaling for the integer partitioning problem.
Random Struct. Algorithms, 2001

The scaling window of the 2-SAT transition.
Random Struct. Algorithms, 2001

Sharp threshold and scaling window for the integer partitioning problem.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

On the Sampling Problem for H-Colorings on the Hypercubic Lattice.
Proceedings of the Graphs, 2001

1999
Foreword.
Random Struct. Algorithms, 1999

Uniform boundedness of critical crossing probabilities implies hyperscaling.
Random Struct. Algorithms, 1999

Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999


  Loading...