相关论文: Traveling Waves, Front Selection, and Exact Nontri…
The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation…
If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…
A new method for numerical solving of boundary problem for ordinary differential equations with slowly varying coefficients which is aimed at better representation of solutions in the regions of their rapid oscillations or exponential…
Resolving a conjecture of F\"uredi from 1988, we prove that with high probability, the random graph $G(n,1/2)$ admits a friendly bisection of its vertex set, i.e., a partition of its vertex set into two parts whose sizes differ by at most…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…
Variable-exponent fractional models attract increasing attentions in various applications, while the rigorous analysis is far from well developed. This work provides general tools to address these models. Specifically, we first develop a…
Many random transport phenomena, such as radiation propagation, chemical/biological species migration, or electron motion, can be described in terms of particles performing {\em exponential flights}. For such processes, we sketch a general…
Waves propagating through a weakly scattering random medium show a pronounced branching of the flow accompanied by the formation of freak waves, i.e., extremely intense waves. Theory predicts that this strong fluctuation regime is…
Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with $m$ left vertices, n right vertices, t edges, and each vertex of degree at least one. We…
We study analytically the asymptotic behaviour of the average probability P(n,t) for the trajectory of a 2D Brownian particle wandering in the presence of randomly distributed traps to wind n times around a given point after a time t. It is…
We study diffusion with a bias towards a target node in networks. This problem is relevant to efficient routing strategies in emerging communication networks like optical networks. Bias is represented by a probability $p$ of the…
We consider a particle which moves on the x axis and is subject to a constant force, such as gravity, plus a random force in the form of Gaussian white noise. We analyze the statistics of first arrival at point $x_1$ of a particle which…
We study the transport of many partially distinguishable and possibly interacting particles under the action of repeated projective measurements on a target space and investigate how the particles' interference affects the mean first…
We study the number $P(n)$ of partitions of an integer $n$ into sums of distinct squares and derive an integral representation of the function $P(n)$. Using semi-classical and quantum statistical methods, we determine its asymptotic average…
We study first passage percolation on the configuration model (CM) having power-law degrees with exponent $\tau\in [1,2)$. To this end we equip the edges with exponential weights. We derive the distributional limit of the minimal weight of…
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…
Turbulent relative dispersion is studied theoretically with a focus on the evolution of probability distribution of the relative separation of two passive particles. A finite separation speed and a finite correlation of relative velocity,…
We present a numerical method which is able to approximate traveling waves (e.g. viscous profiles) in systems with hyperbolic and parabolic parts by a direct long-time forward simulation. A difficulty with long-time simulations of traveling…
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1, and its size is the number of edges which go across the two parts. In this paper, motivated by several questions…
Let M be a compact manifold of dimension at least 2, Diff^r(M) be the space of C^r diffeomorphisms of M. Define for any diffeomorphism f in Diff^r(M) number of isolated periodic points of period n by P_n(f)=# {isolated x in M: f^n(x)=x}.…