GFGadi Fibich

Gadi Fibich

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Gadi Fibich has a total of 158 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Phase transition in the susceptible-infected model on hypernetworks

    by Gadi Fibich, Guy Rothmann

    We derive the master equations for the Susceptible-Infected (SI) model on general hypernetworks with N-body interactions. We solve these equations exactly for infinite d-regular hypernetworks, and obtain an explicit solution for the expected infection level as a function of time. The solution shows that the epidemic spreads out to the entire population as t→∞ if and only if the initial infection level exceeds a positive threshold value. This phase transition is a high-order interaction effect, which is absent with pairwise interactions.

  • Open Access

    Funnel theorems for spreading on networks

    by Gadi Fibich, Tomer Levin, Steven Schochet

    We derive the funnel theorems for the Bass and susceptible–infected models on networks that describe the spreading of innovations and epidemics. Let j be a node and divide the remaining nodes into L≥2 disjoint sets {Al}l=1L. The funnel theorems provide lower and upper bounds for the difference between the susceptibility probability of j and the product of its susceptibility probability on the L modified networks in which j can only be influenced by incoming edges from Al. In particular, one can let L be equal to the indegree of j, so that in the modified networks, j is only influenced by one incoming edge. We illustrate how the funnel theorems can be used to obtain exact explicit expressions for the adoption/infection probabilities of nodes and for the expected adoption/infection level in various types of networks, both with and without cycles.


  • Boundary Effects in the Diffusion of New Products on Cartesian Networks

    by Gadi Fibich, Tomer Levin, Kenneth T. Gillingham

    The Role of Boundaries in the Spreading of Solar Peer effects by neighbors play a key role in the spreading of residential solar. Thus, people are more likely to install a solar system on their roof if some of their neighbors have already done so. Because people who live near the municipality boundary have fewer neighbors, does this imply that they are less likely to adopt solar? In “Boundary Effects in the Diffusion of New Products on Cartesian Networks,” Fibich, Levin, and Gillingham analyze this problem analytically using the Bass model on two-dimensional networks and empirically using data on installations of solar systems. They show that boundaries have a significant impact on the adoption of residential units near the municipality boundary. Their effect on the aggregate adoption in the municipality, however, is negligible.


  • Open Access

    A phase transition in the Susceptible-Infected model on hypernetworks

    by Gadi Fibich, Guy Rothmann

    We derive the master equations for the Susceptible-Infected (SI) model on general hypernetworks with~$N$-body interactions. We solve these equations exactly for infinite~$d$-regular hypernetworks, and obtain an explicit solution for the expected infection level as a function of time. The solution shows that the epidemic spreads out to the entire population as~$t \to \infty$ if and only if the initial infection level exceeds a positive threshold value. This phase transition is a high-order interactions effect, which is absent with pairwise interactions.

  • Explicit solutions of the Bass and susceptible-infected models on hypernetworks

    by Gadi Fibich, Juan G. Restrepo, Guy Rothmann

    We analyze the Bass model and the susceptible-infected model on hypernetworks with three-body interactions. We derive the master equations for general hypernetworks and use them to obtain explicit expressions for the expected adoption-infection level on infinite complete hypernetworks, infinite Erdős-Rényi hypernetworks, and on infinite hyperlines. These expressions are exact, as they are derived without making any approximation.


  • Open Access

    Explicit solutions of the SI and Bass models on sparse Erdős-Rényi and regular networks

    by Gadi Fibich, Yonatan Warman

    We derive explicit expressions for the expected adoption and infection level in the Bass and SI models, respectively, on sparse Erdős-Rényi networks and on $d$-regular networks. These expressions are soloutions of first-order ordinary differential equations, which are fairly easy to analyze. To prove that these expressions are exact, we show that the effect of cycles vanishes as the network size goes to infinity.

  • Open Access

    Funnel theorems for spreading on networks

    by Gadi Fibich, Tomer Levin, Steven Schochet

    We derive novel analytic tools for the Bass and SI models on networks for the spreading of innovations and epidemics on networks. We prove that the correlation between the nonadoption (noninfection) probabilities of $L \ge 2$ disjoint subsets of nodes $\{A_l\}_{l=1}^L$ is non-negative, find the necessary and sufficient condition that determines whether this correlation is positive or zero, and provide an upper bound for its magnitude. Using this result, we prove the funnel theorems, which provide lower and upper bounds for the difference between the non-adoption probability of a node and the product of its nonadoption probabilities on $L$ modified networks in which the node under consideration is only influenced by incoming edges from $A_l$ for $l=1, \dots, L$. The funnel theorems can be used, among other things, to explicitly compute the exact expected adoption/infection level on various types of networks, both with and without cycles.

  • Open Access

    Explicit solutions of the Bass and SI models on hypernetworks

    by Gadi Fibich, Juan G. Restrepo, Guy Rothmann

    We analyze the Bass model and the Susceptible-Infected (SI) model on hypergraphs with 3-body interactions. We derive the master equations for general hypernetworks, and use them to obtain explicit expressions for the expected adoption/infection level on infinite complete hypernetworks, infinite Erdős-Rényi hypernetworks, and on infinite hyperlines. These expressions are exact, as they are derived without making any approximation.

  • Open Access

    Universal bounds for spreading on networks

    by Gadi Fibich, Tomer Levin

    Spreading (diffusion) of innovations is a stochastic process on social networks. When the key driving mechanism is the peer effect (word of mouth), the rate at which the aggregate adoption level increases with time depends strongly on the network structure. In many applications, however, the network structure is unknown. To estimate the aggregate adoption level as a function of time for such innovations, we show that the minimal and maximal adoption levels are attained on a homogeneous two-node network and on a homogeneous infinite complete network, respectively. Solving the Bass model on these two networks yields explicit lower and upper bounds for the expected adoption level on any network. These bounds are tight, and they also hold for the individual adoption probabilities of nodes. The gap between the lower and upper bounds increases monotonically with the ratio of the rates of internal and external influences.