Related papers: Two particles on a star graph I
Hypergraphs capture the higher-order interactions in complex systems and always admit a factor graph representation, consisting of a bipartite network of nodes and hyperedges. As hypegraphs are ubiquitous, investigating hypergraph…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
Polynomial algorithms are given for the following two problems: given a graph with $n$ vertices and $m$ edges, where $m \ge 3 n^{3/2}$, find a complete balanced bipartite subgraph with parts about $\ln n/(\ln (n^2/m))$, given a graph with…
Refining a basic result of Alexander, we show that two flag simplicial complexes are piecewise linearly homeomorphic if and only if they can be connected by a sequence of flag complexes, each obtained from the previous one by either an edge…
We propose that stable boson stars generically fall within an infinite-parameter family of solutions that oscillate on any number of non-commensurate frequencies. We numerically construct two-frequency solutions and explore their parameter…
Classical MD data on the charge-charge dynamic structure factor of two-component plasmas (TCP) modeled in Phys. Rev. A 23, 2041 (1981) are analyzed using the sum rules and other exact relations. The convergent power moments of the imaginary…
Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…
The two-particle problem within a nonequilibrium many-particle system is investigated in the framework of real-time Green's functions. Starting from the dynamically screened ladder approximation of the nonequlibrium Bethe-Salpeter equation,…
The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…
Delta-matroid theory is often thought of as a generalization of topological graph theory. It is well-known that an orientable embedded graph is bipartite if and only if its Petrie dual is orientable. In this paper, we first introduce the…
We show that for a system of two entangled particles, there is a dual description to the particle equations in terms of classical theory of conformally stretched spacetime. We also connect these entangled particle equations with Finsler…
An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…
We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1-Laplacian ?$\Delta_1$. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the…
Let $\Gamma$ be a finite graph and let $\Gamma^{\mathrm{e}}$ be its extension graph. We inductively define a sequence $\{\Gamma_i\}$ of finite induced subgraphs of $\Gamma^{\mathrm{e}}$ through successive applications of an operation called…
Let $m_GI$ denote the number of Laplacian eigenvalues of a graph $G$ in an interval $I$ and let $\alpha(G)$ denote the independence number of $G$. In this paper, we determine the classes of graphs that satisfy the condition…
The system of equations of electromagnetic self-consistency in a plasma is analytically solved for the case of a two-component homogeneous plasma in the non-relativistic approximation.
A spherical conical metric $g$ on a surface $\Sigma$ is a metric of constant curvature $1$ with finitely many isolated conical singularities. The uniformization problem for such metrics remains largely open when at least one of the cone…
This paper concerns the long term behaviour of a growth model describing a random sequential deposition of particles on a finite graph. The probability of allocating a particle at a vertex is proportional to a log-linear function of numbers…
In this paper we study two classes of graphs, the (m,k)-stars and l-dependent graphs, investigating the relation between spectrum characteristics and graph structure: conditions on the topology and edge weights are given in order to get…
The purpose of this paper is to introduce a model to study structures which are widely present in public transportation networks. We show that, through hypergraphs, one can describe these structures and investigate the relation between…