Recent results and open problems in spectral algorithms for signed graphs

Bruno Ordozgoiti Rubio

Recent results and open problems in spectral algorithms for signed graphs

Bruno Ordozgoiti Rubio

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

45 Downloads (Pure)

Abstract

In signed graphs, edges are labeled with either a positive or a negative sign.This small modification greatly enriches the representation capabilities of graphs.However, their spectral properties undergo significant changes, introducing newchallenges in related optimization problems. In this extended abstract we discussrecent results in spectral methods for signed graph partitioning and communitydetection, and propose open problems arising in this context.

Original language	English
Title of host publication	Proceedings of the 3rd BYMAT Conference
Publisher	Asociación Nacional de Estudiantes de Matemáticas
Pages	215-218
Number of pages	4
Publication status	Published - 28 Aug 2021
MoE publication type	A4 Conference publication
Event	Bringing Young Mathematicians Together - Virtual, Online Duration: 1 Dec 2020 → 3 Dec 2020 Conference number: 3 https://bymat.webs.upv.es/index/

Publication series

Name	TEMat monográficos
Publisher	Asociación Nacional de Estudiantes de Matemáticas
Volume	2
ISSN (Electronic)	2660-6003

Conference

Conference	Bringing Young Mathematicians Together
Abbreviated title	BYMAT
City	Virtual, Online
Period	01/12/2020 → 03/12/2020
Internet address	https://bymat.webs.upv.es/index/

Access to Document

SCI_Ordozgoiti_Recent_results_and_open_problems_BYMAT_2021Final published version, 95.8 KBLicence: CC BY

https://temat.es/monograficos/article/view/vol2-p215Licence: CC BY

-: SoBigData-PlusPlus
Roy, C. (Project Member), Kaski, K. (Project Member) & Bhattacharya, K. (Project Member)
01/01/2020 → 31/12/2025
Project: EU H2020 Framework program
Adaptive and intelligent data
Gionis, A. (Principal investigator), Mahadevan, A. (Project Member), Zhang, G. (Project Member), Papatheodorou, D. (Project Member), Ordozgoiti Rubio, B. (Project Member) & Muniyappa, S. (Project Member)
01/01/2018 → 30/06/2022
Project: Academy of Finland: Other research funding

Cite this

@inproceedings{22546acca3cf4b0885575e485fc5fb9f,

title = "Recent results and open problems in spectral algorithms for signed graphs",

abstract = "In signed graphs, edges are labeled with either a positive or a negative sign.This small modification greatly enriches the representation capabilities of graphs.However, their spectral properties undergo significant changes, introducing newchallenges in related optimization problems. In this extended abstract we discussrecent results in spectral methods for signed graph partitioning and communitydetection, and propose open problems arising in this context.",

author = "\{Ordozgoiti Rubio\}, Bruno",

note = "| openaire: EC/H2020/871042/EU//SoBigData-PlusPlus; Bringing Young Mathematicians Together, BYMAT ; Conference date: 01-12-2020 Through 03-12-2020",

year = "2021",

month = aug,

day = "28",

language = "English",

series = "TEMat monogr{\'a}ficos",

publisher = "Asociaci{\'o}n Nacional de Estudiantes de Matem{\'a}ticas ",

pages = "215--218",

booktitle = "Proceedings of the 3rd BYMAT Conference",

address = "Spain",

url = "https://bymat.webs.upv.es/index/",

}

Recent results and open problems in spectral algorithms for signed graphs. / Ordozgoiti Rubio, Bruno.
Proceedings of the 3rd BYMAT Conference. Asociación Nacional de Estudiantes de Matemáticas , 2021. p. 215-218 (TEMat monográficos; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Recent results and open problems in spectral algorithms for signed graphs

AU - Ordozgoiti Rubio, Bruno

N1 - Conference code: 3

PY - 2021/8/28

Y1 - 2021/8/28

N2 - In signed graphs, edges are labeled with either a positive or a negative sign.This small modification greatly enriches the representation capabilities of graphs.However, their spectral properties undergo significant changes, introducing newchallenges in related optimization problems. In this extended abstract we discussrecent results in spectral methods for signed graph partitioning and communitydetection, and propose open problems arising in this context.

AB - In signed graphs, edges are labeled with either a positive or a negative sign.This small modification greatly enriches the representation capabilities of graphs.However, their spectral properties undergo significant changes, introducing newchallenges in related optimization problems. In this extended abstract we discussrecent results in spectral methods for signed graph partitioning and communitydetection, and propose open problems arising in this context.

M3 - Conference article in proceedings

T3 - TEMat monográficos

SP - 215

EP - 218

BT - Proceedings of the 3rd BYMAT Conference

PB - Asociación Nacional de Estudiantes de Matemáticas

T2 - Bringing Young Mathematicians Together

Y2 - 1 December 2020 through 3 December 2020

ER -

Recent results and open problems in spectral algorithms for signed graphs

Abstract

Publication series

Conference

Access to Document

Fingerprint

Projects

-: SoBigData-PlusPlus

Adaptive and intelligent data

Cite this