Related papers: Characterizing the process of reaching consensus f…
Bisimulation is crucial for verifying process equivalence in probabilistic systems. This paper presents a novel logical framework for analyzing bisimulation in probabilistic parameterized systems, namely, infinite families of finite-state…
The emergence of collective behaviors in networks of dynamical units in pairwise interaction has been explained as the effect of diffusive coupling. How does the presence of higher-order interaction impact the onset of spontaneous or…
Social norms are powerful formalism in coordinating autonomous agents' behaviour to achieve certain objectives. In this paper, we propose a dynamic normative system to enable the reasoning of the changes of norms under different…
Systems now exist which are able to compile unification grammars into language models that can be included in a speech recognizer, but it is so far unclear whether non-trivial linguistically principled grammars can be used for this purpose.…
This paper presents a consensus algorithm for a multi-agent system where each agent has access to its imperfect own state and neighboring state measurements. The measurements are subject to deterministic disturbances and the proposed…
This thesis represents a culmination of work and learning that has taken place over a period of almost three years (2007 - 2010) at the University of Salerno, and at the University of Connecticut. It is mostly an unified mathematical…
We fully characterize self-stabilizing functions in population protocols for complete interaction graphs. In particular, we investigate self-stabilization in systems of $n$ finite state agents in which a malicious scheduler selects an…
Group synchronization arises when two or more synchronization patterns coexist in a network formed of oscillators of different types, with the systems in each group synchronizing on the same time-evolution, but systems in different groups…
We investigate majority rule dynamics in a population with two classes of people, each with two opinion states $\pm 1$, and with tunable interactions between people in different classes. In an update, a randomly selected group adopts the…
Experimental science is enabled by the combination of synthesis, imaging, and functional characterization. Synthesis of a new material is typically followed by a set of characterization methods aiming to provide feedback for optimization or…
The cyclic feedback interconnection of $n$ subsystems is the basic building block of control theory. Many robust stability tools have been developed for this interconnection. Two notable examples are the small gain theorem and the Secant…
One of the aims of systems biology is to build multiple layered and multiple scale models of living systems which can efficiently describe phenomena occurring at various level of resolution. Such models should consist of layers of various…
Entanglement characteristics of a pair coherent state is studied using entanglement of superposition. It is demonstrated only few states in the expansion of a pair coherent state, in a harmonic oscillator basis, contribute significantly to…
Compositional generalization is a crucial property in artificial intelligence, enabling models to handle novel combinations of known components. While most deep learning models lack this capability, certain models succeed in specific tasks,…
We discuss in a statistical physics framework the idea that ``the whole is less than the parts'', as sometimes advocated by sociologists in view of the intrinsic complexity of humans, and try to reconcile this idea with the statistical…
We generalize a binary majority-vote model on adaptive networks to a plurality-vote counterpart. When opinions are uniformly distributed in the population of voters in the initial state, it is found that having more available opinions in…
We consider grouping as a general characterization for problems such as clustering, community detection in networks, and multiple parametric model estimation. We are interested in merging solutions from different grouping algorithms,…
We present derivations of the contagion condition for a range of spreading mechanisms on families of generalized random networks and bipartite random networks. We show how the contagion condition can be broken into three elements, two…
Is there an equilibrium for distributed consensus when all agents except one collude to steer the decision value towards their preference? If an equilibrium exists, then an $n-1$ size coalition cannot do better by deviating from the…
Every function on a finite set defines an equivalence relation and, therefore, a partition called the kernel of the function. Automata such that every possible partition is the kernel of a word are called totally compatible. A…