Related papers: Asymptotics for Sparse Exponential Random Graph Mo…
We consider a non-projective class of inhomogeneous random graph models with interpretable parameters and a number of interesting asymptotic properties. Using the results of Bollob\'as et al. [2007], we show that i) the class of models is…
Finding independent sets of maximum size in fixed graphs is well known to be an NP-hard task. Using scaling limits, we characterise the asymptotics of sequential degree-greedy explorations and provide sufficient conditions for this…
We show the asymptotic degree distribution of the typical vertex of a sparse inhomogeneous random intersection graph.
We propose a new class of semiparametric exponential family graphical models for the analysis of high dimensional mixed data. Different from the existing mixed graphical models, we allow the nodewise conditional distributions to be…
Delattre et al. (2013) investigated asymptotic properties of the maximum likelihood estimator of the population parameters of the random effects associated with n independent stochastic differential equations (SDEs) assuming that the SDEs…
Hierarchical statistical models are widely employed in information science and data engineering. The models consist of two types of variables: observable variables that represent the given data and latent variables for the unobservable…
In this paper, we analyze the exact asymptotic behavior of the connectivity probability in a random binomial bipartite graph $G(n,m,p)$ under various regimes of the edge probability $p=p(n)$. To determine this probability, a method based on…
In the inhomogeneous random graph model, each vertex $i\in\{1,\ldots,n\}$ is assigned a weight $W_i\sim\text{Unif}(0,1)$, and an edge between any two vertices $i,j$ is present with probability $k(W_i,W_j)/\lambda_n\in[0,1]$, where $k$ is a…
We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…
A law of large numbers for the empirical distribution of parameters of a one-layer artificial neural networks with sparse connectivity is derived for a simultaneously increasing number of both, neurons and training iterations of the…
We study asymptotic behaviour of the correlation functions of bipartite sparse random $N\times N$ matrices. We assume that the graphs have $N$ vertices, the ratio of parts is $\displaystyle\frac{\alpha}{1-\alpha}$ and the average number of…
We study models of weighted exponential random graphs in the large network limit. These models have recently been proposed to model weighted network data arising from a host of applications including socio-econometric data such as migration…
This paper studies the asymptotic distribution of a constrained lasso-type estimator for denoising signals defined on the nodes of a graph, where the underlying structure encodes relationships between variables. We show that, under suitable…
We consider maximum rooted tree extension counts in random graphs, i.e., we consider M_n = \max_v X_v where X_v counts the number of copies of a given tree in G_{n,p} rooted at vertex v. We determine the asymptotics of M_n when the random…
We investigate structural properties of large, sparse random graphs through the lens of "sampling convergence" (Borgs et. al. (2017)). Sampling convergence generalizes left convergence to sparse graphs, and describes the limit in terms of a…
We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a…
We deal with a general preferential attachment graph model with multiple type edges. The types are chosen randomly, in a way that depends on the evolution of the graph. In the $N$-type case, we define the (generalized) degree of a given…
Random network models generated using sparse exchangeable graphs have provided a mechanism to study a wide variety of complex real-life networks. In particular, these models help with investigating power-law properties of degree…
Traditionally, graph neural networks have been trained using a single observed graph. However, the observed graph represents only one possible realization. In many applications, the graph may encounter uncertainties, such as having…
We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We…