Notice
Percolation of random fields excursions
- document 1 document 2 document 3
- niveau 1 niveau 2 niveau 3
Descriptif
We consider homogeneous real random functions defined on the Euclidean space. We are in particular interested in the percolation properties of their excursion sets in dimension 2, defined as the (random) sets obtained after thresholding the field at some fixed value which is the parameter. We will present some results obtained for 1- centred Gaussian random fields and 2- for shot-noise fields, which can be seen as the Poisson counterparts of Gaussian fields. It turns out that under mild assumptions, as in many parametric models, there is a critical value that separates percolation from non-percolation, and we furthermore observe a sharp phase transition around this value. For symmetric auto-dual models, and in particular for Gaussian excursions, the critical value is trivially 0. For non-symmetric shot-noise excursions, we estimate the critical value at high intensity by approximating the shot-noise field by a Gaussian field through a strong invariance principle.
Thème
Dans la même collection
-
Combinatorial maps in high genus
LoufBaptisteCombinatorial maps are a model of discrete geometry: they are surfaces made by gluing polygons along their sides, or equivalently, graphs drawn on surfaces. In this talk, I'll focus on the study of
-
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
-
Tail bounds for detection times in mobile hyperbolic graphs
MitscheDieterMotivated by Krioukov et al.'s model of random hyperbolic graphs for real-world networks, and inspired by the analysis of a dynamic model of graphs in Euclidean space by Peres et al., we introduce a
-
Online matching for the multiclass Stochastic Block Model
SOPRANO LOTONahuelA matching in a graph is a set of edges that do not share endpoints. Developing algorithms that find large matchings is an important problem. An algorithm is said to be online if it has to construct
-
Critical cluster cascades
KirchnerMatthiasWe consider a sequence of Poisson cluster point processes...
-
Point processes on higher rank symmetric spaces and their cost
MellickSamuelCost is a natural invariant associated to group actions and invariant point processes on symmetric spaces (such as Euclidean space and hyperbolic space). Informally, it measures how difficult it is to
-
Parallel server systems in extended heavy traffic
CastielEyalThe standard setting for studying parallel server systems (PSS) at the diffusion scale is based on the heavy traffic condition (HTC)...
-
The Maximal Agreement Subtree problem for random trees
BudzinskiThomasConsider two binary trees whose leaves are labelled from 1 to n.
-
An Improved Lower Bound on the Largest Common Subtree of Random Leaf-Labeled Binary Trees
KhezeliAliIt is known that the size of the largest common subtree...
-
Reversible Markov decision processes
AnantharamVenkatA Markov decision process is called reversible if for every stationary Markov control strategy the resulting Markov chain is reversible.
-
The question of connectedness in the Free Uniform Spanning Forest
TimárÁdám DávidThe uniform measure on the set of all spanning trees of a finite graph is a classical object in probability.
-
Optimal Convex and Nonconvex Regularizers for a Data Source
O'ReillyElizaRegularization is a widespread technique used in statistical estimation problems that helps to capture low dimensional structure in the data and improve signal recovery.
Sur le même thème
-
Bruit, erreur, anomalie et incertitude dans les données-PUDD
RossiFabriceLes données collectées sont systématiquement soumises à des perturbations de diverses natures, depuis le bruit de mesure de capteurs jusqu’aux erreurs de saisie.
-
Combinatorial maps in high genus
LoufBaptisteCombinatorial maps are a model of discrete geometry: they are surfaces made by gluing polygons along their sides, or equivalently, graphs drawn on surfaces. In this talk, I'll focus on the study of
-
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
-
Tail bounds for detection times in mobile hyperbolic graphs
MitscheDieterMotivated by Krioukov et al.'s model of random hyperbolic graphs for real-world networks, and inspired by the analysis of a dynamic model of graphs in Euclidean space by Peres et al., we introduce a
-
Sofic entropy of processes on infinite random trees
BordenaveCharlesThis is a joint work with Agnes Backhausz et Balasz Szegedy. We define a natural notion of micro-state entropy...
-
Online matching for the multiclass Stochastic Block Model
SOPRANO LOTONahuelA matching in a graph is a set of edges that do not share endpoints. Developing algorithms that find large matchings is an important problem. An algorithm is said to be online if it has to construct
-
Critical cluster cascades
KirchnerMatthiasWe consider a sequence of Poisson cluster point processes...
-
Point processes on higher rank symmetric spaces and their cost
MellickSamuelCost is a natural invariant associated to group actions and invariant point processes on symmetric spaces (such as Euclidean space and hyperbolic space). Informally, it measures how difficult it is to
-
Parallel server systems in extended heavy traffic
CastielEyalThe standard setting for studying parallel server systems (PSS) at the diffusion scale is based on the heavy traffic condition (HTC)...
-
The Maximal Agreement Subtree problem for random trees
BudzinskiThomasConsider two binary trees whose leaves are labelled from 1 to n.
-
An Improved Lower Bound on the Largest Common Subtree of Random Leaf-Labeled Binary Trees
KhezeliAliIt is known that the size of the largest common subtree...
-
Reversible Markov decision processes
AnantharamVenkatA Markov decision process is called reversible if for every stationary Markov control strategy the resulting Markov chain is reversible.
