4 papers
Random spanning trees in random environment
Luca Makowiec, Michele Salvi, Rongfeng Sun
We introduce a new spanning tree model called the random spanning tree in random environment (RSTRE), which interpolates between the uniform spanning tree and the minimum spanning…
Payment-failure times for random Lightning paths
Taki E. M. Abedesselam, Fabio Giacomelli, Francesco Pasquale +1
We study a random process over graphs inspired by the way payments are executed in the Lightning Network, the main layer-two solution on top of Bitcoin. We first prove almost tight…
The spectrum of dense kernel-based random graphs
Alessandra Cipriani, Rajat Subhra Hazra, Nandan Malhotra +1
Kernel-based random graphs (KBRGs) are a broad class of random graph models that account for inhomogeneity among vertices. We consider KBRGs on a discrete dimensional torus $\m…
Diameter of uniform spanning trees on random weighted graphs
Luca Makowiec, Michele Salvi, Rongfeng Sun
For any edge weight distribution, we consider the uniform spanning tree (UST) on finite graphs with i.i.d. random edge weights. We show that, for bounded degree expander graphs and…