Exponentially Long Transient Time to Synchronization of Coupled Chaotic Circle Maps in Dense Random Networks

We study the transition to synchronization in large, dense networks of chaotic circle maps, where an exact solution of the mean-field dynamics in the infinite network and all-to-all coupling limit is known. In dense networks of finite size and link probability of smaller than one, the incoherent state is meta-stable for coupling strengths that are larger than the mean-field critical coupling. We observe chaotic transients with exponentially distributed escape times and study the scaling behavior of the mean time to synchronization.

Predicting alveolar ventilation heterogeneity in pulmonary fibrosis using a non-uniform polyhedral spring network model

Pulmonary Fibrosis (PF) is a deadly disease that has limited treatment options and is caused by excessive deposition and cross-linking of collagen leading to stiffening of the lung parenchyma. The link between lung structure and function in PF remains poorly understood, although its spatially heterogeneous nature has important implications for alveolar ventilation. Computational models of lung parenchyma utilize uniform arrays of space-filling shapes to represent individual alveoli, but have inherent anisotropy, whereas actual lung tissue is isotropic on average. We developed a novel Voronoi-based 3D spring network model of the lung parenchyma, the Amorphous Network, that exhibits more 2D and 3D similarity to lung geometry than regular polyhedral networks. In contrast to regular networks that show anisotropic force transmission, the structural randomness in the Amorphous Network dissipates this anisotropy with important implications for mechanotransduction. We then added agents to the network that were allowed to carry out a random walk to mimic the migratory behavior of fibroblasts. To model progressive fibrosis, agents were moved around the network and increased the stiffness of springs along their path. Agents migrated at various path lengths until a certain percentage of the network was stiffened. Alveolar ventilation heterogeneity increased with both percent of the network stiffened, and walk length of the agents, until the percolation threshold was reached. The bulk modulus of the network also increased with both percent of network stiffened and path length. This model thus represents a step forward in the creation of physiologically accurate computational models of lung tissue disease.

Alternative COVID-19 mitigation measures in school classrooms: analysis using an agent-based model of SARS-CoV-2 transmission

The SARS-CoV-2 epidemic has impacted children's education, with schools required to implement infection control measures that have led to periods of absence and classroom closures. We developed an agent-based epidemiological model of SARS-CoV-2 transmission in a school classroom that allows us to quantify projected infection patterns within primary school classrooms, and related uncertainties. Our approach is based on a contact model constructed using random networks, informed by structured expert judgement. The effectiveness of mitigation strategies in suppressing infection outbreaks and limiting pupil absence are considered. COVID-19 infections in primary schools in England in autumn 2020 were re-examined and the model was then used to estimate infection levels in autumn 2021, as the Delta variant was emerging and it was thought likely that school transmission would play a major role in an incipient new wave of the epidemic. Our results were in good agreement with available data. These findings indicate that testing-based surveillance is more effective than bubble quarantine, both for reducing transmission and avoiding pupil absence, even accounting for insensitivity of self-administered tests. Bubble quarantine entails large numbers of absences, with only modest impact on classroom infections. However, maintaining reduced contact rates within the classroom can have a major benefit for managing COVID-19 in school settings.

Causality in Reversed Time Series: Reversed or Conserved?

The inference of causal relations between observable phenomena is paramount across scientific disciplines; however, the means for such enterprise without experimental manipulation are limited. A commonly applied principle is that of the cause preceding and predicting the effect, taking into account other circumstances. Intuitively, when the temporal order of events is reverted, one would expect the cause and effect to apparently switch roles. This was previously demonstrated in bivariate linear systems and used in design of improved causal inference scores, while such behaviour in linear systems has been put in contrast with nonlinear chaotic systems where the inferred causal direction appears unchanged under time reversal. The presented work explores the conditions under which the causal reversal happens—either perfectly, approximately, or not at all—using theoretical analysis, low-dimensional examples, and network simulations, focusing on the simplified yet illustrative linear vector autoregressive process of order one. We start with a theoretical analysis that demonstrates that a perfect coupling reversal under time reversal occurs only under very specific conditions, followed up by constructing low-dimensional examples where indeed the dominant causal direction is even conserved rather than reversed. Finally, simulations of random as well as realistically motivated network coupling patterns from brain and climate show that level of coupling reversal and conservation can be well predicted by asymmetry and anormality indices introduced based on the theoretical analysis of the problem. The consequences for causal inference are discussed.

Normalized Sombor Indices as Complexity Measures of Random Networks

We perform a detailed computational study of the recently introduced Sombor indices on random networks. Specifically, we apply Sombor indices on three models of random networks: Erdös-Rényi networks, random geometric graphs, and bipartite random networks. Within a statistical random matrix theory approach, we show that the average values of Sombor indices, normalized to the order of the network, scale with the average degree. Moreover, we discuss the application of average Sombor indices as complexity measures of random networks and, as a consequence, we show that selected normalized Sombor indices are highly correlated with the Shannon entropy of the eigenvectors of the adjacency matrix.

Phase diagrams of the Ziff-Gulari-Barshad model on random networks

In this study, we revisited the Ziff-Gulari-Barshad (ZGB) model in order to study the behavior of its phase diagram when two well-known random networks play the role of the catalytic surfaces: the random geometric graph and the Erdös-Rényi network. The connectivity and, therefore, the average number of neighbors of the nodes of these networks can vary according to their control parameters, the neighborhood radius α, and the linking probability p, respectively. In addition, the catalytic reactions of the ZGB model are governed by the parameter y, the adsorption rate of carbon monoxide molecules on the catalytic surface. So, to study the phase diagrams of the model on both random networks, we carried out extensive steady-state Monte Carlo simulations in the space parameters (y, α) and (y, p) and showed that the continuous phase transition is greatly affected by the topological features of the networks while the discontinuous one remains present in the diagram throughout the interval of study.

The transsortative structure of networks

Network topologies can be highly non-trivial, due to the complex underlying behaviours that form them. While past research has shown that some processes on networks may be characterized by local statistics describing nodes and their neighbours, such as degree assortativity, these quantities fail to capture important sources of variation in network structure. We define a property called transsortativity that describes correlations among a node's neighbours. Transsortativity can be systematically varied, independently of the network's degree distribution and assortativity. Moreover, it can significantly impact the spread of contagions as well as the perceptions of neighbours, known as the majority illusion. Our work improves our ability to create and analyse more realistic models of complex networks.

Emergence of Mixed Mode Oscillations in Random Networks of Diverse Excitable Neurons: The Role of Neighbors and Electrical Coupling

In this paper, we focus on the emergence of diverse neuronal oscillations arising in a mixed population of neurons with different excitability properties. These properties produce mixed mode oscillations (MMOs) characterized by the combination of large amplitudes and alternate subthreshold or small amplitude oscillations. Considering the biophysically plausible, Izhikevich neuron model, we demonstrate that various MMOs, including MMBOs (mixed mode bursting oscillations) and synchronized tonic spiking appear in a randomly connected network of neurons, where a fraction of them is in a quiescent (silent) state and the rest in self-oscillatory (firing) states. We show that MMOs and other patterns of neural activity depend on the number of oscillatory neighbors of quiescent nodes and on electrical coupling strengths. Our results are verified by constructing a reduced-order network model and supported by systematic bifurcation diagrams as well as for a small-world network. Our results suggest that, for weak couplings, MMOs appear due to the de-synchronization of a large number of quiescent neurons in the networks. The quiescent neurons together with the firing neurons produce high frequency oscillations and bursting activity. The overarching goal is to uncover a favorable network architecture and suitable parameter spaces where Izhikevich model neurons generate diverse responses ranging from MMOs to tonic spiking.

Diffusion in networks and the virtue of burstiness

Whether an idea, information, or infection diffuses throughout a society depends not only on the structure of the network of interactions, but also on the timing of those interactions. People are not always available to interact with others, and people differ in the timing of when they are active. Some people are active for long periods and then inactive for long periods, while others switch more frequently from being active to inactive and back. We show that maximizing diffusion in classic contagion processes requires heterogeneous activity patterns across agents. In particular, maximizing diffusion comes from mixing two extreme types of people: those who are stationary for long periods of time, changing from active to inactive or back only infrequently, and others who alternate frequently between being active and inactive.

Self-Assembled Molecular Nanowires for High-Performance Organic Transistors

While organic semiconductors provide tantalizing possibilities for low-cost, light-weight, flexible electronic devices, their current use in transistors-the fundamental building block-is rather limited as their speed and reliability are not competitive with those of their inorganic counterparts and are simply too poor for many practical applications. Through self-assembly, highly ordered nanostructures can be prepared that have more competitive transport characteristics; however, no simple, scalable method has been discovered that can produce devices on the basis of such nanostructures. Here, we show how transistors of self-assembled molecular nanowires can be fabricated using a scalable, gradient sublimation technique, which have dramatically improved characteristics compared to those of their thin-film counterparts, both in terms of performance and stability. Nanowire devices based on copper phthalocyanine have been fabricated with threshold voltages as low as -2.1 V, high on/off ratios of 10⁵, small subthreshold swings of 0.9 V/decade, and mobilities of 0.6 cm²/V s, and lower trap energies as deduced from temperature-dependent properties, in line with leading organic semiconductors involving more complex fabrication. High-performance transistors manufactured using our scalable deposition technique, compatible with flexible substrates, could enable integrated all-organic chips implementing conventional as well as neuromorphic computation and combining sensors, logic, data storage, drivers, and displays.

Creating, generating and comparing random network models with NetworkRandomizer

Biological networks are becoming a fundamental tool for the investigation of high-throughput data in several fields of biology and biotechnology. With the increasing amount of information, network-based models are gaining more and more interest and new techniques are required in order to mine the information and to validate the results. To fill the validation gap we present an app, for the Cytoscape platform, which aims at creating randomised networks and randomising existing, real networks. Since there is a lack of tools that allow performing such operations, our app aims at enabling researchers to exploit different, well known random network models that could be used as a benchmark for validating real, biological datasets. We also propose a novel methodology for creating random weighted networks, i.e. the multiplication algorithm, starting from real, quantitative data. Finally, the app provides a statistical tool that compares real versus randomly computed attributes, in order to validate the numerical findings. In summary, our app aims at creating a standardised methodology for the validation of the results in the context of the Cytoscape platform.

Creating, generating and comparing random network models with NetworkRandomizer

Biological networks are becoming a fundamental tool for the investigation of high-throughput data in several fields of biology and biotechnology. With the increasing amount of information, network-based models are gaining more and more interest and new techniques are required in order to mine the information and to validate the results. To fill the validation gap we present an app, for the Cytoscape platform, which aims at creating randomised networks and randomising existing, real networks. Since there is a lack of tools that allow performing such operations, our app aims at enabling researchers to exploit different, well known random network models that could be used as a benchmark for validating real, biological datasets. We also propose a novel methodology for creating random weighted networks, i.e. the multiplication algorithm, starting from real, quantitative data. Finally, the app provides a statistical tool that compares real versus randomly computed attributes, in order to validate the numerical findings. In summary, our app aims at creating a standardised methodology for the validation of the results in the context of the Cytoscape platform.

On the selection of transmission range in underwater acoustic sensor networks

Transmission range plays an important role in the deployment of a practical underwater acoustic sensor network (UWSN), where sensor nodes equipping with only basic functions are deployed at random locations with no particular geometrical arrangements. The selection of the transmission range directly influences the energy efficiency and the network connectivity of such a random network. In this paper, we seek analytical modeling to investigate the tradeoff between the energy efficiency and the network connectivity through the selection of the transmission range. Our formulation offers a design guideline for energy-efficient packet transmission operation given a certain network connectivity requirement.