Salvatore Mandrà

Learn More
We introduce and study a class of exchangeable random graph ensembles. They can be used as statistical null models for empirical networks, and as a tool for theoretical investigations. We provide general theorems that characterize the degree distribution of the ensemble graphs, together with some features that are important for applications, such as(More)
We study the coevolution of a generalized Glauber dynamics for Ising spins with tunable threshold and of the graph topology where the dynamics takes place. This simple coevolution dynamics generates a rich phase diagram in the space of the two parameters of the model, the threshold and the rewiring probability. The diagram displays phase transitions of(More)
We present an exact quantum algorithm for solving the Exact Satisfiability problem, which is known to belong to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: The first step consists in the identification and efficient characterization of a restricted subspace that contains all(More)
Constraints can affect dramatically the behavior of diffusion processes. Recently, we analyzed a natural and a technological system and reported that they perform diffusion-like discrete steps displaying a peculiar constraint, whereby the increments of the diffusing variable are subject to configuration-dependent bounds. This work explores theoretically(More)
Understanding the patterns of software evolution has a large practical importance: the knowledge of what can be considered " typical " can guide developers and engineers in recognizing and reacting to abnormal behavior. While the initial framework of a theory of software exists [1, 2], the current theoretical achievements do not fully capture existing(More)
  • 1