AI Chat AI Image Generator AI Video Text to Speech

An Algorithm for Bounding the Probability of r-core Formation in k-uniform Random Hypergraphs

01/15/2019

∙

by George Bissias, et al.

∙

∙

We present an algorithm for bounding the probability of r-core formation in k-uniform hypergraphs. Understanding the probability of core formation is useful in numerous applications including bounds on the failure rate of Invertible Bloom Lookup Tables (IBLTs) and the probability that a boolean formula is satisfiable.

page 1

page 2

page 3

page 4

research

∙ 04/11/2021

The Core of Approval Participatory Budgeting with Uniform Costs (or with up to Four Projects) is Non-Empty

In the Approval Participatory Budgeting problem an agent prefers a set o...

0 Reshef Meir, et al. ∙

research

∙ 01/12/2018

Self-Predicting Boolean Functions

A Boolean function g is said to be an optimal predictor for another Bool...

0 Nir Weinberger, et al. ∙

research

∙ 12/13/2020

Uniform Circle Formation By Oblivious Swarm Robots

In this paper, we study the circle formation problem by multiple autonom...

0 Moumita Mondal, et al. ∙

research

∙ 09/23/2022

Overtwisting and Coiling Highly Enhances Strain Generation of Twisted String Actuators

Twisted string actuators (TSAs) have exhibited great promise in robotic ...

0 Revanth Konda, et al. ∙

research

∙ 12/01/2017

An Optimal Algorithm for Changing from Latitudinal to Longitudinal Formation of Autonomous Aircraft Squadrons

This work presents an algorithm for changing from latitudinal to longitu...

0 Paulo André Sperandio Giacomin, et al. ∙

research

∙ 05/13/2022

Asymptotics for connected graphs and irreducible tournaments

We compute the whole asymptotic expansion of the probability that a larg...

0 Thierry Monteil, et al. ∙

research

∙ 08/07/2018

Parallel and Streaming Algorithms for K-Core Decomposition

The k-core decomposition is a fundamental primitive in many machine lear...

0 Hossein Esfandiari, et al. ∙