Random Graphs by Product Random Measures

03/27/2022
by   Caleb Bastian, et al.
0

A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted random graphs, directed or undirected, labeled or unlabeled, where (i) the composition of the test function and transformation is a non-negative edge weight function, (ii) the mean measures encode edge density/weight and vertex degree density/weight, and (iii) the mean edge weight, when square-integrable, encodes generalized spectral and Sobol representations. We develop a number of properties of these random graphs, and we give simple examples of some of their possible applications.

READ FULL TEXT
research
04/09/2018

Some Reduction Operations to Pairwise Compatibility Graphs

A graph G=(V,E) with a vertex set V and an edge set E is called a pairwi...
research
03/13/2021

Weighted mean inactivity time function with applications

The concept of mean inactivity time plays a crucial role in reliability,...
research
08/21/2021

A Maximum Entropy Copula Model for Mixed Data: Representation, Estimation, and Applications

A new nonparametric model of maximum-entropy (MaxEnt) copula density fun...
research
05/09/2019

Random Function Priors for Correlation Modeling

The likelihood model of many high dimensional data X_n can be expressed ...
research
09/08/2017

Applications of an algorithm for solving Fredholm equations of the first kind

In this paper we use an iterative algorithm for solving Fredholm equatio...
research
01/20/2021

Sparse expanders have negative curvature

We prove that bounded-degree expanders with non-negative Ollivier-Ricci ...
research
12/17/2018

Information theoretical clustering is hard to approximate

An impurity measures I: R^d R^+ is a function that assigns a d-dimension...

Please sign up or login with your details

Forgot password? Click here to reset