相关论文: Connection probability for random graphs with give…

Dynamical processes on complex networks such as information propagation, innovation diffusion, cascading failures or epidemic spreading are highly affected by their underlying topologies as characterized by, for instance, degree-degree…

Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…

Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequences or distributions, we are dealing with configuration…

We are interested in modeling networks in which the connectivity among the nodes and node attributes are random variables and interact with each other. We propose a probabilistic model that allows one to formulate jointly a probability…

In the original (1961) Gilbert model of random geometric graphs, nodes are placed according to a Poisson point process, and links formed between those within a fixed range. Motivated by wireless ad-hoc networks "soft" or "probabilistic"…

Many applications in network analysis require algorithms to sample uniformly at random from the set of all graphs with a prescribed degree sequence. We present a Markov chain based approach which converges to the uniform distribution of all…

We analyze the distribution of the distance between two nodes, sampled uniformly at random, in digraphs generated via the directed configuration model, in the supercritical regime. Under the assumption that the covariance between the…

The number of common friends (or connections) in a graph is a commonly used measure of proximity between two nodes. Such measures are used in link prediction algorithms and recommendation systems in large online social networks. We obtain…

We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation…

Random K-out graphs are used in several applications including modeling by sensor networks secured by the random pairwise key predistribution scheme, and payment channel networks. The random K-out graph with $n$ nodes is constructed as…

We propose a wide class of preferential attachment models of random graphs, generalizing previous approaches. Graphs described by these models obey the power-law degree distribution, with the exponent that can be controlled in the models.…

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general 'bridge-addable' class of graphs - if a graph…

In this paper, we propose Continuous Graph Flow, a generative continuous flow based method that aims to model complex distributions of graph-structured data. Once learned, the model can be applied to an arbitrary graph, defining a…

A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…

Models of complex networks are generally defined as graph stochastic processes in which edges and vertices are added or deleted over time to simulate the evolution of networks. Here, we define a unifying framework - probabilistic inductive…

The growing complexity of the power grid, driven by increasing share of distributed energy resources and by massive deployment of intelligent internet-connected devices, requires new modelling tools for planning and operation. Physics-based…

A random graph model with prescribed degree distribution and degree dependent edge weights is introduced. Each vertex is independently equipped with a random number of half-edges and each half-edge is assigned an integer valued weight…

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 this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…

Directed acyclic graphs are widely used to describe the causal effects among random variables, and the inference of those causal effects has become an popular topic in statistics and machine learning, and has wide applications in…