| 000 | 02602n a2200301#a 4500 | ||
|---|---|---|---|
| 001 | 38185 | ||
| 003 | P5A | ||
| 005 | 20221213140608.0 | ||
| 007 | cr cuuuuuauuuu | ||
| 008 | 180306s2018 bl por d | ||
| 035 | _aocm51338542 | ||
| 040 |
_aP5A _cP5A |
||
| 082 | 0 | 4 | _acs |
| 090 | _acs | ||
| 100 | 1 |
_aDas, Shagnik _u(Freie Universitat Berlin, Germany) _99497 |
|
| 245 | 1 | 0 | _aSupersaturation for Disjoint Pairs. |
| 260 |
_aRio de Janeiro: _bIMPA, _c2018. |
||
| 300 | _avideo online | ||
| 500 | _aShort Talk. | ||
| 505 | 2 | _aSecond focus week of the Workshop on Graphs and Randomness. Minicourse on Complex graphs and networks by Remco van den Hofstad (TU Eindhoven). Invited participants: Béla Bollobás (Cambridge), Remco van der Hofstad (TU Eindhoven), Yuval Peres (Microsoft Research), Joel Spencer (Courant Inst, NYU). The systematic study of Random Graphs started with the seminal of Erdos and Rényi in the 1960s. Most early work on the topic came from the combinatorics community. Probabilists gradually joined in, bringing sophisticated tools that shed new light on the topic. At the same time, discrete mathematics enriched probability with new problems, techniques and ideas. Further stimulus came from complex networks that appear in many application domains. A different, but related direction is the study of random processes on graphs. Random walks on finite graphs, and their properties such as mixing, hitting and cover times, are a classical topic. New discoveries in this area are still being made, and many combinatorialists have made significant contributions. Interacting particle systems on finite graphs have recently become prominent, partly because of their usefulness as models for many phenomena.This focus week brings together leading experts in the above topics. We will have a minicourse and a small number of talks meant to encourage further research. | |
| 650 | 0 | 4 |
_aMatematica. _2larpcal _919899 |
| 697 |
_aCongressos e Seminários. _923755 |
||
| 711 | 2 |
_aGraphs and Randomness _d(2018: _cIMPA, Rio de Janeiro, Brazil) _99489 |
|
| 856 | 4 |
_zEVENTO _uhttps://impa.br/eventos-do-impa/eventos-2018/graphs-and-randomness/ |
|
| 856 | 4 |
_zRESUMO _uhttps://impa.br/wp-content/uploads/2018/02/Graphs-n-Random2018_SDas.pdf |
|
| 856 | 4 |
_zVIDEO _uhttps://www.youtube.com/watch?v=ojsg09AGvaA&index=25&list=PLo4jXE-LdDTQrwYwKTh6NwySaeDef9SXK&t=0s |
|
| 942 |
_2ddc _cBK |
||
| 999 |
_aSUPERSATURATION for Disjoint Pairs. Rio de Janeiro: IMPA, 2018. video online. Disponível em: <https://impa.br/eventos-do-impa/eventos-2018/graphs-and-randomness/>. Acesso em: 5 mar. 2018. _c36844 _d36844 |
||