Jennifer Tour Chayes | Academic Influence

Jennifer Tour Chayes's AcademicInfluence.com Rankings

Jennifer Tour Chayes

Computer Science

#1260

World Rank

#1300

Historical Rank

#647

USA Rank

Data Mining

#268

World Rank

#269

Historical Rank

#23

USA Rank

computer-science Degrees

Jennifer Tour Chayes

Mathematics

#1340

World Rank

#2234

Historical Rank

#555

USA Rank

Graph Theory

#110

World Rank

#118

Historical Rank

#15

USA Rank

Measure Theory

#2934

World Rank

#3483

Historical Rank

#847

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Jennifer Tour Chayes's Degrees

PhD Mathematics Princeton University

Why Is Jennifer Tour Chayes Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jennifer Tour Chayes is dean of the college of computing, data science, and society at the University of California, Berkeley. Before joining Berkeley, she was a technical fellow and managing director of Microsoft Research New England in Cambridge, Massachusetts, which she founded in 2008, and Microsoft Research New York City, which she founded in 2012.

(See a Problem?)

Jennifer Tour Chayes's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Maximizing Social Influence in Nearly Optimal Time (2012) (691)
Entropy-SGD: biasing gradient descent into wide valleys (2016) (594)
Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing (2007) (571)
Tackling Climate Change with Machine Learning (2019) (406)
Directed scale-free graphs (2003) (374)
Discontinuity of the magnetization in one-dimensional 1/¦x−y¦2 Ising and Potts models (1988) (329)
GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS (2008) (314)
Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics (2012) (288)
Trust-based recommendation systems: an axiomatic approach (2008) (243)
Dynamics of bid optimization in online advertisement auctions (2007) (239)
Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Setting (2019) (234)
On the spread of viruses on the internet (2005) (228)
Multi-unit auctions with budget-constrained bidders (2005) (226)
The scaling window of the 2‐SAT transition (1999) (206)
Counting Graph Homomorphisms (2006) (196)
Graph limits and parameter testing (2006) (188)
Local Computation of PageRank Contributions (2007) (163)
Moments of Two-Variable Functions and the Uniqueness of Graph Limits (2008) (143)
An $L^p$ theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions (2014) (136)
Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes (2016) (129)
Finding undetected protein associations in cell signaling by belief propagation (2010) (123)
How to distribute antidote to control epidemics (2010) (117)
Emergence of tempered preferential attachment from optimization (2007) (115)
Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics (1999) (113)
The phase boundary in dilute and random Ising and Potts ferromagnets (1987) (107)
Simultaneous Reconstruction of Multiple Signaling Pathways via the Prize-Collecting Steiner Forest Problem (2012) (101)
Left and right convergence of graphs with bounded degree (2010) (101)
The Birth of the Infinite Cluster:¶Finite-Size Scaling in Percolation (2001) (100)
Random subgraphs of finite graphs: I. The scaling window under the triangle condition (2004) (99)
Sparse Exchangeable Graphs and Their Limits via Graphon Processes (2016) (95)
Random subgraphs of finite graphs : II. The lace expansion and the triangle condition (2004) (94)
The myth of the folk theorem (2008) (92)
A mean field spin glass with short-range interactions (1986) (89)
An $L^{p}$ theory of sparse graph convergence II: LD convergence, quotients and right convergence (2014) (88)
Asymptotic behavior and distributional limits of preferential attachment graphs (2014) (85)
First to market is not everything: an analysis of preferential attachment with fitness (2007) (84)
Percolation on dense graph sequences. (2007) (78)
We know who you followed last summer: inferring social link creation times in twitter (2011) (78)
Phase transition and finite‐size scaling for the integer partitioning problem (2001) (76)
Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions (2007) (75)
Private Graphon Estimation for Sparse Graphs (2015) (68)
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube (2004) (66)
Degree distribution of the FKP network model (2003) (65)
Limits of randomly grown graph sequences (2009) (64)
Bernoulli Percolation Above Threshold: An Invasion Percolation Analysis (1987) (59)
Optimal Multiperiod Pricing with Service Guarantees (2013) (58)
Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point (2010) (57)
What’s in a Name? Reducing Bias in Bios without Access to Protected Attributes (2019) (57)
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels (2006) (57)
Ornstein-Zernike behavior for self-avoiding walks at all noncritical temperatures (1986) (56)
Exploring the community structure of newsgroups (2004) (54)
The Power of Local Information in Social Networks (2012) (53)
Statistical mechanics of steiner trees. (2008) (49)
Finding Endogenously Formed Communities (2012) (49)
On the density of state for the quantum percolation problem (1986) (47)
The disparate equilibria of algorithmic decision making when individuals invest rationally (2019) (47)
Uniform boundedness of critical crossing probabilities implies hyperscaling (1999) (47)
The Correlation Length for the High-Density Phase of Bernoulli Percolation (1989) (47)
The inverse problem in classical statistical mechanics (1984) (45)
Bulk transport properties and exponent inequalities for random resistor and flow networks (1986) (44)
Fast convergence of natural bargaining dynamics in exchange networks (2010) (44)
On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs (2008) (43)
On singular diffusion equations with applications to self‐organized criticality (1993) (42)
Competition-Induced Preferential Attachment (2004) (42)
Gibbs states of graphical representations of the Potts model with external fields (2000) (38)
Thy Friend is My Friend: Iterative Collaborative Filtering for Sparse Matrix Estimation (2017) (37)
Bargaining dynamics in exchange networks (2010) (37)
The covariance matrix of the Potts model: A random cluster analysis (1994) (35)
Robust PageRank and locally computable spam detection features (2008) (34)
Critical points and intermediate phases on wedges of Zd (1986) (34)
A Sublinear Time Algorithm for PageRank Computations (2012) (32)
Partition Function Zeros at First-Order Phase Transitions: Pirogov—Sinai Theory (2003) (32)
Influence Maximization in Social Networks: Towards an Optimal Algorithmic Solution (2012) (32)
Partition Function Zeros at First-Order Phase Transitions: A General Analysis (2003) (32)
Revealing Network Structure, Confidentially: Improved Rates for Node-Private Graphon Estimation (2018) (28)
Degree Distribution of Competition-Induced Preferential Attachment Graphs (2005) (27)
Multiscale Matrix Sampling and Sublinear-Time PageRank Computation (2012) (27)
The van den Berg-Kesten-Reimer Inequality: A Review (1999) (27)
Sampling perspectives on sparse exchangeable graphs (2017) (27)
Visualizing the Consequences of Climate Change Using Cycle-Consistent Adversarial Networks (2019) (25)
Consistent nonparametric estimation for heavy-tailed sparse graphs (2015) (25)
The Hitchhiker's Guide to Affiliation Networks: A Game-Theoretic Approach (2010) (25)
Mean-field lattice trees (1999) (25)
Critical behavior of the Bethe lattice spin glass (Erratum) (1988) (23)
Graphons: A Nonparametric Method to Model, Estimate, and Design Algorithms for Massive Networks (2017) (22)
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures (2020) (22)
The Mean Field Bound for the Order Parameter of Bernoulli Percolation (1987) (21)
MLSys: The New Frontier of Machine Learning Systems (2019) (21)
Independent and dependent percolation (1999) (21)
Phase diagram for the constrained integer partitioning problem (2003) (20)
Random surface correlation functions (1984) (20)
Game-Theoretic Models of Information Overload in Social Networks (2010) (19)
THE OPTIMAL ADMISSION THRESHOLD IN OBSERVABLE QUEUES WITH STATE DEPENDENT PRICING (2013) (19)
A multifactorial model of T cell expansion and durable clinical benefit in response to a PD-L1 inhibitor (2017) (18)
A Novel Approach to Propagating Distrust (2010) (18)
The large-N limit of the threshold values in Mandelbrot's fractal percolation process (1989) (18)
Phase transitions in Mandelbrot's percolation process in three dimensions (1991) (17)
Proof of the local REM conjecture for number partitioning. II. Growing energy scales (2005) (16)
Proof of the local REM conjecture for number partitioning. I: Constant energy scales (2005) (15)
Inhomogeneous percolation problems and incipient infinite clusters (1987) (15)
Dobrushin States in Quantum Lattice Systems (1997) (14)
Sharing Information to Reconstruct Patient-Specific Pathways in Heterogeneous Diseases (2013) (14)
PR ] 2 0 Se p 20 19 EFFICIENT SAMPLING AND COUNTING ALGORITHMS FOR THE POTTS MODEL ON Z d AT ALL TEMPERATURES (13)
Identifiability for Graphexes and the Weak Kernel Metric (2018) (13)
A Natural Dynamics for Bargaining on Exchange Networks (2009) (13)
Convergent sequences of sparse graphs: A large deviations approach (2013) (13)
Priority Pricing in Queues with a Continuous Distribution of Customer Valuations (CMU-CS-13-109) (2016) (13)
Optimal Multi-period Pricing with Service Guarantees - Working Paper (2011) (11)
Sharp threshold and scaling window for the integer partitioning problem (2001) (11)
I Like Her more than You: Self-determined Communities (2012) (10)
On the Sampling Problem for H-Colorings on the Hypercubic Lattice (2001) (9)
A large deviation principle for block models (2020) (9)
An Axiomatic Approach to Community Detection (2016) (8)
A Weak Local Limit for Preferential Attachment Graphs (2009) (8)
Estimating the total treatment effect in randomized experiments with unknown network structure (2022) (7)
Finite-Size Scaling in Percolation (1998) (7)
Random subgraphs of finite graphs. Part III: The phase transition for the n-cube (2003) (6)
Iterative Collaborative Filtering for Sparse Matrix Estimation (2017) (6)
Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks (2018) (5)
Anisotropic self-avoiding walks (2000) (5)
The correct extension of the Fortuin-Kasteleyn result to plaquette percolation (1984) (5)
Phase diagram and correlation length bounds for Mandelbrot aerogels (1993) (4)
Sublinear Time Algorithm for PageRank Computations and Related Applications (2012) (4)
Limits of sparse configuration models and beyond: Graphexes and MultiGraphexes (2019) (4)
Algorithmic Greenlining: An Approach to Increase Diversity (2019) (3)
Pricing and queueing (2012) (3)
Bid Optimization in Online Advertisement Auctions (2016) (3)
Private Algorithms Can Always Be Extended (2018) (3)
Sharp Phase Boundaries for a Lattice Flux Line Model (2000) (2)
Constrained Integer Partitions (2004) (2)
Fixed-Points of Social Choice: An Axiomatic Approach to Network Communities (2014) (2)
Discovering Neuronal Cell Types and Their Gene Expression Profiles Using a Spatial Point Process Mixture Model (2016) (2)
Meissner phase for a model of oriented flux lines (1995) (2)
GRAPH LIMITS AND EXCHANGEABLE RANDOM (2007) (2)
Mathematics of Web science: structure, dynamics and incentives (2013) (2)
On the Stability of Web Crawling and Web Search (2008) (1)
Fitting the WHOIS Internet data (2007) (1)
A correction to Kallenberg's theorem for jointly exchangeable random measures (2019) (1)
Phase diagram for the Bethe lattice spin glass (abstract) (1988) (1)
Efficient sampling and counting algorithms for the Potts model on $\mathbb Z^d$ at all temperatures (2019) (1)
Graphons and Machine Learning: Modeling and Estimation of Sparse Massive Networks (2016) (1)
PERCOLATION AND RANDOM MEDIA: LECTURE NOTES FOR LES HOUCHES, SUMMER 1984 (1984) (1)
Leading Data Science and Computing at UC Berkeley (2021) (1)
Graph Agnostic Randomized Experimental Design under Heterogeneous Linear Network Interference (2021) (1)
Correlation lenght of the high density phase of Bernoulli percolation (1989) (1)
The Road for Recovery: Aligning COVID-19 efforts and building a more resilient future (2020) (1)
Eisenbud Lectures in Mathematics and Physics (2011) (0)
Nuclear Physics B235 [FSll] (1984) 19-23 © North-Holland Pubhshing Company THE CORRECT EXTENSION OF THE FORTUIN-KASTELEYN RESULT TO PLAQUE'I~E PERCOLATION (1983) (0)
Modeling of the directed scale-free object relationships (2004) (0)
MSR-TR-98-27 Finite-Size Scaling in Percolation (1998) (0)
SU2C Cancer Susceptibility Convergence Research Team: “Correlating Immunological Health to Cancer Susceptibility” (2018) (0)
Self-organized criticality in sandpiles - Nature of the critical phenomenon. [dynamic models in phase transition (1990) (0)
Graph Agnostic Randomized Experimental Design (2022) (0)
ControlFlag: A Self-supervised Idiosyncratic Pattern Detection System for Software Control Structures (2020) (0)
Basic Research, Hidden Returns (2010) (0)
Ip1 Structural and Logical Approaches to the Graph Isomorphism Problem Ip2 Belief Propagation Algorithms: from Matching to Cancer Genomics Cp1 Dimension Reduction for Finite Trees in L1 (2011) (0)
PR ] 2 J ul 2 01 9 A CORRECTION TO KALLENBERG ’ S THEOREM FOR JOINTLY EXCHANGEABLE RANDOM MEASURES By (2019) (0)
The Inverse Problem, Plaquette Percolation and a Generalized Potts Model. (1983) (0)
Book Reviews (2003) (0)
Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point (2010) (0)
MSR-TR-99-62 ANISOTROPIC SELF-AVOIDING WALKS (1999) (0)
A Conversation with Michael V. Drake and Jennifer Chayes (2021) (0)
ST ] 2 2 A ug 2 01 9 Iterative Collaborative Filtering for Sparse Matrix Estimation (2019) (0)
Generalization (2020) (0)
ACM at 75 (2022) (0)
ST ] 3 0 O ct 2 01 8 Private Algorithms Can be Always Extended (2018) (0)
In Memoriam: Freeman Dyson (1923–2020) (2021) (0)
Uniform Boundedness of Crossing Probabilities Implies Hyperscaling (2016) (0)
MSR-TR-98-47 Mean-field lattice trees (1999) (0)
119th Statistical Mechanics Conference Rutgers University, Busch Campus, Hill Center Room 114, Sunday—Tuesday, May 6–8, 2018 Guests of Honor: Michael Aizenman, Paul Chaikin, and Jennifer Chayes (2018) (0)
The Hitchhiker's Guide to A-liation Networks: A Game-Theoretic Approach (2011) (0)
05w5025 Critical Scaling for Polymers and Percolation (0)
Mandelbrot ' s Percolation Process 309 The last formula (2004) (0)
Phase Transitions in Computer Science (2002) (0)
Graphons and graphexes as limits of sparse graphs - lecture 1 (2018) (0)

This paper list is powered by the following services:

Other Resources About Jennifer Tour Chayes

en.wikipedia.org

What Schools Are Affiliated With Jennifer Tour Chayes?

Jennifer Tour Chayes is affiliated with the following schools:

Image Attributions

Image Source for Jennifer Tour Chayes