Concept
Automorphisme de graphe
Publications associées (56)
On the Rainbow Turan number of paths
Let F be a fixed graph. The rainbow Turan number of F is defined as the maximum number of edges in a graph on n vertices that has a proper edge-coloring with no rainbow copy of F (i.e., a copy of F all of whose edges have different colours). The systematic ...
ELECTRONIC JOURNAL OF COMBINATORICS2019Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-Rényi Graphs
Matthias Grossglauser, Negar Kiyavash, Osman Emre Dai
Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact information-theoretic threshold for graph alignment in correlated Erdös-Rény ...
Association for Computing Machinery (ACM)2019Generalized Turan problems for disjoint copies of graphs
Given two graphs H and F, the maximum possible number of copies of H in an F-free graph on n vertices is denoted by ex(n, H, F). We investigate the function ex(n, H, kF), where kF denotes k vertex disjoint copies of a fixed graph F. Our results include cas ...
ELSEVIER2019On two isomorphic Lie algebroids associated with feedback linearization
We present two Lie algebroids linked to the construction of the linearizing output of an input affine nonlinear system. The algorithmic development of the linearizing output proceeds inductively, and each stage has two structures, namely a codimension one ...
ELSEVIER2019On two isomorphic Lie algebroids for Feedback Linearization
Two Lie algebroids are presented that are linked to the construction of the linearizing output of an affine in the input nonlinear system.\ The algorithmic construction of the linearizing output proceeds inductively, and each stage has two structures, name ...
2019Spectral MAB for Unknown Graph Processes
In this work, we study graph-based multi-arms bandit (MAB) problems aimed at optimizing actions on irregular and high-dimensional graphs. More formally, we consider a decision-maker that takes sequential actions over time and observes the experienced rewar ...
IEEE Computer Society2018Robust and Efficient Data Clustering with Signal Processing on Graphs
Data is pervasive in today's world and has actually been for quite some time. With the increasing volume of data to process, there is a need for faster and at least as accurate techniques than what we already have. In particular, the last decade recorded t ...
EPFL2018Global and Local Uncertainty Principles for Signals on Graphs
Pierre Vandergheynst, Nathanaël Perraudin, Benjamin Ricaud, David Shuman
Uncertainty principles such as Heisenberg's provide limits on the time-frequency concentration of a signal, and constitute an important theoretical tool for designing and evaluating linear signal transforms. Generalizations of such principles to the graph ...
2018Nielsen Equivalence In Gupta-Sidki Groups
For a group G generated by k elements, the Nielsen equivalence classes are defined as orbits of the action of AutF(k), the automorphism group of the free group of rank k, on the set of generating k-tuples of G. Let p >= 3 be prime and G(p) the Gupta-Sidki ...
Amer Mathematical Soc2017Efficient Online Processing for Advanced Analytics
Mohamed Elsayed Mohamed Ahmed El Seidy
With the advent of emerging technologies and the Internet of Things, the importance of online data analytics has become more pronounced. Businesses and companies are adopting approaches that provide responsive analytics to stay competitive in the global ma ...
EPFL2017