Corpus ID: 231979154

Hidden Ancestor Graphs with Assortative Vertex Attributes

  title={Hidden Ancestor Graphs with Assortative Vertex Attributes},
  author={R. W. R. Darling},
The hidden ancestor graph is a new stochastic model for a vertex-labelled multigraph G in which the observable vertices are the leaves L of a random rooted tree T , whose edges and non-leaf nodes are hidden. The likelihood of an edge in G between two vertices in L depends on the height of their lowest common ancestor in T . The label of a vertex v ∈ L depends on a randomized label inheritance mechanism within T such that vertices with the same parent often have the same label. High label… Expand

Figures and Tables from this paper


Listing triangles in expected linear time on a class of power law graphs.
Enumerating triangles (3-cycles) in graphs is a kernel operation for social network analysis. For example, many community detection methods depend upon finding common neighbors of two relatedExpand
When Labels Fall Short: Property Graph Simulation via Blending of Network Structure and Vertex Attributes
This work proposes the Property Graph Model (PGM) approach that uses a label augmentation strategy to mitigate the problem and preserve the vertex label and the edge connectivity distributions as well as their correlation, while also replicating the degree distribution. Expand
Anomaly Detection and Correction in Large Labeled Bipartite Graphs
Binary classification problems can be naturally modeled as bipartite graphs, where we attempt to classify right nodes based on their left adjacencies. We consider the case of labeled bipartite graphsExpand
Approximating Sparse Graphs: The Random Overlapping Communities Model
A simple, easy to sample, random graph model that captures the limiting spectra of many sequences of interest, including the sequence of hypercube graphs, and it is shown that the model is an effective approximation for individual graphs. Expand
Community structure and scale-free collections of Erdös-Rényi graphs
The Block Two-Level Erdős-Rényi (BTER) model is proposed, and it is demonstrated that it accurately captures the observable properties of many real-world social networks. Expand
Probability on Trees and Networks
Starting around the late 1950s, several research communities began relating the geometry of graphs to stochastic processes on these graphs. This book, twenty years in the making, ties togetherExpand
Tuning clustering in random networks with arbitrary degree distributions.
A generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable and an universal relation among clustering and degree-degree correlations for all networks is unveiled. Expand
The Combinatorial Data Fusion Problem in Conflicted-supervised Learning
The best merge problem in industrial data science generates instances where disparate data sources place incompatible relational structures on the same set $V$ of objects. Graph vertex labelling dataExpand
JGraphT—A Java Library for Graph Data Structures and Algorithms
The design and underlying structure of JGraphT, a programming library that contains very efficient and generic graph data structures along with a large collection of state-of-the-art algorithms, is described and discussed. Expand
Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure
a posteriori blockmodeling for graphs is proposed. The model assumes that the vertices of the graph are partitioned into two unknown blocks and that the probability of an edge between two verticesExpand