Related papers: Locking-time and Information Capacity in CML with …
In this paper we propose a stochastic model predictive control (MPC) algorithm for linear discrete-time systems affected by possibly unbounded additive disturbances and subject to probabilistic constraints. Constraints are treated in…
Resource are often not uniformly distributed within a population. Spatial variations of concentration of a resource, change the fitness of competing strategies locally. The notion of fitness varying with respect to both genotype and…
The performance of low-density parity-check (LDPC) codes in the error floor region is closely related to some combinatorial structures of the code's Tanner graph, collectively referred to as {\it trapping sets (TSs)}. In this paper, we…
Recent advances in experimental techniques have allowed the simultaneous recording of populations of hundreds of neurons, allowing more comprehensive investigation into the nature of the collective structure of population neural activity.…
Numerical simulations of coupled map lattices (CMLs) and other complex model systems show an enormous phenomenological variety that is difficult to classify and understand. It is therefore desirable to establish analytical tools for…
We show that spatially coupled low-density parity-check (LDPC) codes yield robust performance over changing intersymbol interfere (ISI) channels with optimal and suboptimal detectors. We compare the performance with classical LDPC code…
We study synchronization dynamics of a population of pulse-coupled oscillators. In particular, we focus our attention in the interplay between networks topological disorder and its synchronization features. Firstly, we analyze…
We consider the problem of recovering the community structure in the stochastic block model with two communities. We aim to describe the mutual information between the observed network and the actual community structure in the sparse…
A new approach to clustering, based on the physical properties of inhomogeneous coupled chaotic maps, is presented. A chaotic map is assigned to each data-point and short range couplings are introduced. The stationary regime of the system…
Many natural, complex systems are remarkably stable thanks to an absence of feedback acting on their elements. When described as networks, these exhibit few or no cycles, and associated matrices have small leading eigenvalues. It has been…
If each node of an idealized network has an equal capacity to efficiently exchange benefits, then the network's capacity to use energy is scaled by the average amount of energy required to connect any two of its nodes. The scaling factor…
Large Language Models (LLMs) have demonstrated impressive capabilities in reasoning and prediction across different domains. Yet, their ability to infer temporal regularities from structured behavioral data remains underexplored. This paper…
We describe the combinatorics of equilibria and steady states of neurons in threshold-linear networks that satisfy Dale's law. The combinatorial code of a Dale network is characterized in terms of two conditions: (i) a condition on the…
Parametric instabilities are a known feature of periodically driven dynamic systems; at particular frequencies and amplitudes of the driving modulation, the system's quasi-periodic response undergoes a frequency lock-in, leading to a…
We study the spatio-temporal behavior of simple coupled map lattices with periodic boundary conditions. The local dynamics is governed by two maps, namely, the sine circle map and the logistic map respectively. It is found that even though…
We determine limiting equations for large asymmetric `spin glass' networks. The initial conditions are not assumed to be independent of the disordered connectivity: one of the main motivations for this is that allows one to understand how…
We connect the mixing behaviour of random walks over a graph to the power of the local-consistency algorithm for the solution of the corresponding constraint satisfaction problem (CSP). We extend this connection to arbitrary CSPs and their…
We study the existence of chimera states, i.e. mixed states, in a globally coupled sine circle map lattice, with different strengths of inter-group and intra-group coupling. We find that at specific values of the parameters of the CML, a…
In this communication, we study the level-spectra statistics when a noninteracting electron gas is confined in \textit{Sierpi\'{n}ski Carpet} (\textit{SC}) lattices. These \textit{SC} lattices are constructed under two representative…
Mining frequent subgraphs is an area of research where we have a given set of graphs (each graph can be seen as a transaction), and we search for (connected) subgraphs contained in many of these graphs. In this work we will discuss…