The study of random graphs has become very popular for real-life network modeling, such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice Zd, d ≥ 1, is a particular attractive example of a random graph model because it fulfills several stylized facts of real-life networks. For this model, various geometric properties, such as the percolation behavior, the degree distribution and graph distances, have been analyzed. In the present paper, we complement the picture of graph distances and we prove continuity of the percolation probability in the phase transition point. We also provide an illustration of the model connected to financial networks
We investigate spatial random graphs defined on the points of a Poisson process in d-dimensional spa...
We survey the recent work on phase transition and distances in various random graph models with gene...
Spatial random graphs capture several important properties of real-world networks. We prove quenched...
The study of random graphs has become very popular for real-life network modeling, such as social ne...
The study of random graphs has become very popular for real-life network modeling, such as social ne...
Abstract We formulate and study a model for inhomogeneous long-range percolation on Zd. Each vertex ...
Abstract We formulate and study a model for inhomogeneous long-range percolation on Zd. Each vertex ...
We consider a large class of inhomogeneous spatial random graphs on the real line. Each vertex carri...
International audienceWe study the behavior of the random walk in a continuum independent long-range...
International audienceWe study the behavior of the random walk in a continuum independent long-range...
International audienceWe study the behavior of the random walk in a continuum independent long-range...
International audienceWe study the behavior of the random walk in a continuum independent long-range...
International audienceWe study the behavior of the random walk in a continuum independent long-range...
ABSTRACT: We study a random graph model which is a superposition of bond percolation on Zd with para...
We study a random graph model which is a superposition of bond percolation on Z(d) with parameter p,...
We investigate spatial random graphs defined on the points of a Poisson process in d-dimensional spa...
We survey the recent work on phase transition and distances in various random graph models with gene...
Spatial random graphs capture several important properties of real-world networks. We prove quenched...
The study of random graphs has become very popular for real-life network modeling, such as social ne...
The study of random graphs has become very popular for real-life network modeling, such as social ne...
Abstract We formulate and study a model for inhomogeneous long-range percolation on Zd. Each vertex ...
Abstract We formulate and study a model for inhomogeneous long-range percolation on Zd. Each vertex ...
We consider a large class of inhomogeneous spatial random graphs on the real line. Each vertex carri...
International audienceWe study the behavior of the random walk in a continuum independent long-range...
International audienceWe study the behavior of the random walk in a continuum independent long-range...
International audienceWe study the behavior of the random walk in a continuum independent long-range...
International audienceWe study the behavior of the random walk in a continuum independent long-range...
International audienceWe study the behavior of the random walk in a continuum independent long-range...
ABSTRACT: We study a random graph model which is a superposition of bond percolation on Zd with para...
We study a random graph model which is a superposition of bond percolation on Z(d) with parameter p,...
We investigate spatial random graphs defined on the points of a Poisson process in d-dimensional spa...
We survey the recent work on phase transition and distances in various random graph models with gene...
Spatial random graphs capture several important properties of real-world networks. We prove quenched...