相关论文: Stochastic processes in random graphs
The main results in this paper concern large deviations for families of non-Gaussian processes obtained as suitable perturbations of continuous centered multivariate Gaussian processes which satisfy a large deviation principle. We present…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
In this paper, we consider asymptotic behaviors of multiscale multivalued stochastic systems with small noises. First of all, for general, fully coupled systems for multivalued stochastic differential equations of slow and fast motions with…
We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical…
We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…
We study the size of the largest biconnected components in sparse Erd\H{o}s-R\'enyi graphs with finite connectivity and Barab\'asi-Albert graphs with non-integer mean degree. Using a statistical-mechanics inspired Monte Carlo approach we…
In this paper, we investigate the asymptotic error distributions of symplectic methods for stochastic Hamiltonian systems and further provide Hamiltonian-specific analysis that clarifies the superiority of symplectic methods. Our…
We study the properties of the giant connected component in random graphs with arbitrary degree distribution. We concentrate on the degree-degree correlations. We show that the adjoining nodes in the giant connected component are correlated…
In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.
In this paper, we study the asymptotic behavior of a semi-linear slow-fast stochastic partial differential equation with singular coefficients. Using the Poisson equation in Hilbert space, we first establish the strong convergence in the…
We provide Large Deviation estimates for the bridge of a $d$-dimensional general diffusion process as the conditioning time tends to $0$ and apply these results to the evaluation of the asymptotics of its exit time probabilities. We are…
We consider (annealed) large deviation principles for component empirical measures of several families of marked sparse random graphs, including (i) uniform graphs on $n$ vertices with a fixed degree distribution; (ii) uniform graphs on $n$…
We study the stochastic parallel dynamics of Ising spin systems defined on finitely connected directed random graphs with arbitrary degree distributions, using generating functional analysis. For fully asymmetric graphs the dynamics of the…
The step-growth polymerisation of a mixture of arbitrary-functional monomers is viewed as a time-continuos random graph process with degree bounds that are not necessarily the same for different vertices. The sequence of degree bounds acts…
In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by "decorating" the nodes of the graph…
This paper considers a Markov-modulated duplication-deletion random graph where at each time instant, one node can either join or leave the network; the probabilities of joining or leaving evolve according to the realization of a finite…
Network data are ubiquitous in modern machine learning, with tasks of interest including node classification, node clustering and link prediction. A frequent approach begins by learning an Euclidean embedding of the network, to which…
We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the factors except one or two are small. The resulting asymptotic behaviour is seen to…
The phase transition in the size of the giant component in random graphs is one of the most well-studied phenomena in random graph theory. For hypergraphs, there are many possible generalisations of the notion of a component, and for all…
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…