相关论文: Asymptotic Face Distributions in Random Reduced $\…
In this paper we establish links between, and new results for, three problems that are not usually considered together. The first is a matrix decomposition problem that arises in areas such as statistical modeling and signal processing:…
We study stochastic graph optimization problems in a novel distributed setting. As in the standard centralized setting, a random subgraph $G^*$ of a known base graph $G$ is realized by including each edge $e$ independently with a known…
The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…
This paper studies how close random graphs are typically to their expectations. We interpret this question through the concentration of the adjacency and Laplacian matrices in the spectral norm. We study inhomogeneous Erd\"os-R\'enyi random…
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…
Let $Z$ be the typical cell of a stationary Poisson hyperplane tessellation in $\mathbb{R}^d$. The distribution of the number of facets $f(Z)$ of the typical cell is investigated. It is shown, that under a well-spread condition on the…
A general topic of current interest is the analysis of diffusion problems in singularly perturbed domains with small interior targets or traps (the narrow capture problem). One major application is to intracellular diffusion, where the…
The Thorup-Zwick (TZ) routing scheme is the first generic stretch-3 routing scheme delivering a nearly optimal local memory upper bound. Using both direct analysis and simulation, we calculate the stretch distribution of this routing scheme…
The focus of this work is the asymptotic analysis of the tail distribution of Google's PageRank algorithm on large scale-free directed networks. In particular, the main theorem provides the convergence, in the Kantorovich-Rubinstein metric,…
We investigate an inverse scattering problem for a thin inhomogeneous scatterer in R^m, m = 2,3, which we model as a m-1 dimensional open surface. The scatterer is referred to as a screen. The goal is to design target signatures that are…
We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…
The present work describes the asymptotic local shape of a graph drawn uniformly at random from all connected simple planar graphs with n labelled vertices. We establish a novel uniform infinite planar graph (UIPG) as quenched limit in the…
Surface photometry from 16 HST/WFPC2 fields in the I(F814W) filter is used to derive the distribution of apparent axis ratios for galaxies in progressively fainter magnitude intervals for I<25. We assess the systematic and accidental errors…
We asymptotically estimate the variance of the number of lattice points in a thin, randomly rotated annulus lying on the surface of the sphere. This partially resolves a conjecture of Bourgain, Rudnick, and Sarnak. We also obtain estimates…
We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…
This paper is a continuation and an extension of our recent work [3] on the geometric structures of Laplacian eigenfunctions and their applications to inverse scattering problems. In [3], the analytic behaviour of the Laplacian…
Small diameter asymptotics is obtained for scattering solutions in a network of thin fibers. The asymptotics is expressed in terms of solutions of related problems on the limiting quantum graph. We calculate the Lagrangian gluing conditions…
We give an expression for the frequency of non-simple curves in closed surfaces and exploit it to study relative frequencies of such curves in large genus. This extend to the case of non-simple curves Mirzakhani's expressions of frequencies…
Fix $d \ge 3$. We show the existence of a constant $c>0$ such that any graph of diameter at most $d$ has average distance at most $d-c \frac{d^{3/2}}{\sqrt n}$, where $n$ is the number of vertices. Moreover, we exhibit graphs certifying…
For the class of differentiable maps of the plane and, in particular, for standard-like maps (McMillan form), a simple relation is shown between the directions of the local invariant manifolds of a generic point and its contribution to the…