相关论文: Union of Random Minkowski Sums and Network Vulnera…

We consider the random reversible Markov kernel K obtained by assigning i.i.d. nonnegative weights to the edges of the complete graph over n vertices and normalizing by the corresponding row sum. The weights are assumed to be in the domain…

Every k entries in a permutation can have one of k! different relative orders, called patterns. How many times does each pattern occur in a large random permutation of size n? The distribution of this k!-dimensional vector of pattern…

The problem of adaptive noisy clustering is investigated. Given a set of noisy observations $Z_i=X_i+\epsilon_i$, $i=1,...,n$, the goal is to design clusters associated with the law of $X_i$'s, with unknown density $f$ with respect to the…

This paper offers a geometrical realisation of simple permutoassociahedra, which has significant importance serving as a topological proof of Mac Lane's coherence. We introduce a family of $n$-polytopes, $PA_{n,c}$, obtained by Minkowski…

We propose inhomogeneous random K-out graphs $\mathbb{H}(n; \pmb{\mu}, \pmb{K}_n)$, where each of the $n$ nodes is assigned to one of $r$ classes independently with a probability distribution $\pmb{\mu} = \{\mu_1, \ldots, \mu_r\}$. In…

Cyber risks are the most common risks encountered by a modern network system. However, it is significantly difficult to assess the joint cyber risk owing to the network topology, risk propagation, and heterogeneities of components. In this…

Using operator methods, we generally present the level densities for kinds of random matrix unitary ensembles in weak sense. As a corollary, the limit spectral distributions of random matrices from Gaussian, Laguerre and Jacobi unitary…

Random graphs are an important tool for modelling and analyzing the underlying properties of complex real-world networks. In this paper, we study a class of random graphs known as the inhomogeneous random K-out graphs which were recently…

In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or combining of partial solutions and filtering of dominated…

Let $\mathbb{P}_K(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $K$, a non-flat compact convex polygon in $\mathbb{R}^2$, are in convex position, that is, form the vertex set of a convex…

We show that for polytopes P_1, P_2, ..., P_r \subset \R^d, each having n_i \ge d+1 vertices, the Minkowski sum P_1 + P_2 + ... + P_r cannot achieve the maximum of \prod_i n_i vertices if r \ge d. This complements a recent result of Fukuda…

With a simple model, we study the evolution of random networks under attack and reconstruction. We introduce a new quality, invulnerability I(s), to describe the stability of the system. We find that the network can evolve to a stationary…

Generally, networks are classified into two sides of inequality and equality with respect to the number of links at nodes by the types of degree distributions. One side includes many social, technological, and biological networks which…

Let $\{f_k\}$ be a sequence of entire functions that are real valued on the real-line. We study the expected number of real zeros of random sums of the form $P_n(z)=\sum_{k=0}^n\eta_k f_k(z)$, where $\{\eta_k\}$ are real valued…

In the first part of the paper, we study the inversion statistic of random permutations under the family $(\mathbb{P}_\theta^{(n)})_{\theta \ge 0}$ of Ewens sampling distributions on $S_n$. We obtain a rather simple exact formula for the…

Research on the vulnerability of electric networks with a complex network approach has produced significant results in the last decade, especially for transmission networks. These studies have shown that there are causal relations between…

This work investigates three aspects: (a) a network vulnerability as the non-uniform vulnerable-host distribution, (b) threats, i.e., intelligent malwares that exploit such a vulnerability, and (c) defense, i.e., challenges for fighting the…

For a regular compact set $K$ in $C^m$ and a measure $\mu$ on $K$ satisfying the Bernstein-Markov inequality, we consider the ensemble $P_N$ of polynomials of degree $N$, endowed with the Gaussian probability measure induced by $L^2(\mu)$.…

How hard is it to estimate a discrete-time signal $(x_{1}, ..., x_{n}) \in \mathbb{C}^n$ satisfying an unknown linear recurrence relation of order $s$ and observed in i.i.d. complex Gaussian noise? The class of all such signals is…

Let $A^{(n)}_{l;k}\subset S_n$ denote the set of permutations of $[n]$ for which the set of $l$ consecutive numbers $\{k, k+1,\cdots, k+l-1\}$ appears in a set of consecutive positions. Under the uniformly probability measure $P_n$ on…