相关论文: How fast planar maps get swallowed by a peeling pr…
The paper studies properties of continuous time processes with spectrum degeneracy at a single point where their Fourier transforms vanish with a certain rate. It appears that these processes are linearly predictable in some weak sense,…
We consider a modified random walk which uses unvisited edges whenever possible, and makes a simple random walk otherwise. We call such a walk an edge-process. We assume there is a rule A, which tells the walk which unvisited edge to use…
We study how iterated and composed completely positive maps act on operator-valued kernels. Each kernel is realized inside a single Hilbert space where composition corresponds to applying bounded creation operators to feature vectors. This…
On hypothesis of self-scaling co-flows in tapered rectanglar PMMA micro-channels for producing mono-dispersed liquid cells, universal scalings through all liquid detaching regimes are found under a self-similarity frame. Pan-dripping and…
Kernel approximation via nonlinear random feature maps is widely used in speeding up kernel machines. There are two main challenges for the conventional kernel approximation methods. First, before performing kernel approximation, a good…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…
The design and development of a parallel plate shear cell for the study of large scale shear flows in granular materials is presented. The parallel plate geometry allows for shear studies without the effects of curvature found in the more…
This paper introduces a new technique for learning probabilistic models of mass and friction distributions of unknown objects, and performing robust sliding actions by using the learned models. The proposed method is executed in two…
Plant differently colored points in the plane, then let random points ("Poisson rain") fall, and give each new point the color of the nearest existing point. Previous investigation and simulations strongly suggest that the colored regions…
Conductance-based graph clustering has been recognized as a fundamental operator in numerous graph analysis applications. Despite the significant success of conductance-based graph clustering, existing algorithms are either hard to obtain…
We present an iterative scheme designed to recover calibrated I, Q, and U maps from Planck-HFI data using the orbital dipole due to the satellite motion with respect to the Solar System frame. It combines a map reconstruction, based on a…
We consider the maximum coding rate achievable by uniformly-random codes for the deletion channel. We prove an upper bound that's within 0.1 of the best known lower bounds for all values of the deletion probability $d,$ and much closer for…
Random walks on lattices with preferential relocation to previously visited sites provide a simple framework for modeling the displacements of animals and humans. When the lattice contains a few impurities or resource sites where the walker…
A prominent tool in many problems involving metric spaces is a notion of randomized low-diameter decomposition. Loosely speaking, $\beta$-decomposition refers to a probability distribution over partitions of the metric into sets of low…
In this paper we study the probability that a $d$ dimensional simple random walk (or the first $L$ steps of it) covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball. We show that among all such paths,…
We consider the kinetics of the imperfect narrow escape problem, i.e. the time it takes for a particle diffusing in a confined medium of generic shape to reach and to be adsorbed by a small, imperfectly reactive patch embedded in the…
Consider the random set composed of particles initially distributed on Zd, d >= 2, according to a Poisson point process of intensity u > 0 and moving as independent simple symmetric random walks, the trap particles. We are interested in the…
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest $k$ such that the graph is $k$-splittable into a planar graph. A $k$-split operation…
We consider planar maps adjusted with a (regular critical) Boltzmann distribution and show that the expected number of pattern occurrences of a given map is asymptotically linear when the number n of edges goes to infinity. The main…