Victor Falgas-ravry

activity

20112026

most citedGlobal Structural Properties of Random Graphs

18 citations · 48 across the 33 of their papers we have counts for

collaborators

Showing math.PRShow all

10 papers · 1 filter

math.PR2025

Connectivity for square percolation and coarse cubical rigidity in random right-angled Coxeter groups

Jason Behrstock, R. Altar Ciceksiz, Victor Falgas-Ravry

We consider random right-angled Coxeter groups, $W_{Γ}$ , whose presentation graph $Γ$ is taken to be an Erdős--Rényi random graph, i.e., $Γ \sim G_{n, p}$ . We use techniques…

math.PR2021

Bootstrap percolation in random geometric graphs

Victor Falgas-Ravry, Amites Sarkar

Following Bradonjić and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the $2$ -dimensional torus. In this model, the expected number of…

math.PR2020

Square percolation and the threshold for quadratic divergence in random right-angled Coxeter groups

Jason Behrstock, Victor Falgas-Ravry, Tim Susse

Given a graph $Γ$ , its auxiliary \emph{square-graph} $□ (Γ)$ is the graph whose vertices are the non-edges of $Γ$ and whose edges are the pairs of non-edges which induce a squ…

math.PR2019

Long paths and connectivity in { $1$ }-independent random graphs

A. Nicholas Day, Victor Falgas-Ravry, Robert Hancock

Given a graph $G$ , a probability measure $μ$ on the subsets of the edge set of $G$ is said to be $1$ -independent if events determined by edge sets that are at graph distance at lea…

math.PR2016

Speed and concentration of the covering time for structured coupon collectors

Victor Falgas-Ravry, Joel Larsson, Klas Markström

Let $V$ be an $n$ -set, and let $X$ be a random variable taking values in the powerset of $V$ . Suppose we are given a sequence of random coupons $X_{1}, X_{2}, \dots$ , where the $X_{i}$ …

math.PR2015★ 18 cited

Global Structural Properties of Random Graphs

Jason Behrstock, Victor Falgas-Ravry, Mark F. Hagen +1

We study two global structural properties of a graph $Γ$ , denoted AS and CFS, which arise in a natural way from geometric group theory. We study these properties in the Erdös--Rény…

math.PR2014

On percolation in Poisson graphs

Johan Björklund, Victor Falgas-Ravry, Cecilia Holmgren

Equip each point $x$ of a homogeneous Poisson process $P$ on $R$ with $D_{x}$ edge stubs, where the $D_{x}$ are i.i.d. positive integer-valued random variables with…

math.PR2013

Random subcube intersection graphs I: cliques and covering

Victor Falgas-Ravry, Klas Markström

We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_{d}$ to serve as the vertices of the graph,…

math.PR2012

Distribution of components in the k-nearest neighbour random geometric graph for k below the connectivity threshold

Victor Falgas-Ravry

Let S_{n,k} denote the random geometric graph obtained by placing points inside a square of area n according to a Poisson point process of intensity 1 and joining each such point t…

math.PR2011

Sharpness in the k-nearest neighbours random geometric graph model

Victor Falgas-Ravry, Mark Walters

Let $S_{n, k}$ denote the random geometric graph obtained by placing points in a square box of area $n$ according to a Poisson process of intensity 1 and joining each point to its $…