Related papers: Fluctuations in a general preferential attachment …
We study a generalization of the affine preferential attachment model where triangles are randomly added to the graph. We show that the model exhibits an asymptotically power-law degree distribution with adjustable parameter $\gamma\in…
We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of…
We consider the preferential attachment model with location-based choice introduced by Haslegrave, Jordan and Yarrow as a model in which condensation phenomena can occur [Haslegrave et al. 2020]. In this model every vertex carries an…
We propose a model that generates a new class of networks exhibiting power-law degree distribution with a spectrum of exponents depending on the number of links ($m$) with which incoming nodes join the existing network. Unlike the…
The Barab\'asi-Albert model is a popular scheme for creating scale-free graphs but has been previously shown to have ambiguities in its definition. In this paper we discuss a new ambiguity in the definition of the BA model by identifying…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
We consider a simple Preferential Attachment graph process, which begins with a finite graph, and in which a new $(t+1)$st vertex is added at each subsequent time step $t$, and connected to each previous vertex $u \leq t$ with probability…
We derive and analyze new diffusion approximations of stationary distributions of Markov chains that are based on second- and higher-order terms in the expansion of the Markov chain generator. Our approximations achieve a higher degree of…
Let $M$ be a random matrix in the orthogonal group $\O_n$, distributed according to Haar measure, and let $A$ be a fixed $n\times n$ matrix over $\R$ such that $\tr(AA^t)=n$. Then the total variation distance of the random variable…
Let $(X_n)_{n=0}^\infty$ denote a Markov chain on a Polish space that has a stationary distribution $\varpi$. This article concerns upper bounds on the Wasserstein distance between the distribution of $X_n$ and $\varpi$. In particular, an…
In an affiliation network vertices are linked to attributes and two vertices are declared adjacent whenever they share a common attribute. For example, two customers of an internet shop are called adjacent if they have purchased the same or…
The random graph model has recently been extended to a random preferential attachment graph model, in order to enable the study of general asymptotic properties in network types that are better represented by the preferential attachment…
We study an evolving spatial network in which sequentially arriving vertices are joined to existing vertices at random according to a rule that combines preference according to degree with preference according to spatial proximity. We…
Global degree/strength based preferential attachment is widely used as an evolution mechanism of networks. But it is hard to believe that any individual can get global information and shape the network architecture based on it. In this…
The preferential attachment (PA) model is a popular way of modeling dynamic social networks, such as collaboration networks. Assuming that the PA function takes a parametric form, we propose and study the maximum likelihood estimator of the…
We introduce and solve a model that mimics the herding effect in financial markets when groups of agents share information. The number of agents in the model is growing and at each time step either (i) with probability $p$ an incoming agent…
We investigate two asymptotic properties of a spatial preferential-attachment model introduced by E. Jacob and P. M\"orters (2013). First, in a regime of strong linear reinforcement, we show that typical distances are at most of…
Strong embeddings, that is, couplings between a partial sum process of a sequence of random variables and a Brownian motion, have found numerous applications in probability and statistics. We extend Chatterjee's novel use of Stein's method…
Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…
Stein's method provides a way of bounding the distance of a probability distribution to a target distribution $\mu$. Here we develop Stein's method for the class of discrete Gibbs measures with a density $e^V$, where $V$ is the energy…