arXiv subjects

Timoteo Carletti

Publications and source records attributed to Timoteo Carletti.

At least 55 records · Page 3Linked to original sources

arXiv2024

Turing patterns on discrete topologies: from networks to higher-order structures

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.

nlin.PS↗

arXiv2024

The Resident Space Objects Network: a complex system approach for shaping space sustainability

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.

astro-ph.EP↗

arXiv2024

Emergence of power-law distributions in self-segregation reaction-diffusion processes

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.

nlin.PS↗

arXiv2024

Leveraging modular values in quantum algorithms: the Deutsch-Jozsa

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.

quant-ph↗

arXiv2024

Multigraph reconstruction via nonlinear random walk

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.

physics.soc-ph↗

arXiv2024

Global topological synchronization of weighted simplicial complexes

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.

cond-mat.dis-nn↗

arXiv2024

Studying speed-accuracy trade-offs in best-of-n collective decision-making through heterogeneous mean-field modeling

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.

physics.soc-ph↗

arXiv2024

Phase chimera states on non-local hyperrings

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.

nlin.PS↗

arXiv2023

On the role of zealots in a best-of-n problem on a heterogeneous network

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.

physics.soc-ph↗

arXiv2023

Revisiting weak values through non-normality

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.

quant-ph↗

arXiv2023

The three way Dirac operator and dynamical Turing and Dirac induced patterns on nodes and links

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.

nlin.PS↗

arXiv2023

Pattern reconstruction through generalized eigenvectors on defective networks

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.

cond-mat.stat-mech↗

arXiv2023

Global synchronization on time-varying higher-order structures

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.

cond-mat.stat-mech↗

arXiv2023

Persistence of chimera states and the challenge for synchronization in real-world networks

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.

nlin.PS↗

arXiv2023

On the location and the strength of controllers to desynchronize coupled Kuramoto oscillators

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.

math.DS↗

arXiv2023

Complex contagion in social systems with distrust

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.

physics.soc-ph↗

arXiv2023

Diffusion-driven instability of topological signals coupled by the Dirac operator

The study of reaction-diffusion systems on networks is of paramount relevance for the understanding of nonlinear processes in systems where the topology is intrinsically discrete, such as the brain. Until now reaction-diffusion systems have been studied only when species are defined on the nodes of a network. However, in a number of real systems including, e.g., the brain and the climate, dynamical variables are not only defined on nodes but also on links, faces and higher-dimensional cells of simplicial or cell complexes, leading to topological signals. In this work we study reaction-diffusion processes of topological signals coupled through the Dirac operator. The Dirac operator allows topological signals of different dimension to interact or cross-diffuse as it projects the topological signals defined on simplices or cells of a given dimension to simplices or cells of one dimension up or one dimension down. By focusing on the framework involving nodes and links we establish the conditions for the emergence of Turing patterns and we show that the latter are never localized only on nodes or only on links of the network. Moreover when the topological signals display Turing pattern their projection does as well. We validate the theory hereby developed on a benchmark network model and on square lattices with periodic boundary conditions.

nlin.PS↗

arXiv2023

Global topological synchronization on simplicial and cell complexes

Topological signals, i.e., dynamical variables defined on nodes, links, triangles, etc. of higher-order networks, are attracting increasing attention. However the investigation of their collective phenomena is only at its infancy. Here we combine topology and nonlinear dynamics to determine the conditions for global synchronization of topological signals defined on simplicial or cell complexes. On simplicial complexes we show that topological obstruction impedes odd dimensional signals to globally synchronize. On the other hand, we show that cell complexes can overcome topological obstruction and in some structures, signals of any dimension can achieve global synchronization.

cond-mat.stat-mech↗