Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Graphe de Cayley

Publications associées (28)

Asymptotics of Cheeger constants and unitarisability of groups

Nicolas Monod

Given a group Gamma, we establish a connection between the unitarisability of its uniformly bounded representations and the asymptotic behaviour of the isoperimetric constants of Cayley graphs of Gamma for increasingly large generating sets. The connection ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2020

Experiments with the Markoff Surface

Matthew De Courcy-Ireland

We confirm, for the primes up to 3000, the conjecture of Bourgain-Gamburd-Sarnak and Baragar on strong approximation for the Markoff surface modulo primes. For primes congruent to 3 modulo 4, we find data suggesting that some natural graphs constructed fro ...

TAYLOR & FRANCIS INC2022

Simple Realizability of Complete Abstract Topological Graphs Simplified

Jan Kyncl

An abstract topological graph (briefly an AT-graph) is a pair A = (G, X) where G = (V, E) is a graph and X. E2 is a set of pairs of its edges. The AT-graph A is simply realizable if G can be drawn in the plane so that each pair of edges from X crosses exac ...

SPRINGER2020

Community-Aware Graph Signal Processing: Modularity Defines New Ways of Processing Graph Signals

Dimitri Nestor Alice Van De Ville, Thomas William Arthur Bolton, Raphaël Pierre Liégeois, Miljan Petrovic

The emerging field of graph signal processing (GSP) allows one to transpose classical signal processing operations (e.g., filtering) to signals on graphs. The GSP framework is generally built upon the graph Laplacian, which plays a crucial role in studying ...

2020

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Mikhail Kapralov, Jakab Tardos, Navid Nouri, Aidasadat Mousavifar

In this paper, we resolve the complexity problem of spectral graph sparcification in dynamic streams up to polylogarithmic factors. Using a linear sketch we design a streaming algorithm that uses (O) over tilde (n) space, and with high probability, recover ...

ASSOC COMPUTING MACHINERY2020

A Laplacian approach to stubborn agents and their role in opinion formation on influence networks

Melvyn Sandy Tyloo

Within the framework of a simple model for social influence, the Taylor model, we analytically investigate the role of stubborn agents in the overall opinion dynamics of networked systems. Similar to zealots, stubborn agents are biased towards a certain op ...

2020

Incidences Between Planes Over Finite Fields

Van Thang Pham

In this note, we use methods from spectral graph theory to obtain bounds on the number of incidences between k-planes and h-planes in F-q(d), which generalizes a recent result given by Bennett, Iosevich, and Pakianathan (2014). More precisely, we prove tha ...

American Mathematical Society (AMS)2019

Modelling the Syntax of North Indian Melodies with a Generalized Graph Grammar

Martin Alois Rohrmeier, Christoph Finkensiep

Hierarchical models of music allow explanation of highly complex musical structure based on the general principle of recursive elaboration and a small set of orthogonal operations. Recent approaches to melodic elaboration have converged to a representation ...

ISMIR2019