Related papers: Primitive asymptotics in $\phi^4$ vector theory
We investigate possible renormalization-group fixed points at nonzero coupling in $\phi^3$ theories in six spacetime dimensions, using beta functions calculated to the four-loop level. We analyze three theories of this type, with (a) a…
For each $N\geq 1$, let $G_N$ be a simple random graph on the set of vertices $[N]=\{1,2, ..., N\}$, which is invariant by relabeling of the vertices. The asymptotic behavior as $N$ goes to infinity of correlation functions: $$ \mathfrak…
We compute the four-loop contributions to the $\beta$-function and the anomalous dimension of the field for the $O(N)$-invariant $N$-vector model. These results are used to compute the second analytic corrections to the correlation length…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…
Recently it was shown that the scaling dimension of the operator $\phi^n$ in $\lambda(\phi^*\phi)^2$ theory may be computed semi-classically at the Wilson-Fisher fixed point in $d=4-\epsilon$, for generic values of $\lambda n$ and this was…
In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…
We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the spectral gap bound to study the structure of the…
We develop an operator approach to the evaluation of multiple integrals for multiloop Feynman massless diagrams. A commutative family of graph building operators $H_\alpha$ for ladder diagrams is constructed and investigated. The complete…
Given a directed graph, the Minimum Feedback Arc Set (FAS) problem asks for a minimum (size) set of arcs in a directed graph, which, when removed, results in an acyclic graph. In a seminal paper, Berger and Shor [1], in 1990, developed…
We consider time-dependent convection-diffusion problems with high P\'eclet number of order $\mathcal{O}(\varepsilon^{-1})$ in thin three-dimensional graph-like networks consisting of cylinders that are interconnected by small domains…
Recently it was shown that the scaling dimension of the operator $\phi^n$ in $\lambda(\bar\phi\phi)^2$ theory may be computed semiclassically at the Wilson-Fisher fixed point in $d=4-\epsilon$, for generic values of $\lambda n$, and this…
The circular $\beta$ ensemble for $\beta =1,2$ and 4 corresponds to circular orthogonal, unitary and symplectic ensemble respectively as introduced by Dyson. The statistical state of the eigenvalues is then a determinantal point process…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
For simple connected graphs with incommensurate bond lengths and with unitary symmetry we prove the Bohigas-Giannoni-Schmit conjecture in its most general form. Using supersymmetry and taking the limit of infinite graph size, we show that…
We develop a systematic perturbative expansion and compute the one-loop two-points, three-points and four-points correlation functions in a non-commutative version of the U(N) Wess-Zumino-Witten model in different regimes of the…
We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $r$ active neighbors, where $r>1$ is the activation…
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm…
We compute the tail asymptotics of the product of a beta random variable and a generalized gamma random variable which are independent and have general parameters. A special case of these asymptotics were proved and used in a recent work of…
In a digraph with $n$ vertices, a minuscule construct is a subdigraph with $m<<n$ vertices. We study the number of copies of a minuscule constructs in $k$ nearest neighbor ($k$NN) digraph of the data from a random point process in…