Related papers: Local limit of the random degree constrained proce…

Motivated by the scaling limits of the connected components of the configuration model, we study uniform connected multigraphs with fixed degree sequence $\mathcal{D}$ and with surplus $k$. We call those random graphs…

We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…

We establish the scaling limit of a class of boundary random walks to the full spectrum of Brownian-type processes on the half-line. By solving the associated martingale problem and employing weak convergence techniques, we prove that under…

We discuss several limiting degree distributions for a class of random threshold graphs in the many node regime. This analysis is carried out under a weak assumption on the distribution of the underlying fitness variable. This assumption,…

For a strictly stationary sequence of random variables we derive functional convergence of the joint partial sum and partial maxima process under joint regular variation with index $\alpha \in (0,2)$ and weak dependence conditions. The…

The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error…

We focus on the existence and characterization of the limit for a certain critical branching random walks in time-space random environment in one dimension which was introduced by M. Birnkenr et.al. Each particle performs simple random walk…

We study the asymptotic properties, in the weak sense, of regenerative processes and Markov renewal processes. For the latter, we derive both renewal-type results, also concerning the related counting process, and ergodic-type ones,…

We exploit a result by Nerman which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degrees in random graphs, where we obtain asymptotic normality…

We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n tend to infinity. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the…

Many recent problems in signal processing and machine learning such as compressed sensing, image restoration, matrix/tensor recovery, and non-negative matrix factorization can be cast as constrained optimization. Projected gradient descent…

Functional limit theorems for scaled fluctuations of occupation time processes of a sequence of critical branching particle systems in $\R^d$ with anisotropic space motions and strongly degenerated splitting abilities are proved in the…

In this paper, we establish a local limit theorem for linear fields of random variables constructed from independent and identically distributed innovations each with finite second moment. When the coefficients are absolutely summable we do…

Critical catalytic branching random walk on d-dimensional integer lattice is investigated for all d. The branching may occur at the origin only and the start point is arbitrary. The asymptotic behavior, as time grows to infinity, is…

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…

We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…

The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…

We consider events over the probability space generated by the degree sequences of multiple independent Erd\H{o}s-R\'enyi random graphs, and consider an approximation probability space where such degree sequences are deemed to be sequences…

This note gives an exponential tail approximation for the extinction time of a subcritical multitype branching process arising from the SIR epidemic model on a random graph with given degrees, where the type corresponds to the vertex…

We study the complexity of fundamental distributed graph problems in the recently popular setting where information about the input graph is available to the nodes before the start of the computation. We focus on the most common such…