# Unbiased degree-preserving randomization of directed binary networks

It is crucial that the synthetic networks generated as null models are representative of the underlying ensembles.

*Physical Review E* 85, 46103 (2012)

E. Roberts, A. Coolen

Randomizing networks using a naive “accept-all” edge-swap algorithm is generally biased. Building on recent results for nondirected graphs, we construct an ergodic detailed balance Markov chain with nontrivial acceptance probabilities for directed graphs, which converges to a strictly uniform measure and is based on edge swaps that conserve all in and out degrees. The acceptance probabilities can also be generalized to define Markov chains that target any alternative desired measure on the space of directed graphs in order to generate graphs with more sophisticated topological features. This is demonstrated by defining a process tailored to the production of directed graphs with specified degree-degree correlation functions. The theory is implemented numerically and tested on synthetic and biological network examples.

#### Network valuation in financial systems

P. Barucca, M. Bardoscia, F. Caccioli, M. D’Errico, G. Visentin, G. Caldarelli, S. Battiston

*Mathematical Finance*

#### The space of functions computed by deep layered machines

A. Mozeika, B. Li, D. Saad

Sub. to *Physical Review Letters*

#### Replica analysis of overfitting in generalized linear models

T. Coolen, M. Sheikh, A. Mozeika, F. Aguirre-Lopez, F. Antenucci

Sub. to *Journal of Physics A*

#### Degree-correlations in a bursting dynamic network model

F. Vanni, P. Barucca

*Journal of Economic Interaction and Coordination*

#### Phase transition creates the geometry of the continuum from discrete space

R. Farr, T. Fink

*Physical Review E*

124 / 124 papers