We consider the preferential attachment model with location-based choice introduced by Haslegrave et al. (Random Struct Algorithms 56(3):775-795, 2020) as a model in which condensation phenomena can occur. In this model, each vertex carries an independent and uniformly distributed location. Starting from an initial tree, the model evolves in discrete time. At every time step, a new vertex is added to the tree by selecting r candidate vertices from the graph with replacement according to a sampling probability proportional to these vertices' degrees. The new vertex then connects to one of the candidates according to a given probability associated to the ranking of their locations. In this paper, we introduce a function that describes the pha...
We consider an evolving preferential attachment random graph model where at discrete times a new nod...
A random graph evolution mechanism is defined. The evolution studied is a combination of the prefere...
We study the phase transition in a random graph in which vertices and edges are added at constant ra...
We consider the preferential attachment model with location-based choice introduced by Haslegrave et...
We investigate the use of stochastic approximation as a method of identifying conditions necessary t...
We introduce a new model of a preferential attachment based random graph which extends the family of...
We consider the degree distributions of preferential attachment ran-dom graph models with choice sim...
We study the basic preferential attachment process, which generates a sequence of random trees, each...
Abstract. We prove almost sure convergence of the maximum degree in an evolving tree model combining...
In this paper, a random graph process {G(t)} (ta parts per thousand yen1) is studied and its degree ...
In this paper, a random graph process {G(t)}t≥1 is studied and its degree sequence is analyzed. Let ...
In this paper, a random graph process {G(t)}t≥1 is studied and its degree sequence is analyzed. Let ...
In a 2-parameter scale free model of random graphs it is shown that the asymptotic degree distributi...
Two preferential attachment-type graph models which allow for dynamic addition/deletion of edges/ver...
We investigate spatial random graphs defined on the points of a Poisson process in d-dimensional spa...
We consider an evolving preferential attachment random graph model where at discrete times a new nod...
A random graph evolution mechanism is defined. The evolution studied is a combination of the prefere...
We study the phase transition in a random graph in which vertices and edges are added at constant ra...
We consider the preferential attachment model with location-based choice introduced by Haslegrave et...
We investigate the use of stochastic approximation as a method of identifying conditions necessary t...
We introduce a new model of a preferential attachment based random graph which extends the family of...
We consider the degree distributions of preferential attachment ran-dom graph models with choice sim...
We study the basic preferential attachment process, which generates a sequence of random trees, each...
Abstract. We prove almost sure convergence of the maximum degree in an evolving tree model combining...
In this paper, a random graph process {G(t)} (ta parts per thousand yen1) is studied and its degree ...
In this paper, a random graph process {G(t)}t≥1 is studied and its degree sequence is analyzed. Let ...
In this paper, a random graph process {G(t)}t≥1 is studied and its degree sequence is analyzed. Let ...
In a 2-parameter scale free model of random graphs it is shown that the asymptotic degree distributi...
Two preferential attachment-type graph models which allow for dynamic addition/deletion of edges/ver...
We investigate spatial random graphs defined on the points of a Poisson process in d-dimensional spa...
We consider an evolving preferential attachment random graph model where at discrete times a new nod...
A random graph evolution mechanism is defined. The evolution studied is a combination of the prefere...
We study the phase transition in a random graph in which vertices and edges are added at constant ra...