Conférences
le (45m22s)
Résultats de recherche
Trier par :
Nombre de programmes trouvés : 24
Conférences
le (51m43s)
On the notion of dimension of unimodular discrete spaces (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
...In this talk we will define notions of dimension for unimodular random graphs and point-stationary point processes. These notions are in spirit similar to the Minkowski dimension and the Hausdorff dimension. The key point in the definitions... Voir la vidéo
Conférences
le (43m45s)
De Castro - Spectral convergence of random graphs and a focus on random geometric graphs
...In this talk, we present a non-asymptotic bound on the L2 distance between the spectrum of the probability matrix of a random graph and the spectrum of the integral operator. Then, we study the random geometric graph model and we show how to... Voir la vidéo
Conférences
le (56m5s)
Eternal family trees and dynamics on unimodular random graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
... as vertex-shifts here. These dynamics have point-shifts on point processes as a subclass. First we give a classification of vertex-shifts on unimodular random networks. Each such vertex-shift partitions the vertices into a collection of connected components... Voir la vidéo
Conférences
le (46m11s)
Central Limit theorem for quasi-local statistics of point processes with fast decay of correlations (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
... the point process, we refer to statistics that can be expressed as sum of contributions from the points and the contribution of every point being determined by a random ball around the point whose radius has an exponential tail. There are many... Voir la vidéo
Conférences
le (42m3s)
Verzelen - Clustering with the relaxed K-means
...This talk is devoted to clustering problems. It amounts to partitionning a set of given points or the nodes of a given graph, in such a way that the groups are as homogeneous as possible. After introducing two random instances of this problem,... Voir la vidéo
Conférences
le (39m53s)
Emergence of extended states at zero in the spectrum of sparse random graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
...We confirm the long-standing prediction that c=e≈2.718 is the threshold for the emergence of a non-vanishing absolutely continuous part (extended states) at zero in the limiting spectrum of the Erdős-Renyi random graph with average degree c.... Voir la vidéo
Conférences
le (52m52s)
Absence of percolation for Poisson outdegree-one graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
... roughly says that the graph is locally determined with possible random horizons. The Loop assumption ensures that any forward branch merges on a loop provided that the Poisson point process is augmented with a finite collection of well-chosen points.... Voir la vidéo
Cours magistraux
le (1h33m49s)
R. Dujardin - Some problems of arithmetic origin in complex dynamics and geometry (part1)
... and Gauthier). A key technical tool in these results is the equidistribution theory of points of small height. If time permits, we’ll also discuss the related problem of the equidistribution of roots of random polynomials.... Voir la vidéo
Cours magistraux
le (1h31m1s)
