Related papers: Estimates for the empirical distribution along a g…

We investigate the behaviour of the shortest path on a directed two-dimensional square lattice for bond percolation at the critical probability $p_c$ . We observe that flipping an edge lying on the shortest path has a non-local effect in…

We consider a dynamical process in a network which distributes all particles (tokens) located at a node among its neighbors, in a round-robin manner. We show that in the recurrent state of this dynamics (i.e., disregarding a polynomially…

We study the edge physics of gapped quantum systems in the framework of Projected Entangled Pair State (PEPS) models. We show that the effective low-energy model for any region acts on the entanglement degrees of freedom at the boundary,…

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 finite boxes of ${\mathbb Z}^d$, the diameter of the UST is…

Working in the setting of i.i.d. last-passage percolation on $\mathbb{R}^D$ with no assumptions on the underlying edge\hyp{}weight distribution, we arrive at the notion of grid entropy - a Subadditive Ergodic Theorem limit of the entropies…

We study crossing numbers of dense graph drawings whose vertices are uniformly distributed either on the unit sphere or in a compact convex planar domain. We prove a sharp inequality for weighted geodesic drawings on $\mathbb S^2$ in a…

For the critical level-set of the Gaussian free field on the metric graph of $\mathbb Z^d$, we consider the one-arm probability $\theta_d(N)$, i.e., the probability that the boundary of a box of side length $2N$ is connected to the center.…

A geodesic cycle in a graph is a cycle with no shortcuts, so that the shortest path between any two nodes in the cycle is the path along the cycle itself. A recently published paper used random graph models to investigate the geodesic cycle…

Many load balancing problems that arise in scientific computing applications ask to partition a graph with weights on the vertices and costs on the edges into a given number of almost equally-weighted parts such that the maximum boundary…

This work considers finding optimal positions for the electrodes within the Bayesian paradigm based on available prior information on the conductivity; the aim is to place the electrodes so that the posterior density of the (discretized)…

We study the statistical properties of geodesics, i.e. paths of minimal length, in large random planar quadrangulations. We extend Schaeffer's well-labeled tree bijection to the case of quadrangulations with a marked geodesic, leading to…

We investigate the geometrical structure of probabilistic generative dimensionality reduction models using the tools of Riemannian geometry. We explicitly define a distribution over the natural metric given by the models. We provide the…

We compute the expectation of the number of linear spaces on a random complete intersection in $p$-adic projective space. Here "random" means that the coefficients of the polynomials defining the complete intersections are sampled uniformly…

We show that the number of maximal paths in directed last-passage percolation on the hypercubic lattice ${\mathbb Z}^d$ $(d\geq2)$ in which weights take finitely many values is typically exponentially large.

In this paper, we introduce reduced-bias estimators for the estimation of the tail index of a Pareto-type distribution. This is achieved through the use of a regularised weighted least squares with an exponential regression model for…

An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…

We consider the limiting fluctuations of the geodesic in the directed landscape, conditioning on its length going to infinity. It was shown in \cite{Liu22b,Ganguly-Hegde-Zhang23} that when the directed landscape $\mathcal{L}(0,0;0,1) = L$…

We are interested in embedding trees T with maximum degree at most four in a rectangular grid, such that the vertices of T correspond to grid points, while edges of T correspond to non-intersecting straight segments of the grid lines. Such…

Let $G$ be a directed graph associated with a weight $w: E(G) \rightarrow R^+$. For an edge-cut $Q$ of $G$, the average weight of $Q$ is denoted and defined as $w_{ave}(Q)=\frac{\sum_{e\in Q}w(e)}{|Q|}$. An edge-cut of optimal average…

Let $G=(V(G),E(G))$ be a simple graph. A set $S \subseteq V(G)$ is a strong edge geodetic set if there exists an assignment of exactly one shortest path between each pair of vertices from $S$, such that these shortest paths cover all the…