Research Output per year

## Fingerprint Weighted list of dominant concepts in the researcher's publications (titles and abstracts).

- 3 Similar Profiles

Random Graphs
Mathematics

Mixing Time
Mathematics

Glauber Dynamics
Mathematics

Ising Model
Mathematics

Graph in graph theory
Mathematics

Potts Model
Mathematics

Regular Graph
Mathematics

Simple Random Walk
Mathematics

##
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.

## Research Output 2001 2019

## Comparing mixing times on sparse random graphs

Ben-Hamou, A., Lubetzky, E. & Peres, Y., May 1 2019, In : Annales de l'institut Henri Poincare (B) Probability and Statistics. 55, 2, p. 1116-1130 15 p.Research output: Contribution to journal › Article

Mixing Time

Simple Random Walk

Sparse Graphs

Random Graphs

Entropy

## Optimal freshness crawl under politeness constraints

Kolobov, A., Lubetzky, E., Peres, Y. & Horvitz, E., Jul 18 2019,*SIGIR 2019 - Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval.*Association for Computing Machinery, Inc, p. 495-504 10 p. (SIGIR 2019 - Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Budget control

Lagrange multipliers

Convex optimization

Search engines

Convex Optimization

## Quasi-polynomial mixing of critical two-dimensional random cluster models

Gheissari, R. & Lubetzky, E., Jan 1 2019, In : Random Structures and Algorithms.Research output: Contribution to journal › Article

Random-cluster Model

Potts model

Polynomials

Upper bound

Glauber Dynamics

## A large deviation principle for the Erdős–Rényi uniform random graph

Dembo, A. & Lubetzky, E., Jan 1 2018, In : Electronic Communications in Probability. 23, 79.Research output: Contribution to journal › Article

Large Deviation Principle

Random Graphs

Uniform distribution

Variational Problem

Subgraph

## Comparing mixing times on sparse random graphs

Ben-Hamou, A., Lubetzky, E. & Peres, Y., Jan 1 2018,*29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018.*Association for Computing Machinery, p. 1734-1740 7 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Mixing Time

Simple Random Walk

Sparse Graphs

Random Graphs

Galton-Watson Tree