AI Chat AI Image Generator AI Video Text to Speech

Probabilistic Properties of GIG Digraphs

11/19/2019

∙

by Chuhan Guo, et al.

∙

∙

We study the probabilistic properties of the Greatest Increase Grid (GIG) digraph. We compute the probability of a particular sequence of directed edges connecting two random vertices. We compute the joint probability that a set of vertices are all sinks, and derive the mean and variance in the number of sinks in a randomly labeled GIG digraph. Finally, we show that the expected size of the maximum component of vertices converges.

Chuhan Guo
1 publication
Laurie J. Heyer
1 publication
Jeffrey L. Poet
1 publication

page 1

page 2

page 3

page 4

research

∙ 01/23/2020

Counting directed acyclic and elementary digraphs

Directed acyclic graphs (DAGs) can be characterised as directed graphs w...

0 Élie De Panafieu, et al. ∙

research

∙ 02/24/2023

The number of descendants in a random directed acyclic graph

We consider a well known model of random directed acyclic graphs of orde...

0 Svante Janson, et al. ∙

research

∙ 01/11/2023

Optimal Impartial Correspondences

We study mechanisms that select a subset of the vertex set of a directed...

0 Javier Cembrano, et al. ∙

research

∙ 08/03/2023

Inequalities Connecting the Annihilation and Independence Numbers

Given a graph G, the number of its vertices is represented by n(G), whil...

0 Ohr Kadrawi, et al. ∙

research

∙ 08/22/2022

On the monophonic convexity number of the complementary prisms

A set S of vertices of a graph G is monophonic convex if S contains all ...

0 Neethu P. K., et al. ∙

research

∙ 08/02/2018

Small World Model based on a Sphere Homeomorphic Geometry

We define a small world model over the octahedron surface and relate its...

0 Santiago Viertel, et al. ∙

research

∙ 03/06/2020

Fast calculation of the variance of edge crossings in random linear arrangements

The interest in spatial networks where vertices are embedded in a one-di...

0 Lluís Alemany-Puig, et al. ∙