Related papers: A shape theorem for the orthant model

We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be…

We consider the random connection model in which an edge between two Poisson points at distance $r$ is present with probability $g(r)$. We conduct an extreme value analysis on this model, namely by investigating the longest edge with at…

We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\Bbb R}^d$. We present combinatorial expressions for the computation of the cumulants and…

We establish a higher dimensional counterpart of Bourgain's pointwise ergodic theorem along an arbitrary integer-valued polynomial mapping. We achieve this by proving variational estimates $V_r$ on $L^p$ spaces for all $1<p<\infty$ and…

Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…

We illustrate the theory of the radius of convergence of a connection on a p-adic curve X, by deducing from it a simple proof of a variant of Alain Robert's p-adic Rolle theorem. We need to carefully compare our global notion of radius of…

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…

The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…

Potts models, which can be used to analyze dependent observations on a lattice, have seen widespread application in a variety of areas, including statistical mechanics, neuroscience, and quantum computing. To address the intractability of…

Growing network models can potentially be a useful tool in the development of economic theory. This work introduces an "opportunistic attachment" mechanism where incoming nodes, in deciding where to join a network, consider features of the…

Let $X$ be a $d$-dimensional random vector and $X_\theta$ its projection onto the span of a set of orthonormal vectors $\{\theta_1,...,\theta_k\}$. Conditions on the distribution of $X$ are given such that if $\theta$ is chosen according to…

Finding the most powerful node in a dynamic random network, the largest set in a partition-valued stochastic process, or the largest family in an evolving population at a given time, can be a very difficult problem. This is particularly the…

We introduce topological methods for quantifying spatially heterogeneous dynamics, and use these tools to analyze particle-tracking data for a quasi-two-dimensional granular system of air-fluidized beads on approach to jamming. In…

We extend the relative theory of admissible pairs and $p$-adic Hodge structures introduced in Part II to allow variation in the underlying local systems of $\mathbb{Q}_p$-vector spaces and isocrystals. This extension accommodates, in…

We introduce the concepts of Baire Ergodicity and Ergodic Formalism, employing them to study topological and statistical attractors. Specifically, we establish the existence and finiteness of such attractors and provide applications for…

Due to the fact that the numbers of annually published papers have witnessed a linear growth in some citation networks, a geometric model is thus proposed to predict some statistical features of those networks, in which the academic…

Let $P$ be a set of $n$ points in the plane where each point $p$ of $P$ is associated with a radius $r_p>0$.The transmission graph $G=(P,E)$ of $P$ is defined as the directed graph such that $E$ contains an edge from $p$ to $q$ if and only…

We show that the shape hypothesis on a likelihood ratio can be weakened while retaining endpoint criteria for the hazard-rate and usual stochastic orders. The endpoint reduction persists under unimodality of the likelihood ratio and under a…

Suppose that $d \geq 2$, and that $A \subset [0,1]$ has sufficiently large dimension, $1 - \epsilon_d < \dim_H(A) < 1$. Then for any polynomial $P$ of degree $d$ with no constant term, there exists a point configuration $\{ x, x-t,x-P(t) \}…

Let f be a self-map of a compact manifold M, admitting an global SRB measure \mu. For a continuous test function \phi on M and a constant \alpha>0, consider the set of the initial points for which the Birkhoff time averages of the function…