Searcharxiv⌕ Search

arXiv subjects

Octavio Arizmendi

Publications and source records attributed to Octavio Arizmendi.

At least 37 records · Page 2Linked to original sources
arXiv2022

Quantitative Estimates for Operator-Valued and Infinitesimal Boolean and Monotone Limit Theorems

We provide Berry-Esseen bounds for sums of operator-valued Boolean and monotone independent variables, in terms of the first moments of the summands. Our bounds are on the level of Cauchy transforms as well as the Lévy distance. As applications, we obtain quantitative bounds for the corresponding CLTs, provide a quantitative "fourth moment theorem" for monotone independent random variables including the operator-valued case, and generalize the results by Hao and Popa on matrices with Boolean entries. Our approach relies on a Lindeberg method that we develop for sums of Boolean/monotone independent random variables. Furthermore, we push this approach to the infinitesimal setting to obtain the first quantitative estimates for the operator-valued infinitesimal free, Boolean and monotone CLT.

math.PR↗
arXiv2022

Convergence Rate for The Number of Crossing in a Random Labelled Tree

We consider the number of crossings in a random labelled tree with vertices in convex position. We give a new proof of the fact that this quantity is asymptotically Gaussian with mean $n^2/6$ and variance $n^3/45$. Furthermore, we give an estimate for the Kolmogorov distance to a Gaussian distribution which implies a convergence rate of order $n^{-1/2}$.

math.PR↗
arXiv2022

Cyclic independence: Boolean and monotone

The present paper introduces a modified version of cyclic-monotone independence which originally arose in the context of random matrices, and also introduces its natural analogy called cyclic-Boolean independence. We investigate formulas for convolutions, limit theorems for sums of independent random variables, and also classify infinitely divisible distributions with respect to cyclic-Boolean convolution. Finally, we provide applications to the eigenvalues of the adjacency matrices of iterated star products of graphs and also iterated comb products of graphs.

math.PR↗
arXiv2022

Crossings in Randomly Embedded Graphs

We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various families of graphs, including random chord diagrams or full cycles.

math.CO↗
arXiv2022

On the $p$-Schatten Energy of Bipartite Graphs

We give a Coulson integral formula and a Coulson-Jacobs formula for the $p$-Schatten energy. We use this formulas to compare the $p$-Schatten energy of different trees by using a quasiorder, and establish the maximality of paths among all trees.

math.SP↗
arXiv2022

Universality of free random variables: atoms for non-commutative rational functions

Consider a tuple $(Y_1,\dots,Y_d)$ of normal operators in a tracial operator algebra setting with prescribed sizes of the eigenspaces for each $Y_i$. We address the question what one can say about the sizes of the eigenspaces for any non-commutative polynomial $P(Y_1,\dots,Y_d)$ in those operators? We show that for each polynomial $P$ there are unavoidable eigenspaces, which occur in $P(Y_1,\dots,Y_d)$ for any $(Y_1,\dots,Y_d)$ with the prescribed eigenspaces for the marginals. We will describe this minimal situation both in algebraic terms - where it is given by realizations via matrices over the free skew field and via rank calculations - and in analytic terms - where it is given by freely independent random variables with prescribed atoms in their distributions. The fact that the latter situation corresponds to this minimal situation allows to draw many new conclusions about atoms in polynomials of free variables. In particular, we give a complete description of atoms in the free commutator and the free anti-commutator. Furthermore, our results do not only apply to polynomials, but much more general also to non-commutative rational functions. Since many random matrix models become asymptotically free in the large $N$ limit, our results allow us to calculate the location and size of atoms in the asymptotic eigenvalue distribution of polynomials and rational functions in randomly rotated matrices.

math.OA↗
arXiv2021

Energy and Randic index of directed graphs

The concept of Randic index has been extended recently for a digraph. We prove that $2R(G)\leq \mathcal{E}(G)\leq 2\sqrt{Δ(G)} R(G)$, where $G$ is a digraph, and $R(G)$ denotes the Randic index, $\mathcal{E}(G)$ denotes the Nikiforov energy and $Δ(G) $ denotes the maximum degree of $G$. In both inequalities we describe the graphs for which the equality holds.

math.SP↗
arXiv2021

The graph energy game

We study the graph energy from a cooperative game viewpoint. We introduce \emph{the graph energy game} and show various properties. In particular, we see that it is a superadditive game and that the energy of a vertex, as defined in Arizmendi and Juarez-Romero (2018), belongs to the core of the game. These properties imply new bounds for the energy of graphs. We also consider a version based on $p$-Schatten norms.

math.SP↗
arXiv2021

Graphs of Maximal Energy with Fixed Maximal Degree

We give a bound for the graph energy with given maximal degree in terms of the second and fourth moments of a graph. In the case in which the graph is $d$-regular we obtain the bound that is given in Van Dam, E. et al. (2014). through elementary methods.

math.CO↗
arXiv2020

Energy of a graph and Randic index

We prove that, for any graph $G$, its graph energy is at least twice the Randic index. We show that equality holds if and only if $G$ is the union of complete bipartite graphs.

math.CO↗
arXiv2020

The Cyclic Group and the Transpose of an R-cyclic matrix

We show that using the cyclic group the transpose of an R-cyclic matrix can be decomposed along diagonal parts into a sum of parts which are freely independent over diagonal scalar matrices. Moreover, if the R-cyclic matrix is self-adjoint then the off-diagonal parts are R-diagonal.

math.OA↗
arXiv2019

Conditionally Free Reduced Products of Hilbert Spaces

We present a product of pairs of pointed Hilbert spaces that, in the context of Bozėjko, Leinert and Speicher's theory of conditionally free probability, plays the role of the reduced free product of pointed Hilbert spaces, and thus gives a unified construction for the natural notions of independence defined by Muraki. We additionally provide important applications of this construction. We prove that, assuming minor restrictions, for any pair of conditionally free algebras there are copies of them that are conditionally free and also free, a property that is frequently assumed (as hypothesis) to prove several results in the literature. Finally, we give a short proof of the linearization property of the $^cR$-transform (the analog of Voiculescu's $R$-transform in the context of conditionally free probability).

math.OA↗
arXiv2018

Berry-Esseen type estimate and return sequence for parabolic iteration in the upper half-plane

Two different aspects of parabolic iteration in the complex upper half-plane are considered here. First, from a noncommutative probability perspective, a Berry-Esseen type estimate for the convergence speed of the monotone central limit theorem is proved. Secondly, if the underlying measure in this central limit process is singular to the Lebesgue measure on the real line, then the iteration is shown to be an infinite-measure preserving dynamical system that has a regularly varying return sequence of index 1/2.

math.FA↗
arXiv2018

Coulson Integral Formula for the Vertex Energy of a Graph

In this note we prove that the vertex energy of a graph, as defined in Arizmendi and Juarez (2018), can be calculated in terms of a Coulson integral formula. We present examples of how this formula can be used, and we show some applications to bipartite graphs.

math.SP↗