The k-Cap Process on Geometric Random Graphs

03/23/2022
by   Mirabel Reid, et al.
0

The k-cap (or k-winners-take-all) process on a graph works as follows: in each iteration, exactly k vertices of the graph are in the cap (i.e., winners); the next round winners are the vertices that have the highest total degree to the current winners, with ties broken randomly. This natural process is a simple model of firing activity in the brain. We study its convergence on geometric random graphs, revealing rather surprising behavior.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2018

Connectivity in Random Annulus Graphs and the Geometric Block Model

Random geometric graphs are the simplest, and perhaps the earliest possi...
research
06/08/2022

The number of small-degree vertices in matchstick graphs

A matchstick graph is a crossing-free unit-distance graph in the plane. ...
research
06/29/2022

Threshold for Detecting High Dimensional Geometry in Anisotropic Random Geometric Graphs

In the anisotropic random geometric graph model, vertices correspond to ...
research
05/09/2023

Random processes for generating task-dependency graphs

We investigate random processes for generating task-dependency graphs of...
research
03/29/2018

The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness

Preferential attachment graphs are random graphs designed to mimic prope...
research
03/06/2023

Localized geometry detection in scale-free random graphs

We consider the problem of detecting whether a power-law inhomogeneous r...
research
02/02/2022

Random Processes with High Variance Produce Scale Free Networks

Real-world networks tend to be scale free, having heavy-tailed degree di...

Please sign up or login with your details

Forgot password? Click here to reset