English
Related papers

Related papers: A New Large N Expansion for General Matrix-Tensor …

200 papers

Unsupervised graph alignment finds the node correspondence between a pair of attributed graphs by only exploiting graph structure and node features. One category of recent studies first computes the node representation and then matches…

Machine Learning · Computer Science 2025-05-07 Songyang Chen , Yu Liu , Lei Zou , Zexuan Wang , Youfang Lin

We study quantum mechanical models in which the dynamical degrees of freedom are real fermionic tensors of rank five and higher. They are the non-random counterparts of the Sachdev-Ye-Kitaev (SYK) models where the Hamiltonian couples six or…

High Energy Physics - Theory · Physics 2019-10-16 Igor R. Klebanov , Preethi N. Pallegar , Fedor K. Popov

We discuss properties of QCD with variable and large $N_c$, taking into account electroweak interactions; i.e., we analyze the generalization of the standard model based on the gauge group $G={\rm SU}(N_c) \times {\rm SU(2)}_L \times {\rm…

High Energy Physics - Phenomenology · Physics 2017-08-23 Robert Shrock

Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…

Computational Geometry · Computer Science 2024-10-10 Oswin Aichholzer , Anna Brötzner , Daniel Perz , Patrick Schnider

An old open problem in graph drawing asks for the size of a universal point set, a set of points that can be used as vertices for straight-line drawings of all n-vertex planar graphs. We connect this problem to the theory of permutation…

Computational Geometry · Computer Science 2015-07-16 Michael J. Bannister , Zhanpeng Cheng , William E. Devanny , David Eppstein

Graph matching pairs corresponding nodes across two or more graphs. The problem is difficult as it is hard to capture the structural similarity across graphs, especially on large graphs. We propose to incorporate high-order information for…

Artificial Intelligence · Computer Science 2020-10-12 Hui Xu , Liyao Xiang , Youmin Le , Xiaoying Gan , Yuting Jia , Luoyi Fu , Xinbing Wang

Tensor models play an increasingly prominent role in many fields, notably in machine learning. In several applications, such as community detection, topic modeling and Gaussian mixture learning, one must estimate a low-rank signal from a…

Machine Learning · Statistics 2022-06-16 José Henrique de Morais Goulart , Romain Couillet , Pierre Comon

We show that the fluctuations of the largest eigenvalue of a real symmetric or complex Hermitian Wigner matrix of size $N$ converge to the Tracy--Widom laws at a rate $O(N^{-1/3+\omega})$, as $N$ tends to infinity. For Wigner matrices this…

Probability · Mathematics 2022-05-04 Kevin Schnelli , Yuanyuan Xu

An operation on species corresponding to the inner plethysm of their associated cycle index series is constructed. This operation, the inner plethysm of species, is generalized to n-sorted species. Polynomial maps on species are studied and…

Combinatorics · Mathematics 2009-09-25 Leopold Travis

We show that the large $n$ limit of the $O(n)$ quantum rotor model defined on a general graph has the same critical behavior as the corresponding quantum spherical model and that the critical exponents depend solely on the spectral…

Statistical Mechanics · Physics 2026-01-21 Nikita Titov , Andrea Trombettoni

In this paper we study systems of $N$ uniformly expanding coupled maps when $N$ is finite but large. We introduce self-consistent transfer operators that approximate the evolution of measures under the dynamics, and quantify this…

Dynamical Systems · Mathematics 2022-09-28 Matteo Tanzi

We prove that if an $n$-vertex graph $G$ can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then $G$ has $O(n)$ edges. Graphs that admit such…

Combinatorics · Mathematics 2016-08-31 Eyal Ackerman , Balázs Keszegh , Mate Vizer

The $N$ vertices of a quantum random graph are each a circle independently punctured at Poisson points of arrivals, with parallel connections derived through for each pair of these punctured circles by yet another independent Poisson…

Probability · Mathematics 2019-01-04 Amir Dembo , Anna Levit , Sreekar Vadlamani

General first-order methods (GFOM) are a flexible class of iterative algorithms which update a state vector by matrix-vector multiplications and entrywise nonlinearities. A long line of work has sought to understand the large-n dynamics of…

Probability · Mathematics 2026-04-14 Nicola Gorini , Chris Jones , Dmitriy Kunisky , Lucas Pesenti

It is by now well established that, by means of the integration by part identities, all the integrals occurring in the evaluation of a Feynman graph of given topology can be expressed in terms of a few independent master integrals. It is…

High Energy Physics - Theory · Physics 2022-03-02 Ettore Remiddi

We study for subgroups $G\subseteq U(N)$ partial summations of the $\theta$-expanded perturbation theory. On diagrammatic level a summation procedure is established, which in the U(N) case delivers the full star-product induced rules.…

High Energy Physics - Theory · Physics 2009-11-07 Harald Dorn , Christoph Sieg

We study generalized neutrino interactions (GNI) for several neutrino processes, including neutrinos from electron-positron collisions, neutrino-electron scattering, and neutrino deep inelastic scattering. We constrain scalar, pseudoscalar,…

High Energy Physics - Phenomenology · Physics 2021-07-20 F. J. Escrihuela , L. J. Flores , O. G. Miranda , Javier Rendón

We introduce a random interaction matrix model (RIMM) for finite-size strongly interacting fermionic systems whose single-particle dynamics is chaotic. The model is applied to Coulomb blockade quantum dots with irregular shape to describe…

Mesoscale and Nanoscale Physics · Physics 2009-10-31 Y. Alhassid , Ph. Jacquod , A. Wobst

This note is an extension of a recent work on the analytical bootstrapping of $O(N)$ models. An additonal feature of the $O(N)$ model is that the OPE contains trace and antisymmetric operators apart from the symmetric-traceless objects…

High Energy Physics - Theory · Physics 2016-07-20 Parijat Dey , Apratim Kaviraj , Kallol Sen

In this work we apply the S-matrix bootstrap maximization program to the 2d bosonic O(N) integrable model which has N species of scalar particles of mass m and no bound states. Since in previous studies theories were defined by maximizing…

High Energy Physics - Theory · Physics 2018-12-05 Yifei He , Andrew Irrgang , Martin Kruczenski