Search

Synchronization is a fundamental dynamical state of interacting oscillators, observed in natural biological rhythms and in the brain. Global synchronization which occurs when non-linear or chaotic oscillators placed on the nodes of a network display the same dynamics as received great attention in network theory. Here we propose and investigate Global Topological Dirac Synchronization on higher-order networks such as cell and simplicial complexes. This is a state where oscillators associated to simplices and cells of arbitrary dimension, coupled by the Topological Dirac operator, operate at unison. By combining algebraic topology with non-linear dynamics and machine learning, we derive the topological conditions under which this state exists and the dynamical conditions under which it is stable. We provide evidence of 1-dimensional simplicial complexes (networks) and 2-dimensional simplicial and cell complexes where Global Topological Dirac Synchronization can be observed. Our results point out that Global Topological Dirac Synchronization is a possible dynamical state of simplicial and cell complexes that occur only in some specific network topologies and geometries, the latter ones being determined by the weights of the higher-order networks

Nonlinear metasurfaces offer a new paradigm to realize optical nonlinear devices with new and unparalleled behavior compared to nonlinear crystals, due to the interplay between photonic resonances and materials properties. The complicated interdependency between efficiency and emission directionality of the nonlinear optical signal on the existence, localization, and lifetimes of photonic resonances, as well as on the nonlinear susceptibility, makes it extremely difficult to design optimal metasurfaces using conventional materials and geometries. Inverse design using topology optimization is a powerful design tool for photonic structures, but traditional approaches developed for linear photonics are not suitable for such high dimensional nonlinear problems. Here, we use a topology optimization approach to inverse-design a fabrication-robust nonlinear metasurface that includes quantum-engineered resonant nonlinearities in semiconductor heterostructures for efficient and directional second harmonic generation. Furthermore, we also demonstrate that under practical constraints, among all the parameters, the nonlinear modal overlap emerges as the dominant parameter that enhances conversion efficiency, a finding that contrasts with intuition-driven studies that often emphasize Purcell enhancement. Our results open new opportunities for optimizing nonlinear processes in nanophotonic structures for novel light sources, quantum information applications, and communication.

Synchronization is a ubiquitous phenomenon in nature. Although it is necessary for the functioning of many systems, too much synchronization can also be detrimental, e.g., (partially) synchronized brain patterns support high-level cognitive processes and bodily control, but hypersynchronization can lead to epileptic seizures and tremors, as in neurodegenerative conditions such as Parkinson's disease. Consequently, a critical research question is how to develop effective pinning control methods capable to reduce or modulate synchronization as needed. Although such methods exist to control pairwise-coupled oscillators, there are none for higher-order interactions, despite the increasing evidence of their relevant role in brain dynamics. In this work, we fill this gap by proposing a generalized control method designed to desynchronize Kuramoto oscillators connected through higher-order interactions. Our method embeds a higher-order Kuramoto model into a suitable Hamiltonian flow, and builds up on previous work in Hamiltonian control theory to analytically construct a feedback control mechanism. We numerically show that the proposed method effectively prevents synchronization. Although our findings indicate that pairwise contributions in the feedback loop are often sufficient, the higher-order generalization becomes crucial when pairwise coupling is weak. Finally, we explore the minimum number of controlled nodes required to fully desynchronize oscillators coupled via an all-to-all hypergraphs.

Many natural and human-made complex systems feature group interactions that adapt over time in response to their dynamic states. However, most of the existing adaptive network models fall short of capturing these group dynamics, as they focus solely on pairwise interactions. In this study, we employ adaptive higher-order networks to describe these systems by proposing a general framework incorporating both adaptivity and group interactions. We demonstrate that global synchronization can exist in those complex structures, and we provide the necessary conditions for the emergence of a stable synchronous state. Additionally, we analyzed some relevant settings, and we showed that the necessary condition is strongly related to the master stability equation, allowing to separate the dynamical and structural properties. We illustrate our theoretical findings through examples involving adaptive higher-order networks of coupled generalized Kuramoto oscillators with phase lag. We also show that the interplay of group interactions and adaptive connectivity results in the formation of stability regions that can induce transitions between synchronization and desynchronization

Let $(M,g)$ be a closed Riemannian manifold of dimension $n$, and $k\geq 1$ an integer such that $n>2k$. We show that there exists $B_0>0$ such that for all $u \in H^{k}(M)$, \[\|u\|_{L^{2^\sharp}(M)}^2 \leq K_0^2 \int_M |\Delta_g^{k/2} u|^2 \,dv_g + B_0 \|u\|_{H^{k-1}(M)}^2,\] where $2^\sharp = \frac{2n}{n-2k}$ and $\Delta_g = -\operatorname{div}_g(\nabla\cdot)$. Here $K_0$ is the optimal constant for the Euclidean Sobolev inequality $\big(\int_{\mathbb{R}^n} |u|^{2^\sharp}\big)^{2/2^\sharp} \leq K_0^2 \int_{\mathbb{R}^n} |\nabla^k u|^2$ for all $u \in C_c^\infty(\mathbb{R}^n)$. This result is proved as a consequence of the pointwise blow-up analysis for a sequence of positive solutions $(u_\alpha)_\alpha$ to polyharmonic critical non-linear equations of the form $(\Delta_g + \alpha)^k u = u^{2^\sharp-1}$ in $M$. We obtain a pointwise description of $u_\alpha$, with explicit dependence in $\alpha$ as $\alpha\to \infty$., Comment: 57 pages, comments welcome

We hereby develop the theory of Turing instability for reaction-diffusion systems defined on m-directed hypergraphs, the latter being generalization of hypergraphs where nodes forming hyperedges can be shared into two disjoint sets, the head nodes and the tail nodes. This framework encodes thus for a privileged direction for the reaction to occur: the joint action of tail nodes is a driver for the reaction involving head nodes. It thus results a natural generalization of directed networks. Based on a linear stability analysis we have shown the existence of two Laplace matrices, allowing to analytically prove that Turing patterns, stationary or wave-like, emerges for a much broader set of parameters in the m-directed setting. In particular directionality promotes Turing instability, otherwise absent in the symmetric case. Analytical results are compared to simulations performed by using the Brusselator model defined on a m-directed d-hyperring as well as on a m-directed random hypergraph.

Nature is a blossoming of regular structures, signature of self-organization of the underlying microscopic interacting agents. Turing theory of pattern formation is one of the most studied mechanisms to address such phenomena and has been applied to a widespread gallery of disciplines. Turing himself used a spatial discretization of the hosting support to eventually deal with a set of ODEs. Such an idea contained the seeds of the theory on discrete support, which has been fully acknowledged with the birth of network science in the early 2000s. This approach allows us to tackle several settings not displaying a trivial continuous embedding, such as multiplex, temporal networks, and, recently, higher-order structures. This line of research has been mostly confined within the network science community, despite its inherent potential to transcend the conventional boundaries of the PDE-based approach to Turing patterns. Moreover, network topology allows for novel dynamics to be generated via a universal formalism that can be readily extended to account for higher-order structures. The interplay between continuous and discrete settings can pave the way for further developments in the field.

We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining whether a given function acting on a set of binary values is constant (uniformly yielding outputs of either all 0 or all 1), or balanced (a situation wherein half of the outputs are 0 and the other half are 1). Such problem can be solved by relying on the Deutsch-Jozsa algorithm. The proposed method, relying on the use of modular values, provides a high number of degrees of freedom for optimizing the new algorithm inspired from the Deutsch-Jozsa one. In particular, we explore meticulously the choices of the pre- and post-selected states. We eventually test the novel theoretical algorithm on a quantum computing platform. While the outcomes are currently not on par with the conventional approach, they nevertheless shed light on potential for future improvements, especially with less-optimized algorithms. We are thus confidend that the proposed proof of concept could prove its validity in bridging quantum algorithms and modular values research fields.

Over the last few years, network science has proved to be useful in modeling a variety of complex systems, composed of a large number of interconnected units. The intricate pattern of interactions often allows the system to achieve complex tasks, such as synchronization or collective motions. In this regard, the interplay between network structure and dynamics has long been recognized as a cornerstone of network science. Among dynamical processes, random walks are undoubtedly among the most studied stochastic processes. While traditionally, the random walkers are assumed to be independent, this assumption breaks down if nodes are endowed with a finite carrying capacity, a feature shared by many real-life systems. Recently, a class of nonlinear diffusion processes accounting for the finite carrying capacities of the nodes was introduced. The stationary nodes densities were shown to be nonlinearly correlated with the nodes degrees, allowing to uncover the network structure by performing a few measurements of the stationary density at the level of a single arbitrary node and by solving an inverse problem. In this work, we extend this class of nonlinear diffusion processes to the case of multigraphs, in which links between nodes carry distinct attributes. Assuming the knowledge of the pattern of interactions associated with one type of links, we show how the degree distribution of the whole multigraph can be reconstructed. The effectiveness of the reconstruction algorithm is demonstrated through simulations on various multigraph topologies.

Higher-order networks are able to capture the many-body interactions present in complex systems and to unveil new fundamental phenomena revealing the rich interplay between topology, geometry, and dynamics. Simplicial complexes are higher-order networks that encode higher-order topology and dynamics of complex systems. Specifically, simplicial complexes can sustain topological signals, i.e., dynamical variables not only defined on nodes of the network but also on their edges, triangles, and so on. Topological signals can undergo collective phenomena such as synchronization, however, only some higher-order network topologies can sustain global synchronization of topological signals. Here we consider global topological synchronization of topological signals on weighted simplicial complexes. We demonstrate that topological signals can globally synchronize on weighted simplicial complexes, even if they are odd-dimensional, e.g., edge signals, overcoming thus a limitation of the unweighted case. These results thus demonstrate that weighted simplicial complexes are more advantageous for observing these collective phenomena than their unweighted counterpart. In particular, we present two weighted simplicial complexes the Weighted Triangulated Torus and the Weighted Waffle. We completely characterize their higher-order spectral properties and we demonstrate that, under suitable conditions on their weights, they can sustain global synchronization of edge signals. Our results are interpreted geometrically by showing, among the other results, that in some cases edge weights can be associated with the lengths of the sides of curved simplices., Comment: 18 pages, 10 figures

We show existence, uniqueness and positivity for the Green's function of the operator $(\Delta_g + \alpha)^k$ in a closed Riemannian manifold $(M,g)$, of dimension $n>2k$, $k\in \mathbb{N}$, $k\geq 1$, with Laplace-Beltrami operator $\Delta_g = -\operatorname{div}_g(\nabla \cdot)$, and where $\alpha >0$. We are interested in the case where $\alpha$ is large : We prove pointwise estimates with explicit dependence on $\alpha$ for the Green's function and its derivatives. We highlight a region of exponential decay for the Green's function away from the diagonal, for large $\alpha$., Comment: 39 pages, comments welcome

The increase in global pesticide use has mirrored the rising demand for food over the last decades, resulting in a boost in crop yields. However, concerns about the impact of pesticides on biodiversity, ecosystems, and human health, especially for populations residing close to cultivated areas, are growing. This study investigates how exposure and possible risks to residents can be estimated at high spatial granularity based on plant protection product data. The complexities of such analysis were explored in France, where relevant data with good granularity are publicly available. Integrating sets of spatial datasets and exposure assessment methodologies, we have developed an indicator to monitor the levels of pesticide risk faced by residents. By spatialising pesticide sales data according to their authorization on specific crops, we developed a detailed map depicting potential pesticide loads at parcel level across France. This spatial distribution served as the basis for an exposure and risk assessment, modelled following the European Food Safety Authority's guidelines. Combining the risk map with population distribution data, we have developed an indicator that allows to monitor patterns in non-dietary exposure to pesticides. Our results show that in France, on average, 13% of people might be exposed to pesticides due to living in the proximity to treated crops. This exposure is in the lower range for 34%, moderate range for 40% and higher range for 25% of the exposed population. The risk evaluation is based on worst case assumptions and values should not be taken as a regulatory risk assessment but as indicator to use, for example, for monitoring time trends. The purpose of this indicator is to demonstrate that more granular pesticide data can improve risk reduction strategies. Harmonized and high-resolution data can help in identifying regions where to focus on sustainable farming., Comment: 40 pages, 4 tables, 22 figures

Metasurfaces represent a new frontier in materials science paving for unprecedented methods of controlling electromagnetic waves, with a range of applications spanning from sensing to imaging and communications. For pulsed terahertz generation, metasurfaces offer a gateway to tuneable thin emitters that can be utilised for large-area imaging, microscopy and spectroscopy. In literature THz-emitting metasurfaces generally exhibit high absorption, being based either on metals or on semiconductors excited in highly resonant regimes. Here we propose the use of a fully dielectric semiconductor exploiting morphology-mediated resonances and inherent quadratic nonlinear response. Our system exhibits a remarkable 40-fold efficiency enhancement compared to the unpatterned at the peak of the optimised wavelength range, demonstrating its potential as scalable emitter design.

Both humans and social animals live in groups and are frequently faced to choose between options with different qualities. When no leader agents are controlling the group decision, consensus can be achieved through repeated interactions among group members. Various studies on CDM illustrate how the dynamics of opinions are determined by the structure of the social network and the methods that individuals use to share and update their opinion upon a social interaction. In this paper, we are interested in further exploring how cognitive, social, and environmental factors interactively contribute to determining the outcome of a collective best-of-n decision process involving asymmetric options, i.e., different costs and/or benefits for each option. We propose and study a novel model capturing those different factors, i) the error in processing social information, ii) the number of zealots (i.e., asocial agents who never change their opinion), iii) the option qualities, iv) the social connectivity structure, and v) the degree centrality of the asocial agents. By using the HMF approach, we study the impact of the above-mentioned factors in the decision dynamics. Our findings indicate that when susceptible agents use the voter model as a mechanism to update their opinion, both the number and the degree of connectivity of the zealots can lead the population to converge towards the lowest quality option. Instead, when susceptible agents use methods more cognitively demanding, the group is marginally impacted by the presence of zealots. The results of the analytical model are complemented and extended by agent-based simulations. Our analysis also shows that the network topology can modulate the influence of zealots on group dynamics.

Chimera states are dynamical states where regions of synchronous trajectories coexist with incoherent ones. A significant amount of research has been devoted to study chimera states in systems of identical oscillators, non-locally coupled through pairwise interactions. Nevertheless, there is an increasing evidence, also supported by available data, that complex systems are composed by multiple units experiencing many-body interactions, that can be modeled by using higher-order structures beyond the paradigm of classic pairwise networks. In this work we investigate whether phase chimera states appear in this framework, by focusing on a novel topology solely involving many-body, non-local and non-regular interactions, hereby named non-local d-hyperring, being (d+1) the order of the interactions. We present the theory by using the paradigmatic Stuart-Landau oscillators as node dynamics, and show that phase chimera states emerge in a variety of structures and with different coupling functions. For comparison, we show that, when higher-order interactions are "flattened" to pairwise ones, the chimera behavior is weaker and more elusive.

Topological signals are dynamical variables not only defined on nodes but also on links of a network that are gaining significant attention in non-linear dynamics and topology and have important applications in brain dynamics. Here we show that topological signals on nodes and links of a network can generate dynamical patterns when coupled together. In particular, dynamical patterns require at least three topological signals, here taken to be two node signals and one link signal. In order to couple these signals, we formulate the 3-way topological Dirac operator that generalizes previous definitions of the 2-way and 4-way topological Dirac operators. We characterize the spectral properties of the 3-way Dirac operator and we investigate the dynamical properties of the resulting Turing and Dirac induced patterns. Here we emphasize the distinct dynamical properties of the Dirac induced patterns which involve topological signals only coupled by the 3-way topological Dirac operator in absence of the Hodge-Laplacian coupling. While the observed Turing patterns generalize the Turing patterns typically investigated on networks, the Dirac induced patterns have no equivalence within the framework of node based Turing patterns. These results open new scenarios in the study of Turing patterns with possible application to neuroscience and more generally to the study of emergent patterns in complex systems.

Near-Earth space continues to be the focus of critical services and capabilities provided to the society. With the steady increase of space traffic, the number of Resident Space Objects (RSOs) has recently boomed in the context of growing concern due to space debris. The need of a holistic and unified approach for addressing orbital collisions, assess the global in-orbit risk, and define sustainable practices for space traffic management has emerged as a major societal challenge. Here, we introduce and discuss a versatile framework rooted on the use of the complex network paradigm to introduce a novel risk index for space sustainability criteria. With an entirely data-driven, but flexible, formulation, we introduce the Resident Space Object Network (RSONet) by connecting RSOs that experience near-collisions events over a finite-time window. The structural collisional properties of RSOs are thus encoded into the RSONet and analysed with the tools of network science. We formulate a geometrical index highlighting the key role of specific RSOs in building up the risk of collisions with respect to the rest of the population. Practical applications based on Two-Line Elements and Conjunction Data Message databases are presented., Comment: Final version: template-free after publication

To succeed in their objectives, groups of individuals must be able to make quick and accurate collective decisions on the best option among a set of alternatives with different qualities. Group-living animals aim to do that all the time. Plants and fungi are thought to do so too. Swarms of autonomous robots can also be programmed to make best-of-n decisions for solving tasks collaboratively. Ultimately, humans critically need it and so many times they should be better at it. Thanks to their mathematical tractability, simple models like the voter model and the local majority rule model have proven useful to describe the dynamics of such collective decision-making processes. To reach a consensus, individuals change their opinion by interacting with neighbors in their social network. At least among animals and robots, options with a better quality are exchanged more often and therefore spread faster than lower-quality options, leading to the collective selection of the best option. With our work, we study the impact of individuals making errors in pooling others' opinions caused, for example, by the need to reduce the cognitive load. Our analysis is grounded on the introduction of a model that generalizes the two existing models (local majority rule and voter model), showing a speed-accuracy trade-off regulated by the cognitive effort of individuals. We also investigate the impact of the interaction network topology on the collective dynamics. To do so, we extend our model and, by using the heterogeneous mean-field approach, we show the presence of another speed-accuracy trade-off regulated by network connectivity. An interesting result is that reduced network connectivity corresponds to an increase in collective decision accuracy., Comment: 29 pages, 18 figures

Memory interference may heavily inflate task execution times in Heterogeneous Systems-on-Chips (HeSoCs). Knowing worst-case interference is consequently fundamental for supporting the correct execution of time-sensitive applications. In most of the literature, worst-case interference is assumed to be generated by, and therefore is estimated through read-intensive synthetic workloads with no caching. Yet these workloads do not always generate worst-case interference. This is the consequence of the general results reported in this work. By testing on multiple architectures, we determined that the highest interference generation traffic pattern is actually hardware dependant, and that making assumptions could lead to a severe underestimation of the worst-case (in our case, of more than 9x)., Comment: Accepted for presentation at the CPS workshop 2023 (http://www.cpsschool.eu/cps-workshop)

Many natural or human-made systems encompassing local reactions and diffusion processes exhibit spatially distributed patterns of some relevant dynamical variable. These interactions, through self-organization and critical phenomena, give rise to power-law distributions, where emergent patterns and structures become visible across vastly different scales. Recent observations reveal power-law distributions in the spatial organization of, e.g., tree clusters and forest patch sizes. Crucially, these patterns do not follow a spatially periodic order but rather a statistical one. Unlike the spatially periodic patterns elucidated by the Turing mechanism, the statistical order of these particular vegetation patterns suggests an incomplete understanding of the underlying mechanisms. Here, we present a novel self-segregation mechanism, driving the emergence of power-law scalings in pattern-forming systems. The model incorporates an Allee-logistic reaction term, responsible for the local growth, and a nonlinear diffusion process accounting for positive interactions and limited resources. According to a self-organized criticality (SOC) principle, after an initial decrease, the system mass reaches an analytically predictable threshold, beyond which it self-segregates into distinct clusters, due to local positive interactions that promote cooperation. Numerical investigations show that the distribution of cluster sizes obeys a power-law with an exponential cutoff.

Synchronization has received a lot of attention from the scientific community for systems evolving on static networks or higher-order structures, such as hypergraphs and simplicial complexes. In many relevant real world applications, the latter are not static but do evolve in time, in this paper we thus discuss the impact of the time-varying nature of high-order structures in the emergence of global synchronization. To achieve this goal we extend the master stability formalism to account, in a general way, for the additional contributions arising from the time evolution of the higher-order structure supporting the dynamical systems. The theory is successfully challenged against two illustrative examples, the Stuart-Landau nonlinear oscillator and the Lorenz chaotic oscillator.

Quantum measurement is one of the most fascinating and discussed phenomena in quantum physics, due to the impact on the system of the measurement action and the resulting interpretation issues. Scholars proposed weak measurements to amplify measured signals by exploiting a quantity called a weak value, but also to overcome philosophical difficulties related to the system perturbation induced by the measurement process. The method finds many applications and raises many philosophical questions as well, especially about the proper interpretation of the observations. In this paper, we show that any weak value can be expressed as the expectation value of a suitable non-normal operator. We propose a preliminary explanation of their anomalous and amplification behavior based on the theory of non-normal matrices and their link with non-normality: the weak value is different from an eigenvalue when the operator involved in the expectation value is non-normal. Our study paves the way for a deeper understanding of the measurement phenomenon, helps the design of experiments, and it is a call for collaboration to researchers in both fields to unravel new quantum phenomena induced by non-normality.

The emergence of order in nature manifests in different phenomena, with synchronization being one of the most representative examples. Understanding the role played by the interactions between the constituting parts of a complex system in synchronization has become a pivotal research question bridging network science and dynamical systems. Particular attention has been paid to the emergence of chimera states, where subsets of synchronized oscillations coexist with asynchronous ones. Such coexistence of coherence and incoherence is a perfect example where order and disorder can persist in a long-lasting regime. Although considerable progress has been made in recent years to understand such coherent and (coexisting) incoherent states, how they manifest in real-world networks remains to be addressed. Based on a symmetry-breaking mechanism, in this paper, we shed light on the role that non-normality, a ubiquitous structural property of real networks, has in the emergence of several diverse dynamical phenomena, e.g., amplitude chimeras or oscillon patterns. Specifically, we demonstrate that the prevalence of source or leader nodes in networks leads to the manifestation of phase chimera states. Throughout the paper, we emphasize that non-normality poses ongoing challenges to global synchronization and is instrumental in the emergence of chimera states.

Synchronization is an ubiquitous phenomenon in dynamical systems of networked oscillators. While it is often a goal to achieve, in some context one would like to decrease it, e.g., although synchronization is essential to the good functioning of brain dynamics, hyper-synchronization can induce problems like epilepsy seizures. Motivated by this problem, scholars have developed pinning control schemes able to decrease synchronization in a system. Focusing on one of these methods, the goal of the present work is to analyse which is the best way to select the controlled nodes, i.e. the one that guarantees the lower synchronization rate. We show that hubs are generally the most advantageous nodes to control, especially when the degree distribution is heterogeneous. Nevertheless, pinning a too large number of hubs is in general not an appropriate choice. Our results are in line with previous works that studied pinning control aimed to increase synchronization. These observations shed light on an interesting universality of good practice of node selection disregarding the actual goal of the control scheme.

Self-organization in natural and engineered systems causes the emergence of ordered spatio-temporal motifs. In presence of diffusive species, Turing theory has been widely used to understand the formation of such patterns on continuous domains obtained from a diffusion-driven instability mechanism. The theory was later extended to networked systems, where the reaction processes occur locally (in the nodes), while diffusion takes place through the networks links. The condition for the instability onset relies on the spectral property of the Laplace matrix, i.e., the diffusive operator, and in particular on the existence of an eigenbasis. In this work we make one step forward and we prove the validity of Turing idea also in the case of a network with defective Laplace matrix. Moreover, by using both eigenvectors and generalized eigenvectors we show that we can reconstruct the asymptotic pattern with a relatively small discrepancy. Because a large majority of empirical networks are non-normal and often defective, our results pave the way for a thorough understanding of self-organization in real-world systems.

Recently, an increasing interest in the management of water and health resources has been recorded. This interest is fed by the global sustainability challenges posed to the humanity that have water scarcity and quality at their core. Thus, the availability of effective, meaningful and open data is crucial to address those issues in the broader context of the Sustainable Development Goals of clean water and sanitation as targeted by the United Nations. In this paper, we present the Water Health Open Knowledge Graph (WHOW-KG) along with its design methodology and analysis on impact. WHOW-KG is a semantic knowledge graph that models data on water consumption, pollution, infectious disease rates and drug distribution. The WHOW-KG is developed in the context of the EU-funded WHOW (Water Health Open Knowledge) project and aims at supporting a wide range of applications: from knowledge discovery to decision-making, making it a valuable resource for researchers, policymakers, and practitioners in the water and health domains. The WHOW-KG consists of a network of five ontologies and related linked open data, modelled according to those ontologies., Comment: 17 pages

The LHCb upgrade represents a major change of the experiment. The detectors have been almost completely renewed to allow running at an instantaneous luminosity five times larger than that of the previous running periods. Readout of all detectors into an all-software trigger is central to the new design, facilitating the reconstruction of events at the maximum LHC interaction rate, and their selection in real time. The experiment's tracking system has been completely upgraded with a new pixel vertex detector, a silicon tracker upstream of the dipole magnet and three scintillating fibre tracking stations downstream of the magnet. The whole photon detection system of the RICH detectors has been renewed and the readout electronics of the calorimeter and muon systems have been fully overhauled. The first stage of the all-software trigger is implemented on a GPU farm. The output of the trigger provides a combination of totally reconstructed physics objects, such as tracks and vertices, ready for final analysis, and of entire events which need further offline reprocessing. This scheme required a complete revision of the computing model and rewriting of the experiment's software., Comment: All figures and tables, along with any supplementary material and additional information, are available at http://lhcbproject.web.cern.ch/lhcbproject/Publications/LHCbProjectPublic/LHCb-DP-2022-002.html (LHCb public pages)

Social systems are characterized by the presence of group interactions and by the existence of both trust and distrust relations. Although there is a wide literature on signed social networks, where positive signs associated to the links indicate trust, friendship, agreement, while negative signs represent distrust, antagonism, and disagreement, very little is known about the effect that signed interactions can have on the spreading of social behaviors when higher-order interactions are taken into account. In this paper we focus on processes of complex contagion, such as the adoption of social norms, where exposure to multiple sources is needed for the contagion to occur. Complex contagion has been recently modeled by higher-order networks, such as simplicial complexes, which allow transmission to happen not only through the links connecting pair of nodes, but also in group interactions, namely over simplices of dimension larger or equal than two. Here, we introduce a model of complex contagion on signed simplicial complexes, and we investigate the role played by trust and distrust on the dynamics of a social contagion process. The presence of higher-order signed structures in our model naturally induces new infection and recovery mechanisms. Through numerical simulations and analytical results in the mean-field approximation, we show how distrust determines the way the system moves from a state where no individuals adopt the social behavior, to a state where a finite fraction of the population actively spreads it. Interestingly, the fraction of spreading individuals displays a non-monotonic dependence on the average number of connections between individuals. We then investigate how social balance affects social contagion, finding that balanced triads either promote or impede contagion based on the relative abundance of fully trusted relations.

Multiphoton processes of absorption photoluminescence have enabled a wide range of applications including three-dimensional microfabrication, data storage, and biological imaging. While the applications of two-photon and three-photon absorption and luminescence have matured considerably, higher-order photoluminescence processes remain more challenging to study due to their lower efficiency, particularly in subwavelength systems. Here we report the observation of it five-photon luminescence from a single subwavelength nanoantenna at room temperature enabled by the Mie resonances. We excite an AlGaAs resonator at around 3.6 um and observe photoluminescence at around 740 nm. We show that the interplay of the Mie multipolar modes at the subwavelength scale can enhance the efficiency of the five-photon luminescence by at least four orders of magnitude, being limited only by sensitivity of our detector. Our work paves the way towards applications of higher-order multiphoton processes at the subwavelength scales enabled by the physics of Mie resonances., Comment: 18 pages, 5 figures