BAG

Benjamini-Schramm approximation of Groups and Graphings

 Coordinatore MAGYAR TUDOMANYOS AKADEMIA RENYI ALFRED MATEMATIKAI KUTATOINTEZET 

 Organization address address: REALTANODA STREET 13-15
city: Budapest
postcode: 1053

contact info
Titolo: Ms.
Nome: Tiziana
Cognome: Del Viscio
Email: send email
Telefono: +36 14838308
Fax: 3614838333

 Nazionalità Coordinatore Hungary [HU]
 Totale costo 184˙411 €
 EC contributo 184˙411 €
 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-IIF
 Funding Scheme MC-IIF
 Anno di inizio 2014
 Periodo (anno-mese-giorno) 2014-03-01   -   2016-02-29

 Partecipanti

# participant  country  role  EC contrib. [€] 
1    MAGYAR TUDOMANYOS AKADEMIA RENYI ALFRED MATEMATIKAI KUTATOINTEZET

 Organization address address: REALTANODA STREET 13-15
city: Budapest
postcode: 1053

contact info
Titolo: Ms.
Nome: Tiziana
Cognome: Del Viscio
Email: send email
Telefono: +36 14838308
Fax: 3614838333

HU (Budapest) coordinator 184˙411.20

Mappa


 Word cloud

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

computer    science    szemeredi    host    theory    kun    usa    sciences    he    graph    graphs    sparse    expect    small    group    plans   

 Obiettivo del progetto (Objective)

'Large graphs have become central objects in many fields in the last couple of decades: in neural sciences, network sciences (WWW, graph of webpages), social sciences (Facebook) and molecular biology. The standard way to handle large networks is Property Testing: We check only a small number of vertices picked randomly, and we try to learn the properties of the huge graph from this random sample. The general questions of the proposal are the basic problems in all of these fields: Which properties of a large graph are testable? How can we approximate large graphs by small ones?

The proposal is at the crossroads of the following three fields: 1. Sparse graphs and computer science 2. Dynamics and measured group theory 3. Graph limit theory

We expect a boom in the fields of this proposal similarly to the fields related to Szemeredi's theorem. We expect more applications, since sparse graphs appear more often in real life. Recent breakthrough results in computer science play an important role in the methodology. The proposal focuses on three problems in the research frontier addressing the above phenomena: 1. The construction of a nonsofic group 2. The measurable version of the Lovasz Local Lemma 3. The dynamical von Neumann problem

Kun is an expert in the fields of the proposal. After completing his PhD at the Eotvos University he moved to the USA. He plans to return to Europe after six years at top institutions in North America. The Alfred Renyi Institute is a well-known center in the fields of the proposal, and one of the leading institutions in discrete mathematics. Kun plans to work with Tardos, the scientist in charge, and Abert, Pyber, Szegedy and Szemeredi at the host.

The project would enrich the mathematical culture of Hungary and the ERA, and lead to mutually beneficial, long-term cooperation between the USA and many European countries. If funded Kun would join the host permanently, so the proposal would help to reverse the brain drain phenomenon.'

Altri progetti dello stesso programma (FP7-PEOPLE)

MACE (2010)

Maternal Communication with embryo

Read More  

INTERCER2 (2011)

Modelling and optimal design of ceramic structures with defects and imperfect interfaces

Read More  

CARDIO-DETECT (2009)

The detection of boundary changes as a method for early diagnosis of cardiovascular disease

Read More