Related papers: On Maximal Correlation, Hypercontractivity, and th…
We introduce a correlation coefficient that is designed to deal with a variety of ranking formats including those containing non-strict (i.e., with-ties) and incomplete (i.e., unknown) preferences. The correlation coefficient is designed to…
In this paper, we present two new constructions of complex codebooks with multiplicative characters, additive characters and trace functions over finite fields, and determine the maximal cross-correlation amplitude of these codebooks. We…
In random cellular systems, both observation and maximum entropy inference give a specific form to the topological pair correlation: it is bi-affine in the cells number of edges with coefficients depending on the distance between the two…
We discuss some open problems concerning the maximal spread of coherent distributions. We prove a sharp bound on $\mathbb{E}|X-Y|^{\alpha}$ for $(X,Y)$ coherent and $\alpha \le 2$, and establish a novel connection between coherent…
Graovac-Ghorbani index is a new version of the atom-bond connectivity index. D. Pacheco et al. [D. Pacheco, L. de Lima, C. S. Oliveira, On the Graovac-Ghorbani Index for Bicyclic Graph with No Pendent Vertices, MATCH Commun. Math. Comput.…
We investigate the decay rates of correlations for nonuniformly hyperbolic systems with or without singularities, on piecewise H\"older observables. By constructing a new scheme of coupling methods using the probability renewal theory, we…
In this paper, we fully characterize maximal representations of a C*-correspondence. This strengthens several earlier results. We demonstrate the criterion with diverse examples. We also describe the noncommutative Choquet boundary and…
This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
We compute the asymptotic temporal behavior of the dynamical complexity associated with the maximum probability trajectories on Gaussian statistical manifolds in presence of correlations between the variables labeling the macrostates of the…
Let $G$ be a large-girth $d$-regular graph and $\mu$ be a random process on the vertices of $G$ produced by a randomized local algorithm. We prove the upper bound $(k+1-2k/d)\Bigl(\frac{1}{\sqrt{d-1}}\Bigr)^k$ for the (absolute value of…
For Bernoulli site percolation on an infinite, connected, locally finite graph $G=(V,E)$, we obtain quantitative upper bounds on the supercritical disconnection probability \[ \mathbb{P}_p(S\nleftrightarrow\infty) \] for arbitrary finite or…
In this paper, several fundamental facts, especially the existence and uniqueness of an absolutely continuous ergodic measure with an exponential mixing rate, are derived for smooth expanding circle maps. Although the results are classical,…
The cover time of a graph is a celebrated example of a parameter that is easy to approximate using a randomized algorithm, but for which no constant factor deterministic polynomial time approximation is known. A breakthrough due to Kahn,…
Using a recently developed method to simulate percolation on large clusters of distributed machines [N. R. Moloney and G. Pruessner, Phys. Rev. E 67, 037701 (2003)], we have numerically calculated crossing, spanning and wrapping…
We study the statistics of the maximum and minimum of a set of $N$ random variables whose dynamical and statistical properties fall within the scope of infinite ergodic theory. These non-stationary yet recurrent systems are described, in…
In this note we define and study graph invariants generalizing to higher dimension the maximum degree of a vertex and the vertex-connectivity (our $0$-dimensional cases). These are known to coincide almost surely in any regime for…
In this paper, we provide relations among the following properties: (a) the tail triviality of a probability measure $\mu$ on the configuration space ${\boldsymbol\Upsilon}$; (b) the finiteness of the $L^2$-transportation-type distance…
For two unlabeled graphs $G_1,G_2$ independently sub-sampled from an Erd\H{o}s-R\'enyi graph $\mathbf G(n,p)$ by keeping each edge with probability $s$, we aim to recover \emph{as many as possible} of the corresponding vertex pairs. We…
We consider a general class of two-dimensional spin systems, with continuous but not necessarily smooth, possibly long-range, $O(N)$-symmetric interactions, for which we establish algebraically decaying upper bounds on spin-spin…