Simi Haber

I'm a
faculty member in the mathematics department at Bar-Ilan
University.

I'm
interested in combinatorics and its applications for
network science, finite model theory, statistical mechanics and, well,
anything.

· In Preparation

· N. Schreiber, R.
Cohen, S. Haber, G. Amir, and B. Barzel, On the changeover in
the transition nature of local-interaction Potts models

· S. Haber, D. Libman, M. Schaps, Volume prediction with neural
networks.

· Publications

· N. Balashov, R. Cohen, A. Haber, M. Krivelevich and S. Haber, Optimal shattering of complex
networks.

Applied Network Science. Accepted

· C. Hens, U. Harush, S. Haber, R. Cohen and B. Barzel, Spatiotemporal
signal propagation in complex networks.

Nature Physics 15, 403–412
(2019).

· N. Schreiber, R.
Cohen and S. Haber, Ferromagnetic
Potts models with multisite interaction.

Phys. Rev. E, 97:032106
(2018)

· M. Feres, Y. Louzoun, S. Haber, M. Faveri,
L. C. Figueiredo and L. Levin, Support vector machine-based
differentiation between aggressive and chronic periodontitis using microbial
profiles.

International Dental Journal 68, 39–46
(2018)

· A. Weizmann, O.
Dunkelman and S. Haber, Efficient
Construction of Diamond Structures.

Proceedings of Progress in Cryptology. Lecture Notes in Computer Science 10698,
166–185
(2017).

· S. Haber and S. Shelah, An
extension of the Ehrenfeucht-Fraı̈ssé
game for first order logics augmented with Lindström
quantifiers.

Fields of Logic and Computation II, 226–236
(2015).

· C. Boutilier, I. Caragiannis, S.
Haber, T. Lu, A. D. Procaccia, and O. Sheffet, Optimal
social choice functions: a utilitarian view.

Artificial Intelligence 227, 190–213 (2015).
Supersedes the EC-12 paper below.

· A. Frieze and S.
Haber, An almost linear time
algorithm for finding Hamilton cycles in sparse random graphs with minimum
degree at least three.

Random Structures and Algorithms 47, 73–98
(2015).

· A. Frieze, S.
Haber and M. Lavrov, On
the game chromatic number of sparse random graphs.

SIAM Journal on Discrete Mathematics, 27, 768–790 (2013)

·
C. Boutilier, I. Caragiannis, S. Haber, T. Lu, A. D. Procaccia,
and O. Sheffet, Optimal social choice
functions: a utilitarian view.

Proceedings of the 13th ACM Conference on Electronic Commerce 197–214 (2012).

· N. Alon, S.
Haber and M. Krivelevich, The
number of F-matchings in almost every tree is a zero residue.** **

Electronic Journal of Combinatorics, Volume 18 (1), publication P30
(2011).

· S. Haber and M.
Krivelevich, **The logic of random regular graphs. **

Journal of Combinatorics 1, 389–440 (2010).

· I. Benjamini, S. Haber, M. Krivelevich and E. Lubetzky, **The isoperimetric constant of the random graph
process. **

Random Structures and Algorithms 32, 101–114
(2008).

· S. Haber and M.
Krivelevich, **On fractional K-factors of random graphs. **

Random Structures and Algorithms 30, 441–463
(2007).

My Google
Scholar page. My arXiv page is not updated yet,
but check again soon!