Combinatorial landscapes

CM Reidys, PF Stadler - SIAM review, 2002 - SIAM
Fitness landscapes have proven to be a valuable concept in evolutionary biology,
combinatorial optimization, and the physics of disordered systems. A fitness landscape is a …

Network coding theory: A survey

R Bassoli, H Marques, J Rodriguez… - … Surveys & Tutorials, 2013 - ieeexplore.ieee.org
This article surveys all known fields of network coding theory and leads the reader through
the antecedents of the network coding theory to the most recent results, considering also …

Distance encoding: Design provably more powerful neural networks for graph representation learning

P Li, Y Wang, H Wang… - Advances in Neural …, 2020 - proceedings.neurips.cc
Learning representations of sets of nodes in a graph is crucial for applications ranging from
node-role discovery to link prediction and molecule classification. Graph Neural Networks …

Rethinking the expressive power of gnns via graph biconnectivity

B Zhang, S Luo, L Wang, D He - arxiv preprint arxiv:2301.09505, 2023 - arxiv.org
Designing expressive Graph Neural Networks (GNNs) is a central topic in learning graph-
structured data. While numerous approaches have been proposed to improve GNNs in …

A survey of community detection methods in multilayer networks

X Huang, D Chen, T Ren, D Wang - Data Mining and Knowledge …, 2021 - Springer
Community detection is one of the most popular researches in a variety of complex systems,
ranging from biology to sociology. In recent years, there's an increasing focus on the rapid …

[LIBRO][B] Spectra of graphs

AE Brouwer, WH Haemers - 2011 - books.google.com
This book gives an elementary treatment of the basic material about graph spectra, both for
ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering …

[LIBRO][B] CRC handbook of combinatorial designs

CJ Colbourn - 2010 - taylorfrancis.com
From experimental design to cryptography, this comprehensive, easy-to-access reference
contains literally all the facts you need on combinatorial designs. It includes constructions of …

[LIBRO][B] Normal approximation by Stein's method

LHY Chen, L Goldstein, QM Shao - 2010 - books.google.com
Since its introduction in 1972, Stein's method has offered a completely novel way of
evaluating the quality of normal approximations. Through its characterizing equation …

The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes

AR Hammons, PV Kumar… - IEEE Transactions …, 1994 - ieeexplore.ieee.org
Certain notorious nonlinear binary codes contain more codewords than any known linear
code. These include the codes constructed by Nordstrom-Robinson (1967), Kerdock (1972) …

Lower bounds for covering times for reversible Markov chains and random walks on graphs

DJ Aldous - Journal of Theoretical Probability, 1989 - Springer
For simple random walk on a N-vertex graph, the mean time to cover all vertices is at least
cN log (N), where c> 0 is an absolute constant. This is deduced from a more general result …