DeepAI AI Chat
Log In Sign Up

Bipartitioning of directed and mixed random graphs

by   Adam Lipowski, et al.

We show that an intricate relation of cluster properties and optimal bipartitions, which takes place in undirected random graphs, extends to directed and mixed random graphs. In particular, the satisfability threshold coincides with the relative size of the giant OUT component reaching 1/2. Moreover, when counting undirected links as two directed ones, the partition cost, and cluster properties, as well as location of the replica symmetry breaking transition for these random graphs depend primarily on the total number of directed links and not on their specific distribution.


page 1

page 2

page 3

page 4


Priors on exchangeable directed graphs

Directed graphs occur throughout statistical modeling of networks, and e...

The game of Cops and Robbers on directed graphs with forbidden subgraphs

The traditional game of cops and robbers is played on undirected graph. ...

Roundtrip Spanners with (2k-1) Stretch

A roundtrip spanner of a directed graph G is a subgraph of G preserving ...

Embedding Directed Graphs in Potential Fields Using FastMap-D

Embedding undirected graphs in a Euclidean space has many computational ...

Testing for directed information graphs

In this paper, we study a hypothesis test to determine the underlying di...

Resistance Distances in Directed Graphs: Definitions, Properties, and Applications

Resistance distance has been studied extensively in the past years, with...

On the Learning and Learnablity of Quasimetrics

Our world is full of asymmetries. Gravity and wind can make reaching a p...