Signed graph

Science formelle
Mathématiques
Mathématiques discrètes
Théorie des graphes

Publications associées (25)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Isogeny graphs of ordinary abelian varieties

Dimitar Petkov Jetchev, Benjamin Pierre Charles Wesolowski, Ernest Hunter Brooks

Fix a prime number l. Graphs of isogenies of degree a power of l are well-understood for elliptic curves, but not for higher-dimensional abelian varieties. We study the case of absolutely simple ordinary abelian varieties over a finite field. We analyse gr ...

Springer Heidelberg2017

Geometric deep learning: going beyond Euclidean data

Pierre Vandergheynst, Michael Bronstein

Many signal processing problems involve data whose underlying structure is non-Euclidean, but may be modeled as a manifold or (combinatorial) graph. For instance, in social networks, the characteristics of users can be modeled as signals on the vertices of ...

2017

An affected core drives network integration deficits of the structural connectome in 22q11.2 deletion syndrome

Alessandra Griffa, Patric Hagmann, Marie Schaer, Frantisek Vasa

Chromosome 22q11.2 deletion syndrome (22q11DS) is a genetic disease known to lead to cerebral structural alterations, which we study using the framework of the macroscopic white-matter connectome. We create weighted connectomes of 44 patients with 22q11DS ...

Elsevier Sci Ltd2016

Clustered planarity testing revisited

Radoslav Fulek, Jan Kyncl, Igor Malinovic

The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generali ...

2015

Coloring Relatives of Interval Overlap Graphs via On-line Games

Bartosz Maria Walczak

The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs defined by geometric representations and competitivity analysis of on-line algorithms. This connection became apparent after the recent construction ...

Springer-Verlag Berlin2014

A Bayesian Method for Matching Two Similar Graphs without Seeds

Matthias Grossglauser, Pedram Pedarsani

Approximate graph matching (AGM) refers to the problem of mapping the vertices of two structurally similar graphs, which has applications in social networks, computer vision, chemistry, and biology. Given its computational cost, AGM has mostly been limited ...

2013

Semi-Supervised Novelty Detection using SVM entire solution path

Jean-Philippe Thiran, Devis Tuia, Volker Gass, Frank Grégoire Jean de Morsier, Maurice Borgeaud

Very often, the only reliable information available to perform change detection is the description of some unchanged regions. Since sometimes these regions do not contain all the relevant information to identify their counterpart (the changes), we consider ...

Institute of Electrical and Electronics Engineers2013

Multi-Graph Regularization For Efficient Delivery Of User Generated Content In Online Social Networks

We present a methodology for enhancing the delivery of user-generated content in online social networks. To this end, we first regularize the social graph via node capacity and link cost information associated with the underlying data network. We then desi ...

2011

A lower bound for algebraic connectivity based on the connection-graph-stability method

Martin Hasler, Ali Ajdari Rad, Mahdi Jalili

This paper introduces the connection-graph-stability method and uses it to establish a new lower bound on the algebraic connectivity of graphs (the second smallest eigenvalue of the Laplacian matrix of the graph) that is sharper than the previously publish ...

Elsevier2011

Content Preference Estimation In Online Social Networks: Message Passing Versus Sparse Reconstruction On Graphs

We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for which this information is available ahead of time. The techniques take advantag ...

2011

Page 2 sur 3