Zobrazeno 1 - 10
of 3 939
pro vyhledávání: '"Arizmendi A."'
Autor:
Cloonan, Aidan P., Khullar, Gourav, Napier, Kate A., Gladders, Michael D., Dahle, Håkon, Rosener, Riley, Sullivan Jr., Jamar, Bayliss, Matthew B., Chicoine, Nathalie, Escapa, Isaiah, Garza, Diego, Garza, Josh, Glusman, Rowen, Gozman, Katya, Horwath, Gabriela, Kisare, Andi, Levine, Benjamin C., Liang, Olina, Malagon, Natalie, Martinez, Michael N., Masegian, Alexandra, Acuña, Owen S. Matthews, Mork, Simon D., Niu, Kunwanhui, Owens, M. Riley, Pan, Yue, Rigby, Jane R., Sharon, Keren, Sierra, Isaac, Stark, Antony A., Sukay, Ezra, Tamargo-Arizmendi, Marcos, Tavangar, Kiyan, Teixeira, Raul, Tsiane, Kabelo, Wagner, Grace, Zaborowski, Erik A., Zhang, Yunchong, Zhao, Megan
Wide-separation lensed quasars (WSLQs) are a rare class of strongly lensed quasars, magnified by foreground massive galaxy clusters, with typically large magnifications of the multiple quasar images. They are a relatively unexplored opportunity for d
Externí odkaz:
http://arxiv.org/abs/2408.03379
In order to explain the mass hierarchy and mixing pattern in the leptonic sector, we explore an extension of the Standard Model whose scalar sector includes one active and two inert doublets as well as some scalar singlets. The model includes a $S_3$
Externí odkaz:
http://arxiv.org/abs/2408.01497
Autor:
Arizmendi, Gerardo, Huerta, Diego
We give a new inequality between the energy of a graph and a weighted sum over the edges of the graph. Using this inequality we prove that $\mathcal{E}(G)\geq 2R(H)$, where $ \mathcal{E}(G)$ is the energy of a graph $G$ and $R(H)$ is the Randi\'c ind
Externí odkaz:
http://arxiv.org/abs/2406.03561
Autor:
Arizmendi, Octavio, Sigarreta, Saylé
In this manuscript we study how the vertex energy of a tree is affected when joined with a bipartite graph. We find an alternating pattern with respect to the coalescence vertex: the energy decreases for vertices located at odd distances and increase
Externí odkaz:
http://arxiv.org/abs/2402.03225
Autor:
Mork, Simon D., Gladders, Michael D., Khullar, Gourav, Sharon, Keren, Chicoine, Nathalie, Cloonan, Aidan P., Dahle, Håkon, Garza, Diego, Glusman, Rowen, Gozman, Katya, Horwath, Gabriela, Levine, Benjamin C., Liang, Olina, Mahronic, Daniel, Manwadkar, Viraj, Martinez, Michael N., Masegian, Alexandra, Acuña, Owen S. Matthews, Merz, Kaiya, Pan, Yue, Sanchez, Jorge A., Sierra, Isaac, Stein, Daniel J. Kavin, Sukay, Ezra, Tamargo-Arizmendi, Marcos, Tavangar, Kiyan, Tu, Ruoyang, Wagner, Grace, Zaborowski, Erik A., Zhang, Yunchong
We compute parametric measurements of the Einstein-radius-enclosed total mass for 177 cluster-scale strong gravitational lenses identified by the ChicagO Optically-selected Lenses Located At the Margins of Public Surveys (COOL-LAMPS) collaboration wi
Externí odkaz:
http://arxiv.org/abs/2401.08575
We develop the relevant combinatorics pertaining to cyclic-conditional freeness in order to introduce the adequate sets of cumulants linearizing the cyclic-conditional additive convolution. On our way, we introduce a new non-commutative independence,
Externí odkaz:
http://arxiv.org/abs/2311.13178
Autor:
Arizmendi, Octavio, Perales, Daniel
Publikováno v:
XIII Symposium on Probability and Stochastic Processes: UNAM, Mexico, December 4-8, 2017
We prove that the rate of convergence for the central limit theorem in finite free convolution is of order $n^{1/2}$
Comment: 8 pages, published in 2017
Comment: 8 pages, published in 2017
Externí odkaz:
http://arxiv.org/abs/2310.15485
Let $\mu$ and $\nu$ be probability measures on $\mathbb{R}$ with compact support, and let $\mu \boxplus \nu$ denote their additive free convolution. We show that for $z \in \mathbb{R}$ greater than the sum of essential suprema of $\mu$ and $\nu$, we
Externí odkaz:
http://arxiv.org/abs/2309.12196
We introduce the notion of BMT independence, allowing us to take arbitrary mixtures of boolean, monotone, and tensor independence and generalizing the notion of BM independence of Wysoczanski. Pair-wise independence relations are encoded through a di
Externí odkaz:
http://arxiv.org/abs/2309.04123
We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$. Using Stein's
Externí odkaz:
http://arxiv.org/abs/2308.11570