Related papers: Asymptotic Face Distributions in Random Reduced $\…

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

We study the nodal intersections number of random Gaussian toral Laplace eigenfunctions ("arithmetic random waves") against a fixed smooth reference curve. The expected intersection number is proportional to the the square root of the…

We study the fluctuations of random surfaces on a two-dimensional discrete torus. The random surfaces we consider are defined via a nearest-neighbor pair potential which we require to be twice continuously differentiable on a (possibly…

When a flux of Brownian particles is injected in a narrow window located on the surface of a bounded domain, these particles diffuse and can eventually escape through a cluster of narrow windows. At steady-state, we compute asymptotically…

We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of…

Consider a uniformly distributed random linear subspace $L$ and a stochastically independent random affine subspace $E$ in $\mathbb{R}^n$, both of fixed dimension. For a natural class of distributions for $E$ we show that the intersection…

How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…

In the 1960's, Birch proved that the traces of Frobenius for elliptic curves taken at random over a large finite field is modeled by the semicircular distribution (i.e. the usual Sato-Tate for non-CM elliptic curves). In analogy with…

Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design. These graphs are also of purely theoretical interest within…

We first rephrase and unify known bijections between bipartite plane maps and labelled trees with the formalism of looptrees, which we argue to be both more relevant and technically simpler since the geometry of a looptree is explicitly…

We discuss the asymptotic behaviour of random critical Boltzmann planar maps in which the degree of a typical face belongs to the domain of attraction of a stable law with index $\alpha \in (1,2]$. We prove that when conditioning such maps…

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…

Consider an $n\times k$ matrix of i.i.d. Bernoulli random numbers with $p=1/2$. Dual RSK algorithm gives a bijection of this matrix to a pair of Young tableaux of conjugate shape, which is manifestation of skew Howe $GL_{n}\times…

The complexity of distributed edge coloring depends heavily on the palette size as a function of the maximum degree $\Delta$. In this paper we explore the complexity of edge coloring in the LOCAL model in different palette size regimes. 1.…

We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…

We investigate a network model based on an infinite regular square lattice embedded in the Euclidean plane where the node connection probability is given by the geometrical distance of nodes. We show that the degree distribution in the…

A very popular class of models for networks posits that each node is represented by a point in a continuous latent space, and that the probability of an edge between nodes is a decreasing function of the distance between them in this latent…

We study spatial embeddings of random graphs in which nodes are randomly distributed in geographical space. We let the edge probability between any two nodes to be dependent on the spatial distance between them and demonstrate that this…

We study the matrix discrepancy problem in the average-case setting. Given a sequence of $m \times m$ symmetric matrices $A_1,\ldots,A_n$, its discrepancy is defined as the minimal spectral norm over all signed sums $\sum_{i=1}^n x_iA_i$…

Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…