output
19942026
Showing math.PRShow all

246 papers · 1 filter

math.PR2025

Planted clique recovery in random geometric graphs

Konstantin Avrachenkov, Andrei Bobu, Nelly Litvak +1

We investigate the problem of identifying planted cliques in random geometric graphs, focusing on two distinct algorithmic approaches: the first based on vertex degrees (VD) and th…

math.PR2025

Upper Expected Meeting Times for Interdependent Stochastic Agents

Marco Sangalli, Erik Quaeghebeur, Thomas Krak

We analyse the problem of meeting times for interdependent stochastic agents: random walkers whose behaviour is stochastic but controlled by their selections from some set of allow…

math.PR2024

Are giants in random digraphs `almost' local?

Remco van der Hofstad, Manish Pandey

Recently, the first author showed that the giant in random undirected graphs is `almost' local. This means that, under a necessary and sufficient condition, the limiting proportion…

math.PR2024★ 1 cited

Binary search trees of permuton samples

Benoît Corsini, Victor Dubach, Valentin Féray

Binary search trees (BST) are a popular type of data structure when dealing with ordered data. Indeed, they enable one to access and modify data efficiently, with their height corr…

math.PR2024

Mixing of fast random walks on dynamic random permutations

Luca Avena, Remco van der Hofstad, Frank den Hollander +1

We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamic…

math.PR2023

Batch sojourn time in polling systems on a circle

Tim Engels, Ivo Adan, Onno Boxma +1

In this paper, we analyze a polling system on a circle. Random batches of customers arrive at a circle, where each customer, independently, obtains a uniform location. A single ser…

math.PR2023

Sharp concentration for sums of matrices with Markovian dependence through universality

Alexander Van Werde, Jaron Sanders

We prove that a sum of random matrices generated by a -mixing Markov chain has similar spectral properties to a Gaussian matrix with the same mean and covariance structure. This…

math.PR2023

Non-asymptotic convergence bounds for Sinkhorn iterates and their gradients: a coupling approach

Giacomo Greco, Maxence Noble, Giovanni Conforti +1

Computational optimal transport (OT) has recently emerged as a powerful framework with applications in various fields. In this paper we focus on a relaxation of the original OT pro…

math.PR2023

Gibbs Properties of the Bernoulli field on inhomogeneous trees under the removal of isolated sites

Florian Henning, Christof Külske, Niklas Schubert

We consider the i.i.d. Bernoulli field with occupation density on a possibly non-regular countably infinite tree with bounded degrees. For large , we show th…

math.PR2023★ 1 cited

Connectivity of random graphs after centrality-based vertex removal

Manish Pandey, Remco van der Hofstad

Centrality measures aim to indicate who is important in a network. Various notions of `being important' give rise to different centrality measures. In this paper, we study how impo…

math.PR2023★ 4 cited

Cluster-size decay in supercritical long-range percolation

Joost Jorritsma, Júlia Komjáthy, Dieter Mitsche

We study the cluster-size distribution of supercritical long-range percolation on , where two vertices are connected by an edge with probability…

math.PR2023★ 4 cited

Infinite-volume states with irreducible localization sets for gradient models on trees

Alberto Abbondandolo, Florian Henning, Christof Kuelske +1

We consider general classes of gradient models on regular trees with values in a countable Abelian group such as or , in regimes of strong coupling (…

math.PR2022★ 6 cited

Scaling of the clustering function in spatial inhomogeneous random graphs

Remco van der Hofstad, Pim van der Hoorn, Neeladri Maitra

We consider an infinite spatial inhomogeneous random graph model with an integrable connection kernel that interpolates nicely between existing spatial random graph models. Key exa…

math.PR2022★ 7 cited

Exact results for the order picking time distribution under return routing

Tim Engels, Ivo Adan, Onno Boxma +1

This paper derives exact expressions for the Laplace-Stieltjes transform of the order picking time in single- and 2-block warehouses. We consider manual warehouses that deploy retu…

math.PR2022★ 1 cited

Stability of a Stochastic Ring Network

Jaap Storm, Wouter Kager, Michel Mandjes +1

In this paper we establish a necessary and sufficient stability condition for a stochastic ring network. Such networks naturally appear in a variety of applications within communic…

math.PR2022★ 3 cited

Singular value distribution of dense random matrices with block Markovian dependence

Jaron Sanders, Alexander Van Werde

A block Markov chain is a Markov chain whose state space can be partitioned into a finite number of clusters such that the transition probabilities only depend on the clusters. Blo…

math.PR2022★ 4 cited

An exact analysis and comparison of manual picker routing heuristics

Tim Engels, Ivo Adan, Onno Boxma +1

This paper presents exact derivations of the first two moments of the total picking time in a warehouse for four routing heuristics, under the assumption of random storage. The ana…

math.PR2022★ 3 cited

Performance Evaluation of Stochastic Bipartite Matching Models

Céline Comte, Jan-Pieter Dorsman

We consider a stochastic bipartite matching model consisting of multi-class customers and multi-class servers. Compatibility constraints between the customer and server classes are…

math.PR2021★ 4 cited

Utility maximizing load balancing policies

Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden

Consider a service system where incoming tasks are instantaneously dispatched to one out of many heterogeneous server pools. Associated with each server pool is a concave utility f…

math.PR2021★ 3 cited

Metastability for the degenerate Potts Model with positive external magnetic field under Glauber dynamics

Gianmarco Bet, Anna Gallo, Francesca R. Nardi

We consider the ferromagnetic q-state Potts model on a finite grid graph with non-zero external field and periodic boundary conditions. The system evolves according to Glauber-type…

math.PR2021★ 8 cited

Critical Droplets and sharp asymptotics for Kawasaki dynamics with strongly anisotropic interactions

Simone Baldassarri, Francesca R. Nardi

In this paper we analyze metastability and nucleation in the context of the Kawasaki dynamics for the two-dimensional Ising lattice gas at very low temperature. Let $Λ\subset\mathb…

math.PR2021★ 12 cited

Critical Droplets and sharp asymptotics for Kawasaki dynamics with weakly anisotropic interactions. Extended version

Simone Baldassarri, Francesca R. Nardi

In this paper we analyze metastability and nucleation in the context of the Kawasaki dynamics for the two-dimensional Ising lattice gas at very low temperature with periodic bounda…

math.PR2021★ 24 cited

An M/M/c queue with queueing-time dependent service rates

Bernardo D'Auria, Ivo J. B. F. Adan, René Bekker +1

Recent studies indicate that in many situations service times are affected by the experienced queueing delay of the particular customer. This effect has been detected in different…

math.PR2021★ 1 cited

Barely supercritical percolation on Poissonian scale-free networks

Souvik Dhara, Remco van der Hofstad

We study the giant component problem slightly above the critical regime for percolation on Poissonian random graphs in the scale-free regime, where the vertex weights and degrees h…