Ida Germana Minelli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ida Germana Minelli has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Irene Crimaldi
IMT School for Advanced Studies Lucca Piazza San Ponziano 6 55100 Lucca Italy
7 shared publications - Pierre-Yves Louis
Institut de Mathématiques de Bourgogne, UMR 5584 CNRS, Université Bourgogne Franche-Comté, Dijon, France
7 shared publications - Paolo Dai Pra
Università di Padova
5 shared publications - Michele Aleandri
University of Florence
3 shared publications Irene Crimaldi
2 shared publications- Michele Aleandri
GSSI-Gran Sasso Science Institute Viale F. Crispi 17 67100 L'Aquila Italy
1 shared publication
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Mathematical Statistics in Electronic Communications in Probability
- Vol. 31 (none) , 1-13
Reinforced dynamics for interacting agents in competitive or cooperative environments
We study systems of interacting reinforced stochastic processes, where agents’ decisions evolve under reinforcement, network-mediated interactions, and environmental influences. In competitive environments with irreducible networks, we prove almost sure convergence of agents’ states, with bipartite graphs leading to non-deterministic limits and non-bipartite graphs to deterministic ones. These results are extended to reducible networks with cooperative or competitive substructures, using a hierarchical graph representation in which higher-level agents perceive lower-level agents as forcing inputs. A general framework for interacting agents under external forcing is also provided, offering a rigorous characterization of long-term behavior and synchronization phenomena in such systems.
- 1 January 2026
- Published by Institute of Mathematical Statistics in Electronic Communications in Probability
- Vol. 31 (none) , 1-13
Open AccessReinforced dynamics for interacting agents in competitive or cooperative environments
We study systems of interacting reinforced stochastic processes, where agents’ decisions evolve under reinforcement, network-mediated interactions, and environmental influences. In competitive environments with irreducible networks, we prove almost sure convergence of agents’ states, with bipartite graphs leading to non-deterministic limits and non-bipartite graphs to deterministic ones. These results are extended to reducible networks with cooperative or competitive substructures, using a hierarchical graph representation in which higher-level agents perceive lower-level agents as forcing inputs. A general framework for interacting agents under external forcing is also provided, offering a rigorous characterization of long-term behavior and synchronization phenomena in such systems.
- Open Access
Reinforced dynamics for interacting agents in competitive or cooperative environments
We study systems of interacting reinforced stochastic processes, where agents' decisions evolve under reinforcement, network-mediated interactions, and environmental influences. In competitive environments with irreducible networks, we prove almost sure convergence of agents' states, with bipartite graphs leading to non-deterministic limits and non-bipartite graphs to deterministic ones. These results are extended to reducible networks with cooperative or competitive substructures, using a hierarchical graph representation in which higher-level agents perceive lower-level agents as forcing inputs. A general framework for interacting agents under external forcing is also provided, offering a rigorous characterization of long-term behavior and synchronization phenomena in such systems.
Open AccessReinforced dynamics for interacting agents in competitive or cooperative environments
We study systems of interacting reinforced stochastic processes, where agents' decisions evolve under reinforcement, network-mediated interactions, and environmental influences. In competitive environments with irreducible networks, we prove almost sure convergence of agents' states, with bipartite graphs leading to non-deterministic limits and non-bipartite graphs to deterministic ones. These results are extended to reducible networks with cooperative or competitive substructures, using a hierarchical graph representation in which higher-level agents perceive lower-level agents as forcing inputs. A general framework for interacting agents under external forcing is also provided, offering a rigorous characterization of long-term behavior and synchronization phenomena in such systems.
- 26 December 2022
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 158, 342-360
Statistical test for an urn model with random multidrawing and random addition
- 26 December 2022
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 158, 342-360
Statistical test for an urn model with random multidrawing and random addition
- Open Access
Statistical test for an urn model with random multidrawing and random addition
We complete the study of the model introduced in [11]. It is a two-color urn model with multiple drawing and random (non-balanced) time-dependent reinforcement matrix. The number of sampled balls at each time-step is random. We identify the exact rates at which the number of balls of each color grows to infinity and define two strongly consistent estimators for the limiting reinforcement averages. Then we prove a Central Limit Theorem, which allows to design a statistical test for such averages.
Open AccessStatistical test for an urn model with random multidrawing and random addition
We complete the study of the model introduced in [11]. It is a two-color urn model with multiple drawing and random (non-balanced) time-dependent reinforcement matrix. The number of sampled balls at each time-step is random. We identify the exact rates at which the number of balls of each color grows to infinity and define two strongly consistent estimators for the limiting reinforcement averages. Then we prove a Central Limit Theorem, which allows to design a statistical test for such averages.
- 1 August 2022
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 55 (1) , 275-320
Interacting nonlinear reinforced stochastic processes: Synchronization or non-synchronization
The rich-get-richer rule reinforces actions that have been frequently chosen in the past. What happens to the evolution of individuals’ inclinations to choose an action when agents interact? Interaction tends to homogenize, while each individual dynamics tends to reinforce its own position. Interacting stochastic systems of reinforced processes have recently been considered in many papers, in which the asymptotic behavior is proven to exhibit almost sure synchronization. In this paper we consider models where, even if interaction among agents is present, absence of synchronization may happen because of the choice of an individual nonlinear reinforcement. We show how these systems can naturally be considered as models for coordination games or technological or opinion dynamics.
- 1 August 2022
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 55 (1) , 275-320
Interacting nonlinear reinforced stochastic processes: Synchronization or non-synchronization
The rich-get-richer rule reinforces actions that have been frequently chosen in the past. What happens to the evolution of individuals’ inclinations to choose an action when agents interact? Interaction tends to homogenize, while each individual dynamics tends to reinforce its own position. Interacting stochastic systems of reinforced processes have recently been considered in many papers, in which the asymptotic behavior is proven to exhibit almost sure synchronization. In this paper we consider models where, even if interaction among agents is present, absence of synchronization may happen because of the choice of an individual nonlinear reinforcement. We show how these systems can naturally be considered as models for coordination games or technological or opinion dynamics.
- 31 January 2022
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 147, 270-299
An urn model with random multiple drawing and random addition
- 31 January 2022
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 147, 270-299
An urn model with random multiple drawing and random addition
- Open Access
- 11 October 2021
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 185 (1) , 1-21
Delay-Induced Periodic Behaviour in Competitive Populations
We study a model of binary decisions in a fully connected network of interacting agents. Individual decisions are determined by social influence, coming from direct interactions with neighbours, and a group level pressure that accounts for social environment. In a competitive environment, the interplay of these two aspects results in the presence of a persistent disordered phase where no majority is formed. We show how the introduction of a delay mechanism in the agent’s detection of the global average choice may drastically change this scenario, giving rise to a coordinated self sustained periodic behaviour.
- 11 October 2021
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 185 (1) , 1-21
Open AccessDelay-Induced Periodic Behaviour in Competitive Populations
We study a model of binary decisions in a fully connected network of interacting agents. Individual decisions are determined by social influence, coming from direct interactions with neighbours, and a group level pressure that accounts for social environment. In a competitive environment, the interplay of these two aspects results in the presence of a persistent disordered phase where no majority is formed. We show how the introduction of a delay mechanism in the agent’s detection of the global average choice may drastically change this scenario, giving rise to a coordinated self sustained periodic behaviour.
- Open Access
Urn models with random multiple drawing and random addition
We consider an urn model with multiple drawing and random time-dependent addition matrix. The model is very general with respect to previous literature: the number of sampled balls at each time-step is random, the addition matrix has general random entries. For the proportion of balls of a given color, we prove almost sure convergence results and fluctuation theorems (through CLTs in the sense of stable convergence and of almost sure conditional convergence, which are stronger than convergence in distribution). Asymptotic confidence intervals are given for the limit proportion, whose distribution is generally unknown.
Open AccessUrn models with random multiple drawing and random addition
We consider an urn model with multiple drawing and random time-dependent addition matrix. The model is very general with respect to previous literature: the number of sampled balls at each time-step is random, the addition matrix has general random entries. For the proportion of balls of a given color, we prove almost sure convergence results and fluctuation theorems (through CLTs in the sense of stable convergence and of almost sure conditional convergence, which are stronger than convergence in distribution). Asymptotic confidence intervals are given for the limit proportion, whose distribution is generally unknown.
- 1 January 2019
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 129 (1) , 70-101
Synchronization and functional central limit theorems for interacting reinforced random walks
- 1 January 2019
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 129 (1) , 70-101
Synchronization and functional central limit theorems for interacting reinforced random walks
- Open Access
Opinion dynamics with Lotka-Volterra type interactions
We investigate a class of models for opinion dynamics in a population with two interacting families of individuals. Each family has an intrinsic mean field "Voter-like" dynamics which is influenced by interaction with the other family. The interaction terms describe a cooperative/conformist or competitive/nonconformist attitude of one family with respect to the other. We prove chaos propagation, i.e., we show that on any time interval [0,T], as the size of the system goes to infinity, each individual behaves independently of the others with transition rates driven by a macroscopic equation. We focus in particular on models with Lotka-Volterra type interactions, i.e., models with cooperative vs. competitive families. For these models, although the microscopic system is driven a.s. to consensus within each family, a periodic behaviour arises in the macroscopic scale. In order to describe fluctuations between the limiting periodic orbits, we identify a slow variable in the microscopic system and, through an averaging principle, we find a diffusion which describes the macroscopic dynamics of such variable on a larger time scale.
Open AccessOpinion dynamics with Lotka-Volterra type interactions
We investigate a class of models for opinion dynamics in a population with two interacting families of individuals. Each family has an intrinsic mean field "Voter-like" dynamics which is influenced by interaction with the other family. The interaction terms describe a cooperative/conformist or competitive/nonconformist attitude of one family with respect to the other. We prove chaos propagation, i.e., we show that on any time interval [0,T], as the size of the system goes to infinity, each individual behaves independently of the others with transition rates driven by a macroscopic equation. We focus in particular on models with Lotka-Volterra type interactions, i.e., models with cooperative vs. competitive families. For these models, although the microscopic system is driven a.s. to consensus within each family, a periodic behaviour arises in the macroscopic scale. In order to describe fluctuations between the limiting periodic orbits, we identify a slow variable in the microscopic system and, through an averaging principle, we find a diffusion which describes the macroscopic dynamics of such variable on a larger time scale.