It is well known that the G(n, p) model of random graphs undergoes a dramatic change
around $p = \tfrac{1}{n}$. It is here that the random graph, almost surely, contains cycles, and …

For a graph G, let be the probability that three distinct random vertices span exactly i edges.
We call the 3‐local profile of G. We investigate the set of all vectors that are arbitrarily close …

Until recently, it was widely accepted that bacteria participate in caries pathogenesis mainly
through carbohydrate fermentation and acid production, which promote the dissolution of …

Let G = (V, E) be a finite graph. For v ∈ V we denote by G v the subgraph of G that is induced
by v’s neighbor set. We say that G is (a,b)-regular for a>b> 0 integers, if G is a-regular and …

Over 30 years ago, Kalai proved a beautiful d‐dimensional analog of Cayley's formula for
the number of n‐vertex trees. He enumerated d‐dimensional hypertrees weighted by the …

… Omer Israeli and Yuval Peled … and Peled, Y. (2022) Noise sensitivity of critical random
graphs. Isr. … Cite this article: Israeli O and Peled Y (2024). Noise sensitivity of the …

The electoral success of Shas, a mizrahi, religious political party in Israel is analysed with the
help of the cultural division of labour model. Mizrahim (Jews originating in Muslim countries…

We study noise sensitivity of properties of the largest components \documentclass[12pt]{minimal}
\usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{…

I read Adi Keissar’s poetry for the first time at fifteen years old, when my mother forwarded me
a link to Haaretz’s Poem of the Week under the headline “Who’s who? Who’s an Arab, who’…

A stacked triangulation of a $d$ -simplex $\mathbf {o}=\{1,\ldots ,d+1\}$ ( $d\geq 2$ ) is a
triangulation obtained by repeatedly subdividing a $d$ -simplex into $d+1$ new ones via a new …