Related papers: Distances and large deviations in the spatial pref…
We consider a general preferential attachment model, where the probability that a newly arriving vertex connects to an older vertex is proportional to a sublinear function of the indegree of the older vertex at that time. It is well known…
This work is a continuation of [7]. We consider a continuous-time birth-and-death process in which the transition rates have an asymptotical power-law dependence upon the position of the process. We establish rough exponential asymptotic…
We propose a new approach to compute an interval over-approximation of the finite time reachable set for a large class of nonlinear systems. This approach relies on the notions of sensitivity matrices, which are the partial derivatives…
Inspired by empirical data on real world complex networks, the last few years have seen an explosion in proposed generative models to understand and explain observed properties of real world networks, including power law degree distribution…
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 a new model of competition on growing networks. This extends the preferential attachment model, with the key property that node choices evolve simultaneously with the network. When a new node joins the network, it chooses…
Stochastic versions of proximal methods have gained much attention in statistics and machine learning. These algorithms tend to admit simple, scalable forms, and enjoy numerical stability via implicit updates. In this work, we propose and…
We continue the development, started in of the asymptotic description of certain stochastic neural networks. We use the Large Deviation Principle (LDP) and the good rate function H announced there to prove that H has a unique minimum mu_e,…
We study large deviations for measurable averaging operators on state spaces of dynamical systems. Our main motivation is the Hecke operators on the modular curve Y_0(p^n) and their generalization to higher rank S-arithmetic quotients. We…
We study the asymptotic behavior of the maximum degree in the preferential attachment model with a choice-based edge-step. We add vertex type to the model and prove, among others types of behavior, the effect of condensation on multiple…
Scale independence is a ubiquitous feature of complex systems which implies a highly skewed distribution of resources with no characteristic scale. Research has long focused on why systems as varied as protein networks, evolution and stock…
In this paper we present a framework for the extension of the preferential attachment (PA) model to heterogeneous complex networks. We define a class of heterogeneous PA models, where node properties are described by fixed states in an…
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…
Preferential attachment in a directed scale-free graph is widely used to model the evolution of social networks. Statistical analyses of social networks often relies on node based data rather than conventional repeated sampling. For our…
We prove almost sure convergence of the maximum degree in an evolving tree model combining local choice and preferential attachment. At each step in the growth of the graph, a new vertex is introduced. A fixed, finite number of possible…
We consider the stationary measure of the asymmetric simple exclusion process (ASEP) on a finite interval in $\mathbb{Z}$ with open boundaries. Fixing all the jump rates and letting the system size approach infinity, the height profile of…
The network properties of a graph ensemble subject to the constraints imposed by the expected degree sequence are studied. It is found that the linear preferential attachment is a fundamental rule, as it keeps the maximal entropy in sparse…
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…
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…
We investigate the joint distribution of nodes of small degrees and the degree profile in preferential dynamic attachment circuits. In particular, we study the joint asymptotic distribution of the number of the nodes of outdegree $0$…