3 papers
math.CO2026
A universal dichotomy for concentration in randomly colored graphs
Nicola Apollonio
Let be Euclidean norm of the degree sequence of a graph normalized by the graph size. We prove that when the vertices of a graph are randomly colored with colors such that…
stat.ML2026
Posterior Bayesian Neural Networks with Dependent Weights
Nicola Apollonio, Giovanni Franzina, Giovanni Luca Torrisi
We consider fully connected and feedforward deep neural networks with dependent and possibly heavy-tailed weights, as introduced in [26], to address limitations of the standard Gau…
math.PR2026
The Critical Patch Size Problem in Random Graphs
Nicola Apollonio, Veronica Tora, Davide Vergni
The problem of {\it critical patch size} -- a threshold condition for population persistence -- is investigated in the context of discrete habitats, modeled as graphs with a distin…