Gesine Reinert

Orcid: 0000-0002-0363-9470

According to our database1, Gesine Reinert authored at least 62 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
SteinGen: Generating Fidelitous and Diverse Graph Samples.
CoRR, 2024

Generalization Error of Graph Neural Networks in the Mean-field Regime.
CoRR, 2024

2023
The GNAR-edge model: a network autoregressive model for networks with time-varying edge weights.
J. Complex Networks, November, 2023

Robust Angular Synchronization via Directed Graph Neural Networks.
CoRR, 2023

SaGess: Sampling Graph Denoising Diffusion Model for Scalable Graph Generation.
CoRR, 2023

L2G2G: A Scalable Local-to-Global Network Embedding with Graph Autoencoders.
Proceedings of the Complex Networks & Their Applications XII, 2023

2022
Generating weighted and thresholded gene coexpression networks using signed distance correlation.
Netw. Sci., 2022

Lead-lag detection and network clustering for multivariate time series with an application to the US equity market.
Mach. Learn., 2022

Extracting Information from Gene Coexpression Networks of <i>Rhizobium leguminosarum</i>.
J. Comput. Biol., 2022

On RKHS Choices for Assessing Graph Generators via Kernel Stein Statistics.
CoRR, 2022

PyTorch Geometric Signed Directed: A Survey and Software on Graph Neural Networks for Signed and Directed Graphs.
CoRR, 2022

Ranking of communities in multiplex spatiotemporal models of brain dynamics.
Appl. Netw. Sci., 2022

SSSNET: Semi-Supervised Signed Network Clustering.
Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

AgraSSt: Approximate Graph Stein Statistics for Interpretable Assessment of Implicit Graph Generators.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A Kernelised Stein Statistic for Assessing Implicit Generative Models.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

DIGRAC: Digraph Clustering Based on Flow Imbalance.
Proceedings of the Learning on Graphs Conference, 2022

MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian.
Proceedings of the Learning on Graphs Conference, 2022

DAMNETS: A Deep Autoregressive Model for Generating Markovian Network Time Series.
Proceedings of the Learning on Graphs Conference, 2022

Topological Analysis of Credit Data: Preliminary Findings.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2022, 2022

GNNRank: Learning Global Rankings from Pairwise Comparisons via Directed Graph Neural Networks.
Proceedings of the International Conference on Machine Learning, 2022

2021
DIGRAC: Digraph Clustering with Flow Imbalance.
CoRR, 2021

Hypergraphs for predicting essential genes using multiprotein complex data.
J. Complex Networks, 2021

Estimating the correlation in network disturbance models.
J. Complex Networks, 2021

Robust gene coexpression networks using signed distance correlation.
Bioinform., 2021

COGENT: evaluating the consistency of gene co-expression networks.
Bioinform., 2021

A Stein Goodness-of-test for Exponential Random Graph Models.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
A bound on the rate of convergence in the central limit theorem for renewal processes under second moment conditions.
J. Appl. Probab., 2020

2019
Core-Periphery Structure in Directed Networks.
CoRR, 2019

Anomaly Detection in Networks with Application to Financial Transaction Networks.
CoRR, 2019

Assessment of model fit via network comparison methods based on subgraph counts.
J. Complex Networks, 2019

Measuring rank robustness in scored protein interaction networks.
BMC Bioinform., 2019

2018
Identifying networks with common organizational principles.
J. Complex Networks, 2018

CommWalker: correctly evaluating modules in molecular networks in light of annotation bias.
Bioinform., 2018

A nonparametric significance test for sampled networks.
Bioinform., 2018

Triad-Based Comparison and Signatures of Directed Networks.
Proceedings of the Complex Networks and Their Applications VII, 2018

2017
Efficient method for estimating the number of communities in a network.
CoRR, 2017

2016
Risk in a Large Claims Insurance Market with Bipartite Graph Structure.
Oper. Res., 2016

Estimating the number of communities in a network.
CoRR, 2016

Inference of Markovian properties of molecular sequences from NGS data and applications to comparative genomics.
Bioinform., 2016

2014
Alignment-free protein interaction network comparison.
Bioinform., 2014

New developments of alignment-free sequence comparison: measures, statistics and next-generation sequencing.
Briefings Bioinform., 2014

2013
Stein's Method for the Beta Distribution and the Pólya-Eggenberger Urn.
J. Appl. Probab., 2013

Multiple alignment-free sequence comparison.
Bioinform., 2013

2012
Normal and Compound Poisson Approximations for Pattern Occurrences in NGS Reads.
J. Comput. Biol., 2012

The Importance of Age and High Degree, in Protein-Protein Interaction Networks.
J. Comput. Biol., 2012

Asymptotic behaviour of gossip processes and small world networks
CoRR, 2012

2011
The shortest distance in random multi-type intersection graphs.
Random Struct. Algorithms, 2011

2010
The Power of Detecting Enriched Patterns: An HMM Approach.
J. Comput. Biol., 2010

Alignment-Free Sequence Comparison (II): Theoretical Power of Comparison Statistics.
J. Comput. Biol., 2010

Deciphering chemotaxis pathways using cross species comparisons.
BMC Syst. Biol., 2010

How threshold behaviour affects the use of subgraphs for network comparison.
Bioinform., 2010

2009
Alignment-Free Sequence Comparison (I): Statistics and Power.
J. Comput. Biol., 2009

2008
Predicting and Validating Protein Interactions Using Network Structure.
PLoS Comput. Biol., 2008

2007
On the Length of the Longest Exact Position Match in a Random Sequence.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

A statistical approach using network structure in the prediction of protein characteristics.
Bioinform., 2007

2004
Correction: Small worlds.
Random Struct. Algorithms, 2004

2001
Small worlds.
Random Struct. Algorithms, 2001

2000
Probabilistic and Statistical Properties of Words: An Overview.
J. Comput. Biol., 2000

1998
Compound Poisson and Poisson Process Approximations for Occurrences of Multiple Words in Markov Chains.
J. Comput. Biol., 1998

1997
Couplings for normal approximations with Stein's method.
Proceedings of the Microsurveys in Discrete Probability, 1997

1996
Poisson Process Approximation for Sequence Repeats and Sequencing by Hybridization.
J. Comput. Biol., 1996

Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996


  Loading...