Abbas Mehrabian

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 40

Top Topics

Top Venues

Random Struct. Algorithms

SIAM J. Discret. Math.

Publications

Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe Comanici, Tudor Berariu, Andrew Lee, Anian Ruoss, Anna Bulanova, Daniel Toyama, Sam Blackwell, Bernardino Romera-Paredes, Petar Velickovic, Laurent Orseau, Joonkyung Lee, Anurag Murty Naredla, Doina Precup, Adam Zsolt Wagner
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. CoRR (2023)
Gábor Lugosi, Abbas Mehrabian
Multiplayer Bandits Without Observing Collision Information. Math. Oper. Res. 47 (2) (2022)
Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni
Regret Bounds for Batched Bandits. AAAI (2021)
Abbas Mehrabian, Etienne Boursier, Emilie Kaufmann, Vianney Perchet
A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players. AISTATS (2020)
Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes. J. ACM 67 (6) (2020)
Sharan Vaswani, Abbas Mehrabian, Audrey Durand, Branislav Kveton
Old Dog Learns New Tricks: Randomized UCB for Bandit Problems. AISTATS (2020)
Omer Angel, Abbas Mehrabian, Yuval Peres
The string of diamonds is nearly tight for rumour spreading. Comb. Probab. Comput. 29 (2) (2020)
Emilie Kaufmann, Abbas Mehrabian
New Algorithms for Multiplayer Bandits when Arm Means Vary Among Players. CoRR (2019)
Hossein Esfandiari, Amin Karbasi, Abbas Mehrabian, Vahab S. Mirrokni
Batched Multi-Armed Bandits with Optimal Regret. CoRR (2019)
Sharan Vaswani, Abbas Mehrabian, Audrey Durand, Branislav Kveton
Old Dog Learns New Tricks: Randomized UCB for Bandit Problems. CoRR (2019)
Peter L. Bartlett, Nick Harvey, Christopher Liaw, Abbas Mehrabian
Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks. J. Mach. Learn. Res. 20 (2019)
Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed
Notes on growing a tree in a graph. Random Struct. Algorithms 55 (2) (2019)
Luc Devroye, Abbas Mehrabian, Tommy Reddad
The Minimax Learning Rate of Normal and Ising Undirected Graphical Models. CoRR (2018)
Gábor Lugosi, Abbas Mehrabian
Multiplayer bandits without observing collision information. CoRR (2018)
Hassan Ashtiani, Shai Ben-David, Abbas Mehrabian
Sample-Efficient Learning of Mixtures. AAAI (2018)
Hassan Ashtiani, Abbas Mehrabian
Some techniques in density estimation. CoRR (2018)
Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan
Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes. NeurIPS (2018)
Hassan Ashtiani, Shai Ben-David, Abbas Mehrabian
Sample-Efficient Learning of Mixtures. CoRR (2017)
Nick Harvey, Christopher Liaw, Abbas Mehrabian
Nearly-tight VC-dimension bounds for piecewise linear neural networks. COLT (2017)
Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed
Notes on Growing a Tree in a Graph. CoRR (2017)
Petra Berenbrink, Peter Kling, Christopher Liaw, Abbas Mehrabian
Tight Load Balancing Via Randomized Local Search. IPDPS (2017)
Nick Harvey, Christopher Liaw, Abbas Mehrabian
Nearly-tight VC-dimension bounds for piecewise linear neural networks. CoRR (2017)
Omer Angel, Abbas Mehrabian, Yuval Peres
The String of Diamonds Is Tight for Rumor Spreading. APPROX-RANDOM (2017)
Hassan Ashtiani, Shai Ben-David, Abbas Mehrabian
Agnostic Distribution Learning via Compression. CoRR (2017)
Omer Angel, Abbas Mehrabian, Yuval Peres
The string of diamonds is tight for rumor spreading. CoRR (2017)
Abbas Mehrabian
Justifying the small-world phenomenon via random recursive trees. Random Struct. Algorithms 50 (2) (2017)
Petra Berenbrink, Peter Kling, Christopher Liaw, Abbas Mehrabian
Tight Load Balancing via Randomized Local Search. CoRR (2017)
Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald
On the Push&Pull Protocol for Rumor Spreading. SIAM J. Discret. Math. 31 (2) (2017)
Jeannette C. M. Janssen, Abbas Mehrabian
Rumors Spread Slowly in a Small-World Spatial Network. SIAM J. Discret. Math. 31 (4) (2017)
Abbas Mehrabian, Nick Wormald
It's a Small World for Random Surfers. Algorithmica 76 (2) (2016)
Christopher Liaw, Abbas Mehrabian, Yaniv Plan, Roman Vershynin
A simple tool for bounding the deviation of random matrices on geometric sets. CoRR (2016)
Andrea Collevecchio, Abbas Mehrabian, Nick Wormald
Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees. J. Appl. Probab. 53 (3) (2016)
Jeannette C. M. Janssen, Abbas Mehrabian
Rumours spread slowly in a small world spatial network. CoRR (2016)
Abbas Mehrabian, Ali Pourmiri
Randomized rumor spreading in poorly connected small-world networks. Random Struct. Algorithms 49 (1) (2016)
Abbas Mehrabian
The fast robber on interval and chordal graphs. Discret. Appl. Math. 180 (2015)
Saieed Akbari, Akbar Daemi, Omid Hatami, Adel Javanmard, Abbas Mehrabian
Nowhere-zero Unoriented Flows in Hamiltonian Graphs. Ars Comb. 120 (2015)
Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald
On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract]. PODC (2015)
Noga Alon, Abbas Mehrabian
Chasing a Fast Robber on Planar Graphs and Random Graphs. J. Graph Theory 78 (2) (2015)
Jeannette C. M. Janssen, Abbas Mehrabian
Rumours Spread Slowly in a Small World Spatial Network. WAW (2015)
Shayan Ehsani, Saber Shokat Fadaee, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, Mohammad Ali Safari, Morteza Saghafian
A Bounded Budget Network Creation Game. ACM Trans. Algorithms 11 (4) (2015)
Abbas Mehrabian, Ali Pourmiri
Randomized Rumor Spreading in Poorly Connected Small-World Networks. CoRR (2014)
Abbas Mehrabian, Nick Wormald
It's a Small World for Random Surfers. APPROX-RANDOM (2014)
Abbas Mehrabian, Ali Pourmiri
Randomized Rumor Spreading in Poorly Connected Small-World Networks. DISC (2014)
Abbas Mehrabian
Justifying the small-world phenomenon via random recursive trees. CoRR (2014)
Abbas Mehrabian, Nick Wormald
It's a Small World for Random Surfers. CoRR (2014)
Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald
On the push&pull protocol for rumour spreading. CoRR (2014)
Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung
On longest paths and diameter in random apollonian network. Random Struct. Algorithms 45 (4) (2014)
Abbas Mehrabian, Nick Wormald
On the Stretch Factor of Randomly Embedded Random Graphs. Discret. Comput. Geom. 49 (3) (2013)
Abbas Mehrabian, Dieter Mitsche, Pawel Pralat
On the Maximum Density of Graphs with Unique-Path Labelings. SIAM J. Discret. Math. 27 (3) (2013)
Ehsan Ebrahimzadeh, Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane M. Sato, Nick Wormald, Jonathan Zung
On the Longest Paths and the Diameter in Random Apollonian Networks. Electron. Notes Discret. Math. 43 (2013)
Abbas Mehrabian
On the Density of Nearly Regular Graphs with a Good Edge-Labeling. SIAM J. Discret. Math. 26 (3) (2012)
Soroush Alamdari, Abbas Mehrabian
On a DAG Partitioning Problem. WAW (2012)
Abbas Mehrabian, Nick Wormald
On the Stretch Factor of Randomly Embedded Random Graphs CoRR (2012)
Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee
On a bounded budget network creation game. SPAA (2011)
Abbas Mehrabian
The capture time of grids. Discret. Math. 311 (1) (2011)
Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee
On a Bounded Budget Network Creation Game CoRR (2011)
Noga Alon, Abbas Mehrabian
On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game. Electron. J. Comb. 18 (1) (2011)
Abbas Mehrabian
A Randomly Embedded Random Graph is Not a Spanner. CCCG (2011)
Abbas Mehrabian
Lower Bounds for the Cop Number when the Robber is Fast. Comb. Probab. Comput. 20 (4) (2011)
Abbas Mehrabian
Pursuing a Superfast Robber in an Interval Graph CoRR (2010)
Saieed Akbari, Akbar Daemi, Omid Hatami, Adel Javanmard, Abbas Mehrabian
Zero-Sum Flows in Regular Graphs. Graphs Comb. 26 (5) (2010)