Related papers: Dependence between External Path-Length and Size i…
We study vectors chosen at random from a compact convex polytope in $\mathbb{R}^n$ given by a finite number of linear constraints. We determine which projections of these random vectors are asymptotically normal as $n\to\infty$. Marginal…
Conditioned limit laws constitute an important and well developed framework of extreme value theory that describe a broad range of extremal dependence forms including asymptotic independence. We explore the assumption of conditional…
We explore the probability that a permutation sampled from the symmetric group of order n uniformly at random has cycles of lengths not exceeding r. Asymptotic formulas valid in specified regions for the ratio n/r are obtained using the…
Analytic solution for the average path length in a large class of random graphs is found. We apply the approach to classical random graphs of Erd\"{o}s and R\'{e}nyi (ER) and to scale-free networks of Barab\'{a}si and Albert (BA). In both…
We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We…
We report numerical simulations of a strongly biased diffusion process on a one-dimensional substrate with directed shortcuts between randomly chosen sites, i.e. with a small-world-like structure. We find that, unlike many other dynamical…
We consider the limiting behavior of fluctuations of small noise diffusions with multiple scales around their homogenized deterministic limit. We allow full dependence of the coefficients on the slow and fast motion. These processes arise…
We consider a self-similar fragmentation process in which the generic particle of size $x$ is replaced at probability rate $x^\alpha$, by its offspring made of smaller particles, where $\alpha$ is some positive parameter. The total of…
In this paper we study typical distances in the configuration model, when the degrees have asymptotically infinite variance. We assume that the empirical degree distribution follows a power law with exponent $\tau\in (2,3)$, up to value…
We study the correlation between the nodal length of random spherical harmonics and the measure of the boundary for excursion sets at any non-zero level. We show that the correlation is asymptotically zero, while the partial correlation…
We study the Laplacian-infinity path as an extreme case of the Laplacian-alpha random walk. Although, in the finite alpha case, there is reason to believe that the process converges to SLE, we show that this is not the case when alpha is…
We study random Peano paths on planar square grids that arise from fair random spanning trees. These are trees that are sampled in such a way as to have the same (if possible) edge probabilities. In particular, we are interested in…
We analyze about two hundred naturally occurring networks with distinct dynamical origins to formally test whether the commonly assumed hypothesis of an underlying scale-free structure is generally viable. This has recently been questioned…
We examine isotropic and anisotropic random walks which begin on the surface of linear ($N$), square ($N \times N$), or cubic ($N \times N \times N$) lattices and end upon encountering the surface again. The mean length of walks is equal to…
We first establish new local limit estimates for the probability that a nondecreasing integer-valued random walk lies at time $n$ at an arbitrary value, encompassing in particular large deviation regimes. This enables us to derive scaling…
We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…
We consider the limit behavior of a one-dimensional random walk with unit jumps whose transition probabilities are modified every time the walk hits zero. The invariance principle is proved in the scheme of series where the size of…
This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…
Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free…
We investigate fragmentation processes with a steady input of fragments. We find that the size distribution approaches a stationary form which exhibits a power law divergence in the small size limit, P(x) ~ x^{-3}. This algebraic behavior…