Related papers: Degree Distributions in Recursive Trees with Fitne…
We extend the classical preferential attachment random graph model to random simplicial complexes. At each stage of the model, we choose one of the existing $k$-simplices with probability proportional to its $k$-degree. The chosen…
We derive the sampling properties of random networks based on weights whose pairwise products parameterize independent Bernoulli trials. This enables an understanding of many degree-based network models, in which the structure of realized…
Consider a Crump-Mode-Jagers process generated by an increasing random walk whose increments have finite second moment. Let $Y_k(t)$ be the number of individuals in generation $k\in \mathbb N$ born in the time interval $[0,t]$. We prove a…
We consider an evolving random discrete tree model called Preferential Attachment with Vertex Death, as introduced by Deijfen. Initialised with an alive root labelled $1$, at each step $n\geq1$ either a new vertex with label $n+1$ is…
We comment on old and new results related to the destruction of a random recursive tree (RRT), in which its edges are cut one after the other in a uniform random order. In particular, we study the number of steps needed to isolate or…
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…
We study a variant of the standard random intersection graph model ($G(n,m,F,H)$) in which random weights are assigned to both vertex types in the bipartite structure. Under certain assumptions on the distributions of these weights, the…
A sequence of trees $(\mathcal{T}_{n})_{n \in \mathbb{N}}$ contains a \emph{persistent hub}, or displays \emph{degree centrality}, if there is a fixed node of maximal degree for all sufficiently large $n \in \mathbb{N}$. We derive…
In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent $\tau \in (2,3)$. We assign independent and identically distributed (i.i.d.)\ weights to…
We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…
In this paper we consider a simple model of random graph process with {\it hard} copying as follows: At each time step $t$, with probability $0<\alpha\leq 1$ a new vertex $v_t$ is added and $m$ edges incident with $v_t$ are added in the…
The spread of disease on complex networks has attracted widely attention in the physics community. Recent works have demonstrated that heterogeneous degree and weight distributions have a significant influence on the epidemic dynamics. In…
We investigate scaling limits of trees built by uniform attachment with freezing, which is a variant of the classical model of random recursive trees introduced in a companion paper. Here vertices are allowed to freeze, and arriving…
The contact process is a simple model for the spread of an infection in a structured population. We investigate the case when the underlying structure evolves dynamically as a degree-dependent dynamical percolation model. Starting with a…
Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weight-driven models are considered.…
A degree sequence is a sequence ${\bf s}=(N_i,i\geq 0)$ of non-negative integers satisfying $1+\sum_i iN_i=\sum_i N_i<\infty$. We are interested in the uniform distribution $\mathbb{P}_{{\bf s}}$ on rooted plane trees whose degree sequence…
Vector autoregression has been widely used for modeling and analysis of multivariate time series data. In high-dimensional settings, model parameter regularization schemes inducing sparsity yield interpretable models and achieved good…
We study the growth of bipartite networks in which the number of nodes in one of the partitions is kept fixed while the other partition is allowed to grow. We study random and preferential attachment as well as combination of both. We…
We obtain the degree distribution for a class of growing network models on flat and curved spaces. These models evolve by preferential attachment weighted by a function of the distance between nodes. The degree distribution of these models…
We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…