DSRELIS

Dynamics and Structure of Randomly Evolving Locally Interacting Systems (DSRELIS)

 Coordinatore UNIVERSITY OF BATH 

 Organization address address: CLAVERTON DOWN
city: BATH
postcode: BA2 7AY

contact info
Titolo: Ms.
Nome: Hazel
Cognome: Wallis
Email: send email
Telefono: +44 1225386822

 Nazionalità Coordinatore United Kingdom [UK]
 Totale costo 75˙000 €
 EC contributo 75˙000 €
 Programma FP7-PEOPLE
Specific programme "People" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013)
 Code Call FP7-PEOPLE-2013-CIG
 Funding Scheme MC-CIG
 Anno di inizio 2013
 Periodo (anno-mese-giorno) 2013-10-01   -   2016-09-30

 Partecipanti

# participant  country  role  EC contrib. [€] 
1    UNIVERSITY OF BATH

 Organization address address: CLAVERTON DOWN
city: BATH
postcode: BA2 7AY

contact info
Titolo: Ms.
Nome: Hazel
Cognome: Wallis
Email: send email
Telefono: +44 1225386822

UK (BATH) coordinator 75˙000.00

Mappa


 Word cloud

Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.

pile    allocation    uniformly    random       until    time    particle    sandpiles    dynamics    edge    point    for    model    quadrilateral    triangulations    mobile    local       vertex    particles   

 Obiettivo del progetto (Objective)

'In this proposal we aim at studying the dynamic properties of systems that evolve in time according to some local random mechanism. We focus on three types of systems: mobile point processes, allocation via sandpiles and random triangulations. For mobile point processes, we consider a Poisson point process of particles that move as independent continuous-time random walks on Z^2. This model has been studied as an abstraction to mobile wireless networks and moving populations. Our goal is to study the problem of whether a target can escape detection by the particles, how fast an aggregate can grow by gluing particles on its surface, and how the environments can affect the performance of mobile particles. For allocation via sandpiles, we consider the following model for allocation n particles on the vertices of a graph. Particles arrive one a time and, when a particle arrives, it first chooses a vertex u uniformly at random. Then the particle performs a local search starting from u until it reaches a vertex with a local minimum pile of particles, where the particle is finally placed. We study how balanced the pile of particles are and the behavior of this process on infinite graphs, especially in connection with sandpile models. For random triangulations, we consider the n x n square lattice and study the so-called flip dynamics, a Markov chain over triangulations of this point set that is of interest to researchers in combinatorics and computer graphics. In this dynamics, an edge is chosen uniformly at random and, if that edge lies inside a strictly convex quadrilateral, the edge is flipped to the opposite diagonal of the quadrilateral. Our goal is to understand the mixing time of this structure as n goes to infinity and to understand non-stationary properties of this system, such as the time it takes until all edges of the triangulation are smaller than some given value.'

Altri progetti dello stesso programma (FP7-PEOPLE)

ADVROOTAGESTRIG2010 (2011)

Age related changes in strigolactone control of adventitious root initiation

Read More  

CAMGRAPH (2013)

Catalysis driven Manufacture and patterning of Graphene at the nanoscale using probe technologies

Read More  

SINT-NAS (2015)

Sintering Behavior in Steels containing New Alloying Systems

Read More