Tootfinder

Morland P.I. 🔎🌹📖
Dramatized romantic comedy | Kit Morland, true crime podcaster and wannabe heroine, is dying for some excitement. When her neighbours offer to take her on a trip to Bath, site of the famous Chawton Murders, she knows this is her chance to investigate the unsolved mystery. But Kit’s new environmen...
https://www.

Morland P.I. 🔎🌹📖
Dramatized romantic comedy | Kit Morland, true crime podcaster and wannabe heroine, is dying for some excitement. When her neighbours offer to take her on a trip to Bath, site of the famous Chawton Murders, she knows this is her chance to investigate the unsolved mystery. But Kit’s new environment is full of distractions. Queer love story 1 seasons, 14 episodes as of Apr 03, 2023.

This https://arxiv.org/abs/2403.00556 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Nearest-Neighbours Estimators for Conditional Mutual Information
The conditional mutual information quantifies the conditional dependence of two random variables. It has numerous applications; it forms, for example, part of the definition of transfer entropy, a common measure of the causal relationship between time series. It does, however, require a lot of data to estimate accurately and suffers the curse of dimensionality, limiting its application in machine learning and data science. However, the Kozachenko-Leonenko approach can address this problem: it i…

Fast Computation of Leave-One-Out Cross-Validation for $k$-NN Regression
Motonobu Kanagawa
https://arxiv.org/abs/2405.04919 https://a…

Fast Computation of Leave-One-Out Cross-Validation for $k$-NN Regression
We describe a fast computation method for leave-one-out cross-validation (LOOCV) for $k$-nearest neighbours ($k$-NN) regression. We show that, under a tie-breaking condition for nearest neighbours, the LOOCV estimate of the mean square error for $k$-NN regression is identical to the mean square error of $(k+1)$-NN regression evaluated on the training data, multiplied by the scaling factor $(k+1)^2/k^2$. Therefore, to compute the LOOCV score, one only needs to fit $(k+1)$-NN regression only once…

This https://arxiv.org/abs/2401.09264 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_…

A New Approach to Find the Böhm-Vitense gap
This paper discusses the Böhm-Vitense gap, a gap in the colours of stars that occurs when the atmosphere changes from radiative to convective in deep layers. We are using different algorithms for detecting gaps in colour-magnitude diagrams (CMDs), including the k-nearest neighbours (k-NN) and UniDip algorithms. We propose using a combination of the k-NN algorithm and the UniDip algorithm and manual verification to identify gaps unlikely to be of a statistical origin. Using the $Gaia$ photometr…

That's Showbiz Baby!
Great Australian Pods Podcast Directory: #GreatAusPods

That’s Showbiz Baby! | Great Australian Pods Podcast Directory
Podcast: That’s Showbiz Baby! Hosts: Jordy Lucas and Alexandria Funnell Category: TV & Movies Sub-Category: Careers, Entertainment News First Episode: 2024 Former Neighbours star Jordy Lucas is joined…

As China has become deeply enmeshed in strategic competition with the US
– while edging towards outright hostilities with other regional neighbours
– Washington’s alarm at the pace of its advancement in space is growing ever-louder.
Beijing has made no secret over its ambitions and a spate of recent successful space missionshas shown that the government’s rhetoric is backed by technological advances.
On Friday, China launched a robotic spacecraft on a round trip to the…

Further Understanding of a Local Gaussian Process Approximation: Characterising Convergence in the Finite Regime
Anthony Stephenson, Robert Allison, Edward Pyzer-Knapp
https://arxiv.org/abs/2404.06200

Further Understanding of a Local Gaussian Process Approximation: Characterising Convergence in the Finite Regime
We show that common choices of kernel functions for a highly accurate and massively scalable nearest-neighbour based GP regression model (GPnn: \cite{GPnn}) exhibit gradual convergence to asymptotic behaviour as dataset-size $n$ increases. For isotropic kernels such as Matérn and squared-exponential, an upper bound on the predictive MSE can be obtained as $O(n^{-\frac{p}{d}})$ for input dimension $d$, $p$ dictated by the kernel (and $d>p$) and fixed number of nearest-neighbours $m$ with minima…

Estimating the mass of galactic components using machine learning algorithms
Jessica N. Lopez Sanchez, Erick Munive Villa, Ana A. Avilez Lopez, Oscar M. Martinez Bravo
https://arxiv.org/abs/2403.06178

Estimating the mass of galactic components using machine learning algorithms
The estimation of the bulge and disk massses, the main baryonic components of a galaxy, can be performed using various approaches, but their implementation tend to be challenging as they often rely on strong assumptions about either the baryon dynamics or the dark matter model. In this work, we present an alternative method for predicting the masses of galactic components, including the disk, bulge, stellar and total mass, using a set of machine learning algorithms: KNN-neighbours (KNN), Linear…

🔊 #NowPlaying on BBCRadio1's #EarlyBreakfast
Good Neighbours:
🎵 Home
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/6dpLxbF7lfCAnC9QRTjNLK

That's Showbiz Baby!
Great Australian Pods Podcast Directory: #GreatAusPods

That’s Showbiz Baby! | Great Australian Pods Podcast Directory
Podcast: That’s Showbiz Baby! Hosts: Jordy Lucas and Alexandria Funnell Category: TV & Movies Sub-Category: Careers, Entertainment News First Episode: 2024 Former Neighbours star Jordy Lucas is joined…

Jasper, our neighbour's cat who is allowed outside, came by to say good morning to our pack. Casper and Harley are always interested in hearing what he has to say.
#CatsOfMastadon #DogsOfMastadon #Neighbours

We've never owned a car and this week finally got around to ripping up the parking pad in front of the house. Soon it'll be a garden!
Our neighbours, despite at least talking a good game re: the climate crisis, think we're nuts. "You're throwing away equity!!" I don't buy liberal individualist explanations for the problems we face, but this sort of attitude, held by just about everyone we've spoken with, really won't help get us to the collective s…

One of the neighbours' cats has a thing for the mealworms in the bird food and grazes on the ground trays.
Feeding the predator prey cycle.
Now the cat has gone a small cloud of starlings have swooped down. They haven't yet consolidated into the large cloud that comes twice a day. I don't know whether the rain and variable temperatures are affecting the eggs and hatching.
#GardenBirds

"At least two dozen countries worldwide have already made the sensible transition to some form of automatic tax filing, not necessarily just for low-income citizens, but in many cases for everyone. The UK, Japan, Australia, Denmark, Chile, and Portugal have implemented some version of an automated, digital tax system, and none of them have turned back."
How the tax industry is keeping automatic filing out of reach – Canadian Dimension

How the tax industry is keeping automatic filing out of reach
In the unfair fight for automatic tax filing, Canadians need to get behind the underdog. While many of us might welcome and benefit from this service, it’s our vulnerable friends and neighbours who need it the most. We must come together to join the chorus calling for this crucial tax reform—and be louder than those motivated by nothing more than greed.

Nearest-Neighbours Estimators for Conditional Mutual Information
Jake Witter, Conor Houghton
https://arxiv.org/abs/2403.00556 https://

Nearest-Neighbours Estimators for Conditional Mutual Information
The conditional mutual information quantifies the conditional dependence of two random variables. It has numerous applications; it forms, for example, part of the definition of transfer entropy, a common measure of the causal relationship between time series. It does, however, require a lot of data to estimate accurately and suffers the curse of dimensionality, limiting its application in machine learning and data science. However, the Kozachenko-Leonenko approach can address this problem: it i…

🔊 #NowPlaying on BBCRadio1's #Radio1sFutureSoulWithVictoriaJane
BERWYN:
🎵 NEIGHBOURS
#BBCR1 #BERWYN
https://open.spotify.com/track/1q74d6pWGeHrGOifl6o2W9
https://imnaku.bandcamp.com/track/berwyngesaffneighbours-fred-again-naku-edit

A Directional Diffusion Graph Transformer for Recommendation
Zixuan Yi, Xi Wang, Iadh Ounis
https://arxiv.org/abs/2404.03326 https://…

A Directional Diffusion Graph Transformer for Recommendation
In real-world recommender systems, implicitly collected user feedback, while abundant, often includes noisy false-positive and false-negative interactions. The possible misinterpretations of the user-item interactions pose a significant challenge for traditional graph neural recommenders. These approaches aggregate the users' or items' neighbours based on implicit user-item interactions in order to accurately capture the users' profiles. To account for and model possible noise in the users' int…

And while I've been a small part in helping on the committee, the real work has been done by the people on the ground in the community talking with their neighbours, organising meetings, and getting petitions signed, and if needed in the future, protest.
People power can work.

Robust Training of Temporal GNNs using Nearest Neighbours based Hard Negatives
Shubham Gupta, Srikanta Bedathur
https://arxiv.org/abs/2402.09239 https://…

Robust Training of Temporal GNNs using Nearest Neighbours based Hard Negatives
Temporal graph neural networks Tgnn have exhibited state-of-art performance in future-link prediction tasks. Training of these TGNNs is enumerated by uniform random sampling based unsupervised loss. During training, in the context of a positive example, the loss is computed over uninformative negatives, which introduces redundancy and sub-optimal performance. In this paper, we propose modified unsupervised learning of Tgnn, by replacing the uniform negative sampling with importance-based negati…

Having fun chatting with a few neighbours about the condo newsletter. I pick their brains to find out subject areas that are of interest or concern and draft the text for the next newsletter or a draft in the one following that.
With spring coming around there will be a few articles on the local farmers markets and craft shows.
Still debating about a short article about best practices for home computer users & security though.

This https://arxiv.org/abs/0710.3901 has been replaced.
link: https://scholar.google.com/scholar?q=a<…

A recursive linear time modular decomposition algorithm via LexBFS
A module of a graph G is a set of vertices that have the same set of neighbours outside. Modules of a graphs form a so-called partitive family and thereby can be represented by a unique tree MD(G), called the modular decomposition tree. Motivated by the central role of modules in numerous algorithmic graph theory questions, the problem of efficiently computing MD(G) has been investigated since the early 70's. To date the best algorithms run in linear time but are all rather complicated. By comb…

I’m late to this but, in honour of my friend @…’s beloved Jack, today is officially international Ice Cream and Loud Music Day.
Celebrate irresponsibly. Piss off your neighbours. :)

“The problem with investing in defence is that, of course, for leaders who have much better neighbours than we do, it is very hard to explain to the people when it is peacetime," she added. “But the problem with defence is that when you need it, then it's already too late to take any further steps."
"We want to have peace, but we want to have a sustainable peace. And the peace on Russia's terms is not a sustainable. That means that we are going to have a pause of some years, and it's going to go even further because they can."
QT: https://mstdn.social/@noelreports/112134331362445798

Perfect colourings of simplices and hypercubes in dimension four and five with few colours
Dirk Frettl\"oh
https://arxiv.org/abs/2402.18457 https://…

Perfect colourings of simplices and hypercubes in dimension four and five with few colours
A vertex colouring of some graph is called perfect if each vertex of colour $i$ has the same number $a_{ij}$ of neighbours of colour $j$. Here we determine all perfect colourings of the edge graphs of the hypercube in dimensions 4 and 5 by two and three colours, respectively. For comparison we list all perfect colourings of the edge graphs of the simplex in dimensions 4 and 5, respectively.

> [[Vancouver]]'s new [[mega-development]] is big, ambitious and undeniably [[Indigenous]]:
https://macleans.ca/society/sen̓aḵw-vancouver/
Looks very promising to me!

Vancouver's new mega-development is big, ambitious and undeniably Indigenous - Macleans.ca
In B.C., Indigenous nations are reclaiming power and wealth for their own citizens—no matter what the neighbours think

My monthly vege garden update. The heritage tomatoes have finished and the cherry tomatoes are on their last legs. The two cucumber vines are producing a couple of cucumbers a day so luckily the neighbours have three kids to munch through the excess. The potatoes have finished but the celery is almost ready for harvest. The new parsley plants are big enough we have started cutting them. We've put in a lemongrass plant to complement the thyme, sage, oregano, basil and mint.

From Sightline
It’s (Past) Time for British Columbia to Legalize Roommates
Another piece of the puzzle to make housing more affordable in the province—and keep up with southern neighbours Washington and Oregon.
Author: Daniel Oleksiuk
(@dannyoleksiuk) on April 15, 2024 at 7:00 am

It’s (Past) Time for British Columbia to Legalize Roommates
Another piece of the puzzle to make housing more affordable in the province—and keep up with southern neighbors Washington and Oregon.

Private graph colouring with limited defectiveness
Aleksander B. G. Christiansen, Eva Rotenberg, Teresa Anna Steiner, Juliette Vlieghe
https://arxiv.org/abs/2404.18692 https://arxiv.org/pdf/2404.18692
arXiv:2404.18692v1 Announce Type: new
Abstract: Differential privacy is the gold standard in the problem of privacy preserving data analysis, which is crucial in a wide range of disciplines. Vertex colouring is one of the most fundamental questions about a graph. In this paper, we study the vertex colouring problem in the differentially private setting.
To be edge-differentially private, a colouring algorithm needs to be defective: a colouring is d-defective if a vertex can share a colour with at most d of its neighbours. Without defectiveness, the only differentially private colouring algorithm needs to assign n different colours to the n different vertices. We show the following lower bound for the defectiveness: a differentially private c-edge colouring algorithm of a graph of maximum degree {\Delta} > 0 has defectiveness at least d = {\Omega} (log n / (log c log {\Delta})).
We also present an {\epsilon}-differentially private algorithm to {\Theta} ( {\Delta} / log n 1 / {\epsilon})-colour a graph with defectiveness at most {\Theta}(log n).

Temporal segmentation of motion propagation in response to an external impulse
Sina Feldmann, Thomas Chatagnon, Juliane Adrian, Julien Pettr\'e, Armin Seyfried
https://arxiv.org/abs/2402.19024

Temporal segmentation of motion propagation in response to an external impulse
In high-density crowds, local motion can propagate, amplify, and lead to macroscopic phenomena, including 'density waves'. These density waves only occur when individuals interact, and impulses are transferred to neighbours. How this impulse is passed on by the human body and which effects this has on individuals is still not fully understood. To further investigate this, experiments focusing on the propagation of a push were conducted. In the experiments the crowd is greatly simplified by five…

An Invariance Principle of 1D KPZ with Robin Boundary Conditions
Yiming Tang
https://arxiv.org/abs/2404.19215 https://arxiv.org/pdf/2…

An Invariance Principle of 1D KPZ with Robin Boundary Conditions
We consider a discrete one-dimensional random interface on the half-space whose height at any positive point is defined as a sum of an independent random noise and a function of the heights at its two closest neighbours. In 2022, Adhikari and Chatterjee proved for the full-space model that assuming the function is equivariant, symmetric, and at least six times differentiable in a neighbourhood of zero, as the variance of the noise variables goes to zero, the height function converges to the Col…

This https://arxiv.org/abs/2303.07008 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_eco…

Status substitution and conspicuous consumption
This paper adapts ideas from social identity theory to set out a new framework for modelling conspicuous consumption. Agents derive status from their own conspicuous consumption and from belonging to an identity group with high conspicuous consumption. Importantly, these two sources of status are substitutes. Agents also feel pressure to conform with their neighbours in a network. This framework can rationalise a set of seemingly conflicting stylised facts about conspicuous consumption that are…

Correlated Electron Effects in Chromium Trihalide Hetostructures with Graphene: A Tight-Binding Model Perspective
Igor Rozhansky, Vladimir Fal'ko
https://arxiv.org/abs/2404.18858

Correlated Electron Effects in Chromium Trihalide Hetostructures with Graphene: A Tight-Binding Model Perspective
In this study, we present an effective tight-binding model for an accurate description of the lowest energy quadruplet of conduction band in a ferromagnetic CrX$_3$ monolayer, tuned to the complementary \textit{ab initio} density functional theory simulations. This model, based on a minimum number of chromium orbitals, captures a distinctively flat dispersion in those bands but requires taking into account hoppings beyond nearest neighbours, revealing ligand-mediated electron pathways connectin…

“The problem with investing in defence is that, of course, for leaders who have much better neighbours than we do, it is very hard to explain to the people when it is peacetime," she added. “But the problem with defence is that when you need it, then it's already too late to take any further steps."
"We want to have peace, but we want to have a sustainable peace. And the peace on Russia's terms is not a sustainable. That means that we are going to have a pause …

🔊 #NowPlaying on BBCRadio1's #EarlyBreakfast
Good Neighbours:
🎵 Home
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/6dpLxbF7lfCAnC9QRTjNLK

Ferromagnetic Ising Model on multiregular random graphs
Diego Alberici, Pierluigi Contucci, Emanuele Mingione, Filippo Zimmaro
https://arxiv.org/abs/2403.14307

Ferromagnetic Ising Model on multiregular random graphs
A family of multispecies Ising models on generalized regular random graphs is investigated in the thermodynamic limit. The architecture is specified by class-dependent couplings and magnetic fields. We prove that the magnetizations, neighbours correlations and free energy converge to suitable functions evaluated at the solution of a belief propagation fixed point equation. In absence of magnetic fields, a phase transition is identified and the corresponding critical parameters are determined by…

This https://arxiv.org/abs/2310.01793 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

On regular sets in Cayley graphs
Let $\Ga = (V, E)$ be a graph and $a, b$ nonnegative integers. An $(a, b)$-regular set in $\Ga$ is a nonempty proper subset $D$ of $V$ such that every vertex in $D$ has exactly $a$ neighbours in $D$ and every vertex in $V \setminus D$ has exactly $b$ neighbours in $D$. A $(0,1)$-regular set is called a perfect code, an efficient dominating set, or an independent perfect dominating set. A subset $D$ of a group $G$ is called an $(a,b)$-regular set of $G$ if it is an $(a, b)$-regular set in some C…

Generalising the maximum independent set algorithm via Boolean networks
Maximilien Gadouleau, David C. Kutner
https://arxiv.org/abs/2403.17658 https://

Generalising the maximum independent set algorithm via Boolean networks
A simple greedy algorithm to find a maximal independent set (MIS) in a graph starts with the empty set and visits every vertex, adding it to the set if and only if none of its neighbours are already in the set. In this paper, we consider the generalisation of this MIS algorithm by letting it start with any set of vertices and we prove the hardness of many decision problems related to this generalisation. Our results are based on two main strategies. Firstly, we view the MIS algorithm as a seque…

This https://arxiv.org/abs/2211.11278 has been replaced.
link: https://scholar.google.com/scholar?q=a

Optimal Extended Neighbourhood Rule $k$ Nearest Neighbours Ensemble
The traditional k nearest neighbor (kNN) approach uses a distance formula within a spherical region to determine the k closest training observations to a test sample point. However, this approach may not work well when test point is located outside this region. Moreover, aggregating many base kNN learners can result in poor ensemble performance due to high classification errors. To address these issues, a new optimal extended neighborhood rule based ensemble method is proposed in this paper. Th…

Random friend trees
Louigi Addario Berry, Simon Briend, Luc Devroye, Serte Donderwinkel, C\'eline Kerriou, G\'abor Lugosi
https://arxiv.org/abs/2403.20185

Random friend trees
We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saramäki and Kaski. Vertices are attached in a sequential manner one by one by selecting an existing target vertex and connecting to one of its neighbours (or friends), chosen uniformly at random. This model has interesting emergent properties, such as a highly skewed degree sequence. In contrast to the preferential attachment model, these emergent phenomena stem from a local r…

Partitioning the projective plane to two incidence-rich parts
Zolt\'an L\'or\'ant Nagy
https://arxiv.org/abs/2403.13734 https://

Partitioning the projective plane to two incidence-rich parts
An internal or friendly partition of a vertex set $V(G)$ of a graph $G$ is a partition to two nonempty sets $A\cup B$ such that every vertex has at least as many neighbours in its own class as in the other one. Motivated by Diwan's existence proof on internal partitions of graphs with high girth, we give constructive proofs for the existence of internal partitions in the incidence graph of projective planes and discuss its geometric properties. In addition, we determine exactly the maximum poss…

🔊 #NowPlaying on BBCRadio1's #GoingHomeWithVick,KatieAndJamie
Good Neighbours:
🎵 Home
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/6dpLxbF7lfCAnC9QRTjNLK

This https://arxiv.org/abs/2211.11278 has been replaced.
link: https://scholar.google.com/scholar?q=a

Optimal Extended Neighbourhood Rule $k$ Nearest Neighbours Ensemble
The traditional k nearest neighbor (kNN) approach uses a distance formula within a spherical region to determine the k closest training observations to a test sample point. However, this approach may not work well when test point is located outside this region. Moreover, aggregating many base kNN learners can result in poor ensemble performance due to high classification errors. To address these issues, a new optimal extended neighborhood rule based ensemble method is proposed in this paper. Th…

This https://arxiv.org/abs/2403.00556 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Nearest-Neighbours Estimators for Conditional Mutual Information
The conditional mutual information quantifies the conditional dependence of two random variables. It has numerous applications; it forms, for example, part of the definition of transfer entropy, a common measure of the causal relationship between time series. It does, however, require a lot of data to estimate accurately and suffers the curse of dimensionality, limiting its application in machine learning and data science. However, the Kozachenko-Leonenko approach can address this problem: it i…

A Central Limit Theorem and Exponential Correlation Decay for the Coulomb Chain
Henrik Ekstr\"om
https://arxiv.org/abs/2404.14884 https://

A Central Limit Theorem and Exponential Correlation Decay for the Coulomb Chain
We study the Coulomb chain where particles are restricted to one dimension and experience three-dimensional Coulomb interactions with their nearest and next-to-nearest neighbours. The distances between consecutive particles are treated as random variables. It is shown that the correlation between clusters of consecutive variables decay exponentially with the number of variables separating them. This result is then used to prove a central limit theorem.

Finding $d$-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and $H$-Free Graphs
Felicia Lucke, Ali Momeni, Dani\"el Paulusma, Siani Smith
https://arxiv.org/abs/2404.11389

Finding $d$-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and $H$-Free Graphs
The $d$-Cut problem is to decide if a graph has an edge cut such that each vertex has at most $d$ neighbours at the opposite side of the cut. If $d=1$, we obtain the intensively studied Matching Cut problem. The $d$-Cut problem has been studied as well, but a systematic study for special graph classes was lacking. We initiate such a study and consider classes of bounded diameter, bounded radius and $H$-free graphs. We prove that for all $d\geq 2$, $d$-Cut is polynomial-time solvable for graphs …

🔊 #NowPlaying on BBCRadio1's #Breakfast with #GregJames
Good Neighbours:
🎵 Home
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/609IlWeoziOobNvON3rDzi

🔊 #NowPlaying on BBCRadio1's #Breakfast with #GregJames
Good Neighbours:
🎵 Home
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/609IlWeoziOobNvON3rDzi

Spatial Queues with Nearest Neighbour Shifts
B. R. Vinay Kumar, Lasse Leskel\"a
https://arxiv.org/abs/2402.13192 https://arxiv.o…

Spatial Queues with Nearest Neighbour Shifts
In this work we study multi-server queues on a Euclidean space. Consider $N$ servers that are distributed uniformly in $[0,1]^d$. Customers (users) arrive at the servers according to independent Poisson processes of intensity $λ$. However, they probabilistically decide whether to join the queue they arrived at, or move to one of the nearest neighbours. The strategy followed by the customers affects the load on the servers in the long run. In this paper, we are interested in characterizing the …

🔊 #NowPlaying on BBCRadio1's #Radio1sFutureSoulWithVictoriaJane
BERWYN:
🎵 NEIGHBOURS
#BBCR1 #BERWYN
https://open.spotify.com/track/1q74d6pWGeHrGOifl6o2W9
https://imnaku.bandcamp.com/track/berwyngesaffneighbours-fred-again-naku-edit

This https://arxiv.org/abs/2312.15105 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

The friendship paradox for sparse random graphs
Let $G_n$ be an undirected finite graph on $n\in\mathbb{N}$ vertices labelled by $[n] = \{1,\ldots,n\}$. For $i \in [n]$, let $Δ_{i,n}$ be the friendship bias of vertex $i$, defined as the difference between the average degree of the neighbours of vertex $i$ and the degree of vertex $i$ itself when $i$ is not isolated, and zero when $i$ is isolated. Let $μ_n$ denote the friendship-bias empirical distribution, i.e., the measure that puts mass $\frac{1}{n}$ at each $Δ_{i,n}$, $i \in [n]$. The …

Bootstrap Percolation on the Binomial Random $k$-uniform Hypergraph
Mihyun Kang, Christoph Koch, Tam\'as Makai
https://arxiv.org/abs/2403.12775 https:/…

Bootstrap Percolation on the Binomial Random $k$-uniform Hypergraph
We investigate the behaviour of $r$-neighbourhood bootstrap percolation on the binomial $k$-uniform random hypergraph $H_k(n,p)$ for given integers $k\geq 2$ and $r\geq 2$. In $r$-neighbourhood bootstrap percolation, infection spreads through the hypergraph, starting from a set of initially infected vertices, and in each subsequent step of the process every vertex with at least $r$ infected neighbours becomes infected. For our analysis the set of initially infected vertices is chosen uniformly …

🔊 #NowPlaying on BBCRadio1's #Radio1Breakfast
Good Neighbours:
🎵 Home
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/6dpLxbF7lfCAnC9QRTjNLK

🔊 #NowPlaying on BBCRadio1's #EarlyBreakfast
Good Neighbours:
🎵 Home
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/609IlWeoziOobNvON3rDzi

🔊 #NowPlaying on BBCRadio1's #EarlyBreakfast
Good Neighbours:
🎵 Home
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/6dpLxbF7lfCAnC9QRTjNLK

🔊 #NowPlaying on BBCRadio1's #MattAndMollie
Good Neighbours:
🎵 Home
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/6dpLxbF7lfCAnC9QRTjNLK

🔊 #NowPlaying on BBCRadio1's #MattAndMollie
Good Neighbours:
🎵 Home
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/609IlWeoziOobNvON3rDzi

🔊 #NowPlaying on BBCRadio1's #Radio1sFutureAlternative
Good Neighbours:
🎵 Keep It Up
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/3B7cm8w1IAfOfgQHFvAsft

🔊 #NowPlaying on BBCRadio1's #Breakfast with #GregJames
Good Neighbours:
🎵 Home
#BBCR1 #GoodNeighbours
https://open.spotify.com/track/6dpLxbF7lfCAnC9QRTjNLK