#
Publication search

with Ramanujan graph as keyword

Badaoui, Mohamad

Applying algebraic and combinatorics techniques to solve graph problems leads to the birthof algebraic and combinatorial graph theory. This thesis deals mainly with a crossroads questbetween the two theories, that is, the problem of constructing infinite families of expandergraphs.From a combinatorial point of view, expander graphs are sparse graph...

Biau, Gérard Bleakley, Kevin Cadre, Benoît

The statistical analysis of massive and complex data sets will require the development of algorithms that depend on distributed computing and collaborative inference. Inspired by this, we propose a collab-orative framework that aims to estimate the unknown mean θ of a random variable X. In the model we present, a certain number of calculation units...

Fox, Jacob
Published in
Order

Let m(n) be the maximum integer such that every partially ordered set P with n elements contains two disjoint subsets A and B, each with cardinality m(n), such that either every element of A is greater than every element of B or every element of A is incomparable with every element of B. We prove that \documentclass[12pt]{minimal} \usepackage{amsma...

Terras, A.A. Stark, H.M.
Published in
Advances in Mathematics

A graph theoretical analog of Brauer–Siegel theory for zeta functions of number fields is developed using the theory of Artin L-functions for Galois coverings of graphs from parts I and II. In the process, we discuss possible versions of the Riemann hypothesis for the Ihara zeta function of an irregular graph.