It is well known, mainly because of the work of Kurtz, that density dependent Markov chains can be approximated by sets of ordinary differential equations (ODE) when their indexing parameter grows very large. In this thesis we apply this approximation to study a Markovian Agent models (MAMs). An MAM is formed by different agents, each of which is characterised by an own discrete-state continuous-time Markov chain (CTMC). Therefore we approximate these CTMCs when the number of objects inside the system increases, that is one of the most important difficulties of these models. In particular we study the foraging behaviour of ants, and we show that with this approach we are able to simulate a system with a large number of ants, exceeding the difficulties described in the literature.

It is well known, mainly because of the work of Kurtz, that density dependent Markov chains can be approximated by sets of ordinary differential equations (ODE) when their indexing parameter grows very large. In this thesis we apply this approximation to study a Markovian Agent models (MAMs). An MAM is formed by different agents, each of which is characterised by an own discrete-state continuous-time Markov chain (CTMC). Therefore we approximate these CTMCs when the number of objects inside the system increases, that is one of the most important difficulties of these models. In particular we study the foraging behaviour of ants, and we show that with this approach we are able to simulate a system with a large number of ants, exceeding the difficulties described in the literature.

Analisi di modelli ad Agenti Markoviani attraverso l' approssimazione Fluida

PERNICE, SIMONE
2015/2016

Abstract

It is well known, mainly because of the work of Kurtz, that density dependent Markov chains can be approximated by sets of ordinary differential equations (ODE) when their indexing parameter grows very large. In this thesis we apply this approximation to study a Markovian Agent models (MAMs). An MAM is formed by different agents, each of which is characterised by an own discrete-state continuous-time Markov chain (CTMC). Therefore we approximate these CTMCs when the number of objects inside the system increases, that is one of the most important difficulties of these models. In particular we study the foraging behaviour of ants, and we show that with this approach we are able to simulate a system with a large number of ants, exceeding the difficulties described in the literature.
ENG
It is well known, mainly because of the work of Kurtz, that density dependent Markov chains can be approximated by sets of ordinary differential equations (ODE) when their indexing parameter grows very large. In this thesis we apply this approximation to study a Markovian Agent models (MAMs). An MAM is formed by different agents, each of which is characterised by an own discrete-state continuous-time Markov chain (CTMC). Therefore we approximate these CTMCs when the number of objects inside the system increases, that is one of the most important difficulties of these models. In particular we study the foraging behaviour of ants, and we show that with this approach we are able to simulate a system with a large number of ants, exceeding the difficulties described in the literature.
IMPORT DA TESIONLINE
File in questo prodotto:
File Dimensione Formato  
748770_simonepernicetesi.pdf

non disponibili

Tipologia: Altro materiale allegato
Dimensione 3.32 MB
Formato Adobe PDF
3.32 MB Adobe PDF

I documenti in UNITESI sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14240/23525