Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Item Type
      Item Type
      Clear All
      Item Type
  • Subject
      Subject
      Clear All
      Subject
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
194 result(s) for "Cohen, Reuven"
Sort by:
Emergent coordination in temporal partitioning congestion games
In this article we study the social dynamic of temporal partitioning congestion games (TPGs), in which participants must coordinate an optimal time-partitioning for using a limited resource. The challenge in TPGs lies in determining whether users can optimally self-organize their usage patterns. Reaching an optimal solution may be undermined, however, by a collectively destructive meta-reasoning pattern, trapping users in a socially vicious oscillatory behavior. TPGs constitute a dilemma for both human and animal communities. We developed a model capturing the dynamics of these games and ran simulations to assess its behavior, based on a 2×2 framework that distinguishes between the players’ knowledge of other players’ choices and whether they use a learning mechanism. We found that the only way in which an oscillatory dynamic can be thwarted is by adding learning, which leads to weak convergence in the no-information condition and to strong convergence in the with-information condition. We corroborated the validity of our model using real data from a study of bats’ behaviour in an environment of water scarcity. We conclude by examining the merits of a complexity-based, agent-based modelling approach over a game-theoretic one, contending that it offers superior insights into the temporal dynamics of TPGs. We also briefly discuss the policy implications of our findings.
Spatiotemporal signal propagation in complex networks
A major achievement in the study of complex networks is the realization that diverse systems, from sub-cellular biology to social networks, exhibit universal topological characteristics. Yet, such universality does not naturally translate to the dynamics of these systems, as dynamic behaviour cannot be uniquely predicted from topology alone. Rather, it depends on the interplay of the network’s topology with the dynamic mechanisms of interaction between the nodes. Hence, systems with similar structure may exhibit profoundly different dynamic behaviour. We therefore seek a general theoretical framework to help us systematically translate topological elements into their predicted dynamic outcome. Here, we offer such a translation in the context of signal propagation, linking the topology of a network to the observed spatiotemporal spread of perturbative signals across it, thus capturing the network’s role in propagating local information. For a range of nonlinear dynamic models, we predict that the propagation rules condense into three highly distinctive dynamic regimes, characterized by the interplay between network paths, degree distribution and the interaction dynamics. As a result, classifying a system’s intrinsic interaction mechanisms into the relevant dynamic regime allows us to systematically translate topology into dynamic patterns of information propagation.Complex networks with identical topology may exhibit different dynamics. A systematic analysis of signal propagation in networks reveals the existence of three specific dynamic regimes that connect topological features to dynamic patterns.
Spatio-temporal propagation of cascading overload failures in spatially embedded networks
Different from the direct contact in epidemics spread, overload failures propagate through hidden functional dependencies. Many studies focused on the critical conditions and catastrophic consequences of cascading failures. However, to understand the network vulnerability and mitigate the cascading overload failures, the knowledge of how the failures propagate in time and space is essential but still missing. Here we study the spatio-temporal propagation behaviour of cascading overload failures analytically and numerically on spatially embedded networks. The cascading overload failures are found to spread radially from the centre of the initial failure with an approximately constant velocity. The propagation velocity decreases with increasing tolerance, and can be well predicted by our theoretical framework with one single correction for all the tolerance values. This propagation velocity is found similar in various model networks and real network structures. Our findings may help to predict the dynamics of cascading overload failures in realistic systems. Overload failures propagate through hidden functional dependencies across networked systems. Here, the authors study the spatio-temporal propagation behaviour of cascading overload failures, and find that they spread radially from their origin with an approximately constant velocity.
Alternating quarantine for sustainable epidemic mitigation
Absent pharmaceutical interventions, social distancing, lock-downs and mobility restrictions remain our prime response in the face of epidemic outbreaks. To ease their potentially devastating socioeconomic consequences, we propose here an alternating quarantine strategy: at every instance, half of the population remains under lockdown while the other half continues to be active - maintaining a routine of weekly succession between activity and quarantine. This regime minimizes infectious interactions, as it allows only half of the population to interact for just half of the time. As a result it provides a dramatic reduction in transmission, comparable to that achieved by a population-wide lockdown, despite sustaining socioeconomic continuity at  ~50% capacity. The weekly alternations also help address the specific challenge of COVID-19, as their periodicity synchronizes with the natural SARS-CoV-2 disease time-scales, allowing to effectively isolate the majority of infected individuals precisely at the time of their peak infection. Absent a drug or vaccine, containing epidemic outbreaks is achieved by means of mobility restrictions and lock-downs. Here, the authors propose an alternating quarantine strategy, in which half of the population remains under lockdown while the other half continues to be active, resulting in a dramatic reduction in transmission.
Optimal resource allocation for network functionality
The traditional approach to network robustness, is based on comparing network parameters before and after an event of nodes removal, such as the change in network diameter, the change in giant component size and the existence of giant component. Compared to the traditional approach, there is a later and innovative approach to network robustness, where the network functionality during its entire life span (during the node removal event) is considered. This approach considers nodes removal due to aging-non functionality of nodes when their survival time duration-their lifetime-is passed. Accordingly, a problem that has to be solved is: in the network design stage, how to allocate a budget of lifetime between the network's nodes, such that the network functionality during all the stages of nodes removal due to aging, is maximized. To date, the problem has been solved only partially and numerically. In this paper we solve the problem analytically. Based on a local information only on the network's degree distribution pk without knowing the network's structure and topology, we derive a criterion for choosing the right set of nodes on which the total lifetime budget should be allocated, and find analytically the optimal way of allocating the lifetime budget between the chosen set's nodes, such that the network robustness with consideration to its functionality in the entire life span, is maximized.
Topological synchronization of chaotic systems
A chaotic dynamics is typically characterized by the emergence of strange attractors with their fractal or multifractal structure. On the other hand, chaotic synchronization is a unique emergent self-organization phenomenon in nature. Classically, synchronization was characterized in terms of macroscopic parameters, such as the spectrum of Lyapunov exponents. Recently, however, we attempted a microscopic description of synchronization, called topological synchronization , and showed that chaotic synchronization is, in fact, a continuous process that starts in low-density areas of the attractor. Here we analyze the relation between the two emergent phenomena by shifting the descriptive level of topological synchronization to account for the multifractal nature of the visited attractors. Namely, we measure the generalized dimension of the system and monitor how it changes while increasing the coupling strength. We show that during the gradual process of topological adjustment in phase space, the multifractal structures of each strange attractor of the two coupled oscillators continuously converge, taking a similar form, until complete topological synchronization ensues. According to our results, chaotic synchronization has a specific trait in various systems, from continuous systems and discrete maps to high dimensional systems: synchronization initiates from the sparse areas of the attractor, and it creates what we termed as the ‘zipper effect’, a distinctive pattern in the multifractal structure of the system that reveals the microscopic buildup of the synchronization process. Topological synchronization offers, therefore, a more detailed microscopic description of chaotic synchronization and reveals new information about the process even in cases of high mismatch parameters.
Distribution equality as an optimal epidemic mitigation strategy
Upon the development of a therapeutic, a successful response to a global pandemic relies on efficient worldwide distribution, a process constrained by our global shipping network. Most existing strategies seek to maximize the outflow of the therapeutics, hence optimizing for rapid dissemination. Here we find that this intuitive approach is, in fact, counterproductive. The reason is that by focusing strictly on the quantity of disseminated therapeutics, these strategies disregard the way in which this quantity distributes across destinations. Most crucially—they overlook the interplay of the therapeutic spreading patterns with those of the pathogens. This results in a discrepancy between supply and demand, that prohibits efficient mitigation even under optimal conditions of superfluous flow. To solve this, we design a dissemination strategy that naturally follows the predicted spreading patterns of the pathogens, optimizing not just for supply volume, but also for its congruency with the anticipated demand. Specifically, we show that epidemics spread relatively uniformly across all destinations, prompting us to introduce an equality constraint into our dissemination that prioritizes supply homogeneity. This strategy may, at times, slow down the supply rate in certain locations, however, thanks to its egalitarian nature, which mimics the flow of the pathogens, it provides a dramatic leap in overall mitigation efficiency, potentially saving more lives with orders of magnitude less resources.
Urban Energy Transitions: A Systematic Review
Urban energy efficiency and sustainability are critical challenges, as cities worldwide attempt to balance economic growth, environmental sustainability, and energy consumption. This systematic review examines the dynamics of urban energy management, focusing on how local authorities navigate energy transitions through efficiency measures, renewable energy adoption, and policy interventions. Specifically, it seeks to answer the following research question: how do local authorities implement energy-efficient practices and adopt renewable energy technologies to reduce emissions, optimize cost-effectiveness, and influence urban policy-making? The goal of this study is to assess the effectiveness of these approaches in different urban contexts. By reviewing 47 articles, this study identifies the unique characteristics of urban energy management and highlights the need for tailored, context-specific solutions, such as integrating decentralized renewable energy systems, optimizing building energy performance, and developing policy incentives that consider local socio-economic conditions. The findings reveal varying degrees of success among cities, with particular challenges in lower-income municipalities, where financial and institutional barriers hinder the implementation of sustainable energy projects. This study concludes that localized approaches and long-term strategies are essential for achieving sustainable urban energy transitions, offering a comprehensive perspective on the complexities of urban energy systems and their evolving policy landscape. Future research should focus on assessing the long-term impact of municipal energy policies, exploring innovative financing mechanisms for renewable energy integration, and examining the role of digital technologies in optimizing urban energy management.
On the Number of Spherical Circles Needed to Cover a Spherical Convex Domain
In this manuscript, we study the coverage of convex spherical domains by spherical circles. This question can be applied to the location of satellites, weather balloons, radio towers, etc. We present an upper bound on the number of spherical circles of radius r needed to cover a spherical convex domain K, in terms of the respective area and perimeter. Then, we calculate the asymptotic density of such cover, when the radius approaches zero.
K-shell decomposition reveals hierarchical cortical organization of the human brain
In recent years numerous attempts to understand the human brain were undertaken from a network point of view. A network framework takes into account the relationships between the different parts of the system and enables to examine how global and complex functions might emerge from network topology. Previous work revealed that the human brain features 'small world' characteristics and that cortical hubs tend to interconnect among themselves. However, in order to fully understand the topological structure of hubs, and how their profile reflect the brain's global functional organization, one needs to go beyond the properties of a specific hub and examine the various structural layers that make up the network. To address this topic further, we applied an analysis known in statistical physics and network theory as k-shell decomposition analysis. The analysis was applied on a human cortical network, derived from MRI\\DSI data of six participants. Such analysis enables us to portray a detailed account of cortical connectivity focusing on different neighborhoods of inter-connected layers across the cortex. Our findings reveal that the human cortex is highly connected and efficient, and unlike the internet network contains no isolated nodes. The cortical network is comprised of a nucleus alongside shells of increasing connectivity that formed one connected giant component, revealing the human brain's global functional organization. All these components were further categorized into three hierarchies in accordance with their connectivity profile, with each hierarchy reflecting different functional roles. Such a model may explain an efficient flow of information from the lowest hierarchy to the highest one, with each step enabling increased data integration. At the top, the highest hierarchy (the nucleus) serves as a global interconnected collective and demonstrates high correlation with consciousness related regions, suggesting that the nucleus might serve as a platform for consciousness to emerge.