Related papers: Degree counts in random simplicial complexes of th…
We derive theorems which outline explicit mechanisms by which anomalous scaling for the probability density function of the sum of many correlated random variables asymptotically prevails. The results characterize general anomalous scaling…
In this paper we investigate geometric properties of graphs generated by a preferential attachment random graph model with edge-steps. More precisely, at each time $t\in\mathbb{N}$, with probability $p$ a new vertex is added to the graph (a…
The main purpose of this paper is to obtain strong laws of large numbers for arrays or weighted sums of random variables under a scenario of dependence. Namely, for triangular arrays $\{X_{n,k}, \, 1 \leqslant k \leqslant n, \, n \geqslant…
In a one-parameter model for evolution of random trees, which also includes the Barabasi-Albert random tree, almost sure behavior and the limiting distribution of the degree of a vertex in a fixed position are examined. Results about Polya…
Using a steady state process of node duplication and deletion we produce networks with 1/k scale-free degree distributions in the limit of vanishing connectance. This occurs even though there is no growth involved and inherent preferential…
We present a method for the construction of ensembles of random networks that consist of a single connected component with a given degree distribution. This approach extends the construction toolbox of random networks beyond the…
The configuration model generates random graphs with any given degree distribution, and thus serves as a null model for scale-free networks with power-law degrees and unbounded degree fluctuations. For this setting, we study the local…
Bollob\'as-Riordan random pairing model of a preferential attachment graph $G_m^n$ is studied. Let $\{W_j\}_{j\le mn+1}$ be the process of sums of independent exponentials with mean $1$. We prove that the degrees of the first…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
Random networks are widely used to model complex networks and research their properties. In order to get a good approximation of complex networks encountered in various disciplines of science, the ability to tune various statistical…
Clustering is well-known to play a prominent role in the description and understanding of complex networks, and a large spectrum of tools and ideas have been introduced to this end. In particular, it has been recognized that the abundance…
We study a new class of so-called rational-infinitely (or quasi-infinitely) divisible probability laws on the real line. The characteristic functions of these distributions are ratios of the characteristic functions of classical infinitely…
In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…
We study a generalisation of the random recursive tree (RRT) model and its multigraph counterpart, the uniform directed acyclic graph (DAG). Here, vertices are equipped with a random vertex-weight representing initial inhomogeneities in the…
We consider the question "Is every nonzero generic degree a density-1-bounding generic degree?" By previous results \cite{I2} either resolution of this question would answer an open question concerning the structure of the generic degrees:…
We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clustering coefficients. We show the asymptotic degree…
Preferential attachment probabilities scheme appear in the context of scale free random graphs [1],[2]. In this work we present preferential attachment probabilities scheme as a sequence of dependent Bernoulli random variables and we give…
Many real-world networks exhibit correlations between the node degrees. For instance, in social networks nodes tend to connect to nodes of similar degree. Conversely, in biological and technological networks, high-degree nodes tend to be…
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…
This paper studies when a sequence of probability measures on a metric space admit subsequential weak limits. A sufficient condition called sequential tightness is formulated, which relaxes some assumptions for asymptotic tightness used in…