Abram Magner

Quantum Inf. Process., October, 2024

Symmetry Discovery Beyond Affine Transformations.

[BibT_eX]

[DOI]

Ben Shaw

Kevin R. Moon

CoRR, 2024

Low Rank Multi-Dictionary Selection at Scale.

[BibT_eX]

[DOI]

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Empirical Risk Minimization and Uniform Convergence for Probabilistically Observed and Quantum Measurement Hypothesis Classes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Promise and Limitations of Supervised Optimal Transport-Based Graph Summarization via Information Theoretic Measures.

[BibT_eX]

[DOI]

Sepideh Neshatfar

Salimeh Yasaei Sekeh

IEEE Access, 2023

2022

Fast and Accurate Spreading Process Temporal Scale Estimation.

[BibT_eX]

[DOI]

Carolyn S. Kaminski

Petko Bogdanov

Trans. Mach. Learn. Res., 2022

Fundamental Limits of Deep Graph Convolutional Networks for Graph Classification.

[BibT_eX]

[DOI]

Alfred O. Hero III

IEEE Trans. Inf. Theory, 2022

Struct2Graph: a graph attention network for structure based predictions of protein-protein interactions.

[BibT_eX]

[DOI]

Emine Sumeyra Turali-Emre

Jacob Saldinger

BMC Bioinform., 2022

Local Limit Theorems for Approximate Maximum Likelihood Estimation of Network Information Spreading Models.

[BibT_eX]

[DOI]

Amith Kumar Singh

Proceedings of the IEEE International Symposium on Information Theory, 2022

PAC Learning of Quantum Measurement Classes : Sample Complexity Bounds and Universal Consistency.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Temporal Scale Estimation for Oversampled Network Cascades: Theory, Algorithms, and Experiment.

[BibT_eX]

[DOI]

Carolyn S. Kaminski

Petko Bogdanov

CoRR, 2021

On Dimension in Graph Convolutional Networks for Distinguishing Random Graph Models.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

The Power of Graph Convolutional Networks to Distinguish Random Graph Models: Short Version.

[BibT_eX]

[DOI]

Alfred O. Hero III

CoRR, 2020

A deep learning architecture for metabolic pathway prediction.

[BibT_eX]

[DOI]

Bioinform., 2020

Compression of Dynamic Graphs Generated by a Duplication Model.

[BibT_eX]

[DOI]

Krzysztof Turowski

Algorithmica, 2020

The Power of Graph Convolutional Networks to Distinguish Random Graph Models.

[BibT_eX]

[DOI]

Alfred O. Hero III

Proceedings of the IEEE International Symposium on Information Theory, 2020

Toward universal testing of dynamic network models.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2020

2019

Entropy and Optimal Compression of Some General Plane Trees.

[BibT_eX]

[DOI]

Zbigniew Golebiewski

ACM Trans. Algorithms, 2019

Asymmetry and structural information in preferential attachment graphs.

[BibT_eX]

[DOI]

Tomasz Luczak

Random Struct. Algorithms, 2019

Asymmetric Rényi Problem.

[BibT_eX]

[DOI]

Michael Drmota

Comb. Probab. Comput., 2019

Goodness of Fit Testing for Dynamic Networks.

[BibT_eX]

[DOI]

CoRR, 2019

Compression of Preferential Attachment Graphs.

[BibT_eX]

[DOI]

Tomasz Luczak

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Lossless Compression of Binary Trees With Correlated Vertex Names.

[BibT_eX]

[DOI]

Krzysztof Turowski

IEEE Trans. Inf. Theory, 2018

Profiles of PATRICIA Tries.

[BibT_eX]

[DOI]

Algorithmica, 2018

TIMES: Temporal Information Maximally Extracted from Structures.

[BibT_eX]

[DOI]

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Network Archaeology via Epidemic Processes: The Case of Growing Trees.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017

Large Deviations for Increasing Subsequences of Permutations and a Concurrency Application.

[BibT_eX]

[DOI]

Yuliy M. Baryshnikov

SIGMETRICS Perform. Evaluation Rev., 2017

A Study of the Boltzmann Sequence-Structure Channel.

[BibT_eX]

[DOI]

Daisuke Kihara

Proc. IEEE, 2017

Recovery of vertex orderings in dynamic graphs.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Entropy of some general plane trees.

[BibT_eX]

[DOI]

Zbigniew Golebiewski

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On Symmetries of Non-Plane Trees in a Non-Uniform Model.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016

Fundamental Bounds for Sequence Reconstruction From Nanopore Sequencers.

[BibT_eX]

[DOI]

IEEE Trans. Mol. Biol. Multi Scale Commun., 2016

Combining Density and Overlap (CoDO): A New Method for Assessing the Significance of Overlap Among Subgraphs.

[BibT_eX]

[DOI]

Shahin Mohammadi

Ananth Grama

CoRR, 2016

Asymmetric Rényi Problem and PATRICIA Tries.

[BibT_eX]

[DOI]

Michael Drmota

CoRR, 2016

The Boltzmann sequence-structure channel.

[BibT_eX]

[DOI]

Daisuke Kihara

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Profiles of PATRICIA Tries

[BibT_eX]

[DOI]

PhD thesis, 2015

Phase transitions in a sequence-structure channel.

[BibT_eX]

[DOI]

Daisuke Kihara

Proceedings of the 2015 Information Theory and Applications Workshop, 2015

Variance of Size in Regular Graph Tries.

[BibT_eX]

[DOI]

Philippe Jacquet

Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014

On Symmetry of Uniform and Preferential Attachment Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Expected External Profile of PATRICIA Tries.

[BibT_eX]

[DOI]

Charles Knessl