FIFA World Cup referees’ networks: a constant-size clique approach

Fadigas, Inácio de Sousa; Rosa, Marcos Grilo; Henrique, Trazíbulo; Pereira, Hernane Borges de Barros

doi:10.1007/s13278-020-00672-5

Soc. Netw. Anal. Min.

2020

DOI: 10.1007/s13278-020-00672-5

|View full text |Cite

FIFA World Cup referees’ networks: a constant-size clique approach

Inácio de Sousa Fadigas

Marcos Grilo Rosa

Trazíbulo Henrique

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the detection of quasi-clique can be much more appropriated than detection complete cliques. • Furthermore, very recently, in [26], the approach based on cliques was used to analyze FIFA World Cup referees' networks.…”

mentioning

confidence: 99%

Approaching the Optimal Solution of the Maximal α-quasi-clique Local Community Problem

Conde-Céspedes¹

2020

Electronics

View full text Add to dashboard Cite

Complex networks analysis (CNA) has attracted so much attention in the last few years. An interesting task in CNA complex network analysis is community detection. In this paper, we focus on Local Community Detection, which is the problem of detecting the community of a given node of interest in the whole network. Moreover, we study the problem of finding local communities of high density, known as α-quasi-cliques in graph theory (for high values of α in the interval ]0,1[). Unfortunately, the higher α is, the smaller the communities become. This led to the maximal α-quasi-clique community of a given node problem, which is, the problem of finding local communities that are α-quasi-cliques of maximal size. This problem is NP-hard, then, to approach the optimal solution, some heuristics exist. When α is high (>0.5) the diameter of a maximal α-quasi-clique is at most 2. Based on this property, we propose an algorithm to calculate an upper bound to approach the optimal solution. We evaluate our method in real networks and conclude that, in most cases, the bound is very accurate. Furthermore, for a real small network, the optimal value is exactly achieved in more than 80% of cases.

show abstract

mentioning

confidence: 99%

Approaching the Optimal Solution of the Maximal α-quasi-clique Local Community Problem

Conde-Céspedes¹

2020

Electronics

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

FIFA World Cup referees’ networks: a constant-size clique approach

Cited by 1 publication

References 19 publications

Approaching the Optimal Solution of the Maximal α-quasi-clique Local Community Problem

Approaching the Optimal Solution of the Maximal α-quasi-clique Local Community Problem

Contact Info

Product

Resources

About