Related papers: Fluctuations in a general preferential attachment …
We study preferential attachment models where vertices enter the network with i.i.d. random numbers of edges that we call the out-degree. We identify the local limit of such models, substantially extending the work of Berger et al.(2014).…
We derive distributional approximations for the number of triangles in the linear preferential attachment model $\mathrm{PAM}(m,\delta)$, where $m\ge 2$ and $\delta>-m$, with explicit rates of convergence. The limiting distribution…
We use Stein's method to provide non asymptotic $L^1$ bounds to the normal for functionals of associated point processes. As for supporting tools, we use the connection between association and $\alpha$-mixing properties that was recently…
The number of common friends (or connections) in a graph is a commonly used measure of proximity between two nodes. Such measures are used in link prediction algorithms and recommendation systems in large online social networks. We obtain…
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…
Diffusion approximations are widely used in the analysis of service systems, providing tractable insights into complex models. While heavy-traffic limit theorems justify these approximations asymptotically, they do not quantify the error…
We consider a pair of identical fermions with a short-range attractive interaction on a finite lattice cluster in the presence of strong site disorder. This toy model imitates a low density regime of the strongly disordered Hubbard model.…
Convergence of order $O(1/\sqrt{n})$ is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The…
We study normal approximations for a class of discrete-time occupancy processes, namely, Markov chains with transition kernels of product Bernoulli form. This class encompasses numerous models which appear in the complex networks…
We provide a proof of a recently conjectured universal bound on current fluctuations in Markovian processes. This bound establishes a link between the fluctuations of an individual observable current, the cycle affinities driving the system…
We study ergodic properties of a class of Markov-modulated general birth-death processes under fast regime switching. The first set of results concerns the ergodic properties of the properly scaled joint Markov process with a parameter that…
We study the growth of a directed network, in which the growth is constrained by the cost of adding links to the existing nodes. We propose a new preferential-attachment scheme, in which a new node attaches to an existing node i with…
In this paper, we propose a growing random complex network model, which we call context dependent preferential attachment model (CDPAM), when the preference of a new node to get attached to old nodes is determined by the local and global…
We study a majority based preference diffusion model in which the members of a social network update their preferences based on those of their connections. Consider an undirected graph where each node has a strict linear order over a set of…
We numerically study the distribution function of the conductance (transmission) in the one-dimensional tight-binding Anderson and periodic-on-average superlattice models in the region of fluctuation states where single parameter scaling is…
In this article we presented a brief study of the main network models with growth and preferential attachment. Such models are interesting because they present several characteristics of real systems. We started with the classical model…
In the Yule-Simon process, selection of words follows the preferential attachment mechanism, resulting in the power-law growth in the cumulative number of individual word occurrences. This is derived using mean-field approximation, assuming…
Variational inference has become one of the most widely used methods in latent variable modeling. In its basic form, variational inference employs a fully factorized variational distribution and minimizes its KL divergence to the posterior.…
Stein's method is a powerful technique for proving central limit theorems in probability theory when more straightforward approaches cannot be implemented easily. This article begins with a survey of the historical development of Stein's…
We analyze a dynamic random undirected graph in which newly added vertices are connected to those already present in the graph either using, with probability $p$, an anti-preferential attachment mechanism or, with probability $1-p$, a…