相关论文: Traveling Waves, Front Selection, and Exact Nontri…

We study extreme value statistics of multiple sequences of random variables. For each sequence with N variables, independently drawn from the same distribution, the running maximum is defined as the largest variable to date. We compare the…

We study the extreme value statistics of a run and tumble particle (RTP) in one dimension till its first passage to the origin starting from the position $x_0~(>0)$. This model has recently drawn a lot of interest due to its biological…

This paper determines values of intersection exponents between packs of planar Brownian motions in the half-plane and in the plane that were not derived in our first two papers. For instance, it is proven that the exponent $\xi (3,3)$…

In the classic Minimum Bisection problem we are given as input a graph $G$ and an integer $k$. The task is to determine whether there is a partition of $V(G)$ into two parts $A$ and $B$ such that $||A|-|B|| \leq 1$ and there are at most $k$…

Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…

We study arithmetic progressions $\{a,a+b,a+2b,\dots,a+(\ell-1) b\}$, with $\ell\ge 3$, in random subsets of the initial segment of natural numbers $[n]:=\{1,2,\dots, n\}$. Given $p\in[0,1]$ we denote by $[n]_p$ the random subset of $[n]$…

We investigate the \emph{last passage percolation} problem on transitive tournaments, in the case when the edge weights are independent Bernoulli random variables. Given a transitive tournament on $n$ nodes with random weights on its edges,…

We investigate the probability for the largest segment in with total displacement $Q$ in an $N$-step random walk to have length $L$. Using analytical, exact enumeration, and Monte Carlo methods, we reveal the complex structure of the…

We consider partitions of a point set into two parts, and the lengths of the minimum spanning trees of the original set and of the two parts. If $w(P)$ denotes the length of a minimum spanning tree of $P$, we show that every set $P$ of $n…

We present a first numerical investigation of the accuracy of the recently proposed {\em non-classical transport equation}. This equation contains an extra independent variable (the path-length $s$), and models particle transport taking…

In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^\chi$, while the transversal fluctuations, known as…

This work concerns the asymptotic analysis of high-frequency wave propagation in randomly layered media with fast variations and long-range correlations. The analysis takes place in the 3D physical space and weak-coupling regime. The role…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…

In a prior work, the authors proved a global bifurcation theorem for spatially periodic interfacial hydroelastic traveling waves on infinite depth, and computed such traveling waves. The formulation of the traveling wave problem used both…

The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \to c$ in probability (for some explicit $c>0$). For so-called subcritical…

Given a sequence \xi_1, \xi_2,... of X-valued, exchangeable random elements, let q(\xi^(n)) and p_m(\xi^(n)) stand for posterior and predictive distribution, respectively, given \xi^(n) = (\xi_1,..., \xi_n). We provide an upper bound for…

We shift the perspective on the interval fragmentation problem from division points to division spacings. This leads to a proof that is both simpler and stronger, establishing limiting distributions for partition points and spacings and,…

Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. We are interested in giving…

We develop a novel computational method for evaluating the extreme excursion probabilities arising from random initialization of nonlinear dynamical systems. The method uses excursion probability theory to formulate a sequence of Bayesian…

We consider an evolution equation of parabolic type in R having a travelling wave solution. We perform an appropriate change of variables which transforms the equation into a non local evolution one having a travelling wave solution with…