Notice
Emergence of extended states at zero in the spectrum of sparse random graphs (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodulaires)
- document 1 document 2 document 3
- niveau 1 niveau 2 niveau 3
Descriptif
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. This is achieved by a detailed second-order analysis of the resolvent (A−z)−1 near the singular point z=0, where A is the adjacency operator of the Poisson-Galton-Watson tree with mean offspring c. More generally, our method applies to arbitrary unimodular Galton-Watson trees, yielding explicit criteria for the presence or absence of extended states at zero in the limiting spectral measure of a variety of random graph models, in terms of the underlying degree distribution. Joint work with Simon Coste.
Thème
Documentation
Documents pédagogiques
Dans la même collection
-
Subdiffusivity of random walks on random planar maps, via stationarity (workshop ERC Nemo Processus…
CurienNicolasRandom planar maps have been the subject of numerous studies over the last years. They are instance of stationary and reversible random planar maps exhibiting a non-conventional geometry at
-
Spectral embedding for graph classification (workshop ERC Nemo Processus ponctuels et graphes aléat…
LelargeMarcLearning on graphs requires a graph feature representation able to discriminate among different graphs while being amenable to fast computation. The graph isomorphism problem tells us that no
-
A stable marriage between order and disorder (workshop ERC Nemo Processus ponctuels et graphes aléa…
LastGünterStable matchings were introduced in a seminal paper by Gale and Shapley (1962) and play an important role in economics. Following closely Holroyd, Pemantle, Peres and Schramm (2009), we shall
-
Comments and problems regarding large graphs. (workshop ERC Nemo Processus ponctuels et graphes alé…
BenjaminiItaiWe will discuss a couple of results and questions regarding the structure of large graphs. These include vertex transitive graphs, expanders and random graphs.
-
Central Limit theorem for quasi-local statistics of point processes with fast decay of correlations…
We shall consider Euclidean stationary point processes which have fast decay of correlations i.e., their correlation functions factorize upto an additive error decaying exponentially in the
-
On the modified Palm version (workshop ERC Nemo Processus ponctuels et graphes aléatoires unimodula…
ThorissonHermannThe Palm version of a stationary random measure is an important tool in probability. It is however not well known that there are in fact two Palm versions, with related but different
-
Absence of percolation for Poisson outdegree-one graphs (workshop ERC Nemo Processus ponctuels et g…
CoupierDavidA Poisson outdegree-one graph is a directed graph based on a marked Poisson point process such that each vertex has only one outgoing edge. We state the absence of percolation for such graphs
-
Point processes, cost and the growth of rank for locally compact groups (workshop ERC Nemo Processu…
AbertMiklósThe cost of a vertex transitive graph is the infimum of the expected degree of an invariant random wiring of the graph. Similarly, one can define the cost of a point process on a homogeneous
-
On the notion of dimension of unimodular discrete spaces (workshop ERC Nemo Processus ponctuels et …
KhezeliAliIn 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
-
A notion of entropy for limits of sparse marked graphs (workshop ERC Nemo Processus ponctuels et gr…
AnantharamVenkatBordenave and Caputo (2014) defined a notion of entropy for probability distributions on rooted graphs with finite expected degree at the root. When such a probability distribution \rho has finite BC
-
Stein-Malliavin method for discrete alpha stable point processes (workshop ERC Nemo Processus ponct…
DecreusefondLaurentThe notion of discrete alpha-stable point processes generalizes to point processes the notion of stable distribution. It has been introduced and studied by Davydov, Molchanov and Zuyev a few
-
Strict monotonicity of percolation thresholds under covering maps (workshop ERC Nemo Processus ponc…
MartineauSébastienPercolation is a model for propagation in porous media that as introduced in 1957 by Broadbent and Hammersley. An infinite graph G models the geometry of the situation and a parameter p
Avec les mêmes intervenants et intervenantes
-
Do there exist expanders with non-negative curvature ?
SalezJustinIn this talk I will briefly recall the framework of local weak limits of finite graphs introduced by I. Benjamini and O. Schramm