4 projets européens trouvés
Recherche sur 125080 projets européens
TERMINÉ
Regularity and Irregularity in Combinatorics and Number Theory (REGULARITY)
Date du début: 1 mars 2013, Date de fin: 28 févr. 2018,
"Regularity and irregularity plays a central role in mathematics. In the present research proposal we will select problems from combinatorics and number theory (including additive combinatorics), where regularity and irregularity appear. In some cases we have to deal, e.g., with arbitrary finite or infinite subsets of natural numbers, where the only information we have is their cardinality, namel ...
Voir le projet
1
Participant partenaire
TERMINÉ
"DISCRETE AND CONVEX GEOMETRY: CHALLENGES, METHODS, APPLICATIONS" (DISCONV)
Date du début: 1 avr. 2011, Date de fin: 31 mars 2017,
"Title: Discrete and convex geometry: challenges, methods, applicationsAbstract: Research in discrete and convex geometry, using tools from combinatorics, algebraictopology, probability theory, number theory, and algebra, with applications in theoreticalcomputer science, integer programming, and operations research. Algorithmic aspects areemphasized and often serve as motivation or simply dictate ...
Voir le projet
1
Participant partenaire
TERMINÉ
Graph Convergence and Stochastic Processes on Graphs (GraphConvStoch)
Date du début: 1 févr. 2015, Date de fin: 31 janv. 2017,
The proposal covers the following interconnected topics:1. Benjamini-Schramm limits of finite graphs and stochastic processes on graphs;2. continuity and testability of graph parameters;3. factors of Bernoulli i.i.d. labellings;4. graph sequences from groups.The central object for the proposed research is sequences of sparse graphs (either coming from some random graph model or from Cayley graphs) ...
Voir le projet
1
Participant partenaire
TERMINÉ
Benjamini-Schramm approximation of Groups and Graphings (BAG)
Date du début: 1 mars 2014, Date de fin: 30 mars 2016,
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. ...
Voir le projet