\u3cp\u3eScale-free percolation is a percolation model on Z\u3csup\u3ed\u3c/sup\u3e which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience versus recurrence for dimension 1 and 2 and give sufficient conditions for transience in dimension 3 and higher. Finally, we show the existence of a hierarchical structure for parameters where vertices have degrees with infinite variance and obtain bounds on the cluster density.\u3c/p\u3
Abstract. The aim of this paper is to extend the well-known asymptotic shape result for first-passag...
Abstract: We study long-range Bernoulli percolation on Zd in which each two vertices x and y are con...
The aim of this paper is to extend the well-known asymptotic shape result for first-passage percolat...
Scale-free percolation is a percolation model on Zd which can be used to model real-world networks. ...
AbstractWe reinvestigate the 2D problem of the inhomogeneous incipient infinite cluster where, in an...
We study a long-range percolation model in the hierarchical lattice ΩN of order N where probability ...
Abstract We formulate and study a model for inhomogeneous long-range percolation on Zd. Each vertex ...
Funder: University of CambridgeAbstract: Let G be a connected, locally finite, transitive graph, and...
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...
We construct the incipient infinite cluster measure (IIC) for sufficiently spread-out ori-ented perc...
\u3cp\u3eIn this paper we study typical distances in the configuration model, when the degrees have ...
In this paper, we study the abundance of self-avoiding paths of a given length on a supercritical pe...
We construct the incipient infinite cluster measure (IIC) for sufficiently spread-out ori-ented perc...
Spatial random graphs capture several important properties of real-world networks. We prove quenched...
Abstract. The aim of this paper is to extend the well-known asymptotic shape result for first-passag...
Abstract: We study long-range Bernoulli percolation on Zd in which each two vertices x and y are con...
The aim of this paper is to extend the well-known asymptotic shape result for first-passage percolat...
Scale-free percolation is a percolation model on Zd which can be used to model real-world networks. ...
AbstractWe reinvestigate the 2D problem of the inhomogeneous incipient infinite cluster where, in an...
We study a long-range percolation model in the hierarchical lattice ΩN of order N where probability ...
Abstract We formulate and study a model for inhomogeneous long-range percolation on Zd. Each vertex ...
Funder: University of CambridgeAbstract: Let G be a connected, locally finite, transitive graph, and...
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...
We construct the incipient infinite cluster measure (IIC) for sufficiently spread-out ori-ented perc...
\u3cp\u3eIn this paper we study typical distances in the configuration model, when the degrees have ...
In this paper, we study the abundance of self-avoiding paths of a given length on a supercritical pe...
We construct the incipient infinite cluster measure (IIC) for sufficiently spread-out ori-ented perc...
Spatial random graphs capture several important properties of real-world networks. We prove quenched...
Abstract. The aim of this paper is to extend the well-known asymptotic shape result for first-passag...
Abstract: We study long-range Bernoulli percolation on Zd in which each two vertices x and y are con...
The aim of this paper is to extend the well-known asymptotic shape result for first-passage percolat...