Slashburn: Graph compression and mining beyond caveman communities

Y Lim, U Kang, C Faloutsos - IEEE Transactions on Knowledge …, 2014 - ieeexplore.ieee.org
Given a real world graph, how should we lay-out its edges? How can we compress it? These
questions are closely related, and the typical approach so far is to find clique-like …

[KÖNYV][B] Redes sociales y complejidad: Modelos interdisciplinarios en la gestión sostenible de la sociedad y la cultura

C Reynoso - 2011 - academia.edu
A partir del momento que los diversos aspectos de la vida social (económicos, lingüísticos,
etc) se expresen como relaciones, queda abierto el camino para una antropología …

Beyond'caveman communities': Hubs and spokes for graph compression and mining

U Kang, C Faloutsos - 2011 IEEE 11th international conference …, 2011 - ieeexplore.ieee.org
Given a real world graph, how should we lay-out its edges? How can we compress it? These
questions are closely related, and the typical approach so far is to find clique-like …

Governance networks around grasslands with contrasting management history

S Manolache, A Nita, T Hartel, IV Miu… - Journal of environmental …, 2020 - Elsevier
Romanian grasslands have high nature value, being among the most important biodiversity
hotspots at the European level. The European Union Common Agricultural Policy (CAP) …

Managing social networks: Applying the percolation theory methodology to understand individuals' attitudes and moods

D Zhukov, T Khvatova, S Lesko, A Zaltcman - … Forecasting and Social …, 2018 - Elsevier
A disruptive technology is an unexpected technological breakthrough which destroys
existing markets, shakes up an industry and induces organisations to radically change their …

Robustness in semantic networks based on cliques

M Grilo, IS Fadigas, JGV Miranda, MV Cunha… - Physica A: Statistical …, 2017 - Elsevier
Here, we present a study on how the structure of semantic networks based on cliques
(specifically, article titles) behaves when vertex removal strategies (ie, random and uniform …

Exact analysis of generalized degree-based percolation without memory

J Han, G Zhang, G Dong, L Zhao, Y Shi… - Physica A: Statistical …, 2024 - Elsevier
We study the problem of generalized degree-based percolation without memory, where the
probability of node removal depends on a non-negative function of node degree within the …

[PDF][PDF] Emergency warning dissemination in a multiplex social network

C Koll, M Lindell, C Chen, H Wang - Journal of Artificial Societies and …, 2023 - par.nsf.gov
Disasters vary in many characteristics, but their amount of forewarning—the amount of time
remaining until the disaster strikes—is a crucial factor affecting the dissemination of …

Inferring failure coupling strength in complex networks through generative models

Y Liu, M Bai, S Sui, S Liu, O Levy, J Li… - International Journal of …, 2024 - Taylor & Francis
The failure propagation process has always been a research hotspot in the field of complex
system reliability. Most of the research studies focus on the inference of network structure …

The dynamics of change following extreme events: Transition, scale, and adaptation in systems under stress

LK Comfort, TW Haase, G Ertan… - Administration & …, 2020 - journals.sagepub.com
Whether and how organizations adapt to risk in changing contexts is a perennial problem in
public administration. We explore this problem in a comparative analysis of four hurricanes …