Related papers: Sorting networks, staircase Young tableaux and las…
The experiments conducted by various scientific groups indicate that, in dense two-dimensional systems of elongated particles subjected to vibration, the pattern formation is possible. Computer simulations have evidenced that the random…
This paper studies probability distributions of penultimate activations of classification networks. We show that, when a classification network is trained with the cross-entropy loss, its final classification layer forms a…
We review old and new uses of exchangeability, emphasizing the general theme of exchangeable representations of complex random structures. Illustrations of this theme include processes of stochastic coalescence and fragmentation; continuum…
Network topologies can be non-trivial, due to the complex underlying behaviors that form them. While past research has shown that some processes on networks may be characterized by low-order statistics describing nodes and their neighbors,…
The paper is divided in to two parts. In the first part we present some new results for the \textit{routing via matching} model introduced by Alon et al\cite{5}. This model can be viewed as a communication scheme on a distributed network.…
We show that classical integrable models of last passage percolation and the related nonintersecting random walks converge uniformly on compact sets to the Airy line ensemble. Our core approach is to show convergence of nonintersecting…
We revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some "combinatorial coalescent processes": a time reversal of a fragmentation of Cayley…
We examine sorting algorithms for $n$ elements whose basic operation is comparing $t$ elements simultaneously (a $t$-comparator). We focus on algorithms that use only a single round or two rounds -- comparisons performed in the second round…
Using a probabilistic approach, we derive some interesting combinatorial identities involving gamma and beta functions. These results generalize certain well-known combinatorial identities involving binomial coefficients and special…
We consider a last progeny modified branching random walk, in which the position of each particle at the last generation $n$ is modified by an i.i.d. copy of a random variable $Y$. Depending on the asymptotic properties of the tail of $Y$,…
An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that…
Information percolation is a new method for analyzing stochastic spin systems through classifying and controlling the clusters of information-flow in the space-time slab. It yielded sharp mixing estimates (cutoff with an $O(1)$-window) for…
We survey recent results on determinantal processes, random growth, random tilings and their relation to random matrix theory.
Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and leads to many links with permutation patterns. We present…
Construct a random set by independently selecting each finite subset of the integers with some probability depending on the set up to translations and taking the union of the selected sets. We show that when the only sets selected with…
For the last passage percolation (LPP) on $\mathbb{Z}^2$ with exponential passage times, let $T_{n}$ denote the passage time from $(1,1)$ to $(n,n)$. We investigate the law of iterated logarithm of the sequence $\{T_{n}\}_{n\geq 1}$; we…
We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that, at criticality, the finite third moment assumption on the…
The 1+1 dimensional directed polymers in a Poissonean random environment is studied. For two polymers of maximal length with the same origin and distinct end points we establish that the point of last branching is governed by the exponent…
The spectral gap theorem of Caputo, Liggett, and Richthammer states that on any connected graph equipped with edge weights, the 2nd eigenvalue of the interchange process equals the 2nd eigenvalue of the random walk process. In this work we…
We investigate two closely related setups. In the first one we consider a TASEP-style system of particles with specified initial and final configurations. The probability of each history of the system is assumed to be equal. We show that…