Related papers: Limiting distributions of triangle counts in linea…
For $0<\alpha<1,$ and $\theta>-\alpha,$ let $(S^{-\alpha}_{\alpha,\theta+r})_{\{r\ge 0\}}$ denote an increasing(decreasing) sequence of variables forming a time inhomogeneous Markov chain whose marginal distributions are equivalent to…
We consider the preferential attachment model. This is a growing random graph such that at each step a new vertex is added and forms $m$ connections. The neighbors of the new vertex are chosen at random with probability proportional to…
We give an explicit construction of the weak local limit of a class of preferential attachment graphs. This limit contains all local information and allows several computations that are otherwise hard, for example, joint degree…
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…
Preferential attachment is a widely adopted paradigm for understanding the dynamics of social networks. Formal statistical inference,for instance GLM techniques, and model verification methods will require knowing test statistics are…
In this paper, we characterise the notion of preferential attachment in networks as action at a distance, and argue that it can only be an emergent phenomenon -- the actual mechanism by which networks grow always being the closing of…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. Using a high-degree expansion of the master equation, we…
We propose a preferential attachment model for network growth where new entering nodes have a partial information about the state of the network. Our main result is that the presence of bounded information modifies the degree distribution…
The directed preferential attachment model is revisited. A new exact characterization of the limiting in- and out-degree distribution is given by two \emph{independent} pure birth processes that are observed at a common exponentially…
We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…
Structural properties of large random maps and lambda-terms may be gleaned by studying the limit distributions of various parameters of interest. In our work we focus on restricted classes of maps and their counterparts in the…
We study the asymptotic diameter of the preferential attachment model $\operatorname{PA}\!_n^{(m,\delta)}$ with parameters $m \ge 2$ and $\delta > 0$. Building on the recent work \cite{VZ25}, we prove that the diameter of $G_n \sim…
This paper analyzes key properties of networks generated by geometric preferential attachment. We establish that the expected number of triangles is proportional to that of the standard preferential attachment model, with a proportionality…
We study an asymptotical behavior of the maximal degree in the degree distribution in an evolving tree model combining the local choice and the Mori's preferential attachment. In the considered model, the random graph is constructed in the…
I study partial identification of distributional parameters in triangular systems. This model consists of a nonparametric outcome equation and a selection equation. This allows for general unobserved heterogeneity and selection on…
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…
A network growth mechanism based on a two-step preferential rule is investigated as a model of network growth in which no global knowledge of the network is required. In the first filtering step a subset of fixed size $m$ of existing nodes…
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…