English
Related papers

Related papers: Two particles on a star graph I

200 papers

Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…

Statistical Mechanics · Physics 2015-06-24 R. Burioni , D. Cassi , C. Destri

A \emph{proportionally dense subgraph} (PDS) is an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the subgraph as in the rest of the graph. In this paper, we study…

Discrete Mathematics · Computer Science 2025-01-15 Cristina Bazgan , Janka Chlebíková , Clément Dallard

Exact solutions of interacting random walk models, such as 1D lattice gases, offer precise insight into the origin of nonequilibrium phenomena. Here, we study a model of run-and-tumble particles on a ring lattice interacting via hardcore…

Statistical Mechanics · Physics 2019-02-21 Emil Mallmin , Richard A Blythe , Martin R Evans

The derived graph of a voltage graph consisting of a single vertex and two loops of different voltages is a circulant graph with two generators. We characterize the automorphism groups of connected, two-generator circulant graphs, and give…

Combinatorics · Mathematics 2024-08-08 Sally Cockburn , Sarah Loeb

This note is on the structures of line graphs and 2-variegated graphs. We have given here solutions of some graph equations involving line graphs and 2-variegated graphs.

Combinatorics · Mathematics 2025-08-08 Ranjan N. Naik

The parameter $\sigma(G)$ of a graph $G$ stands for the number of Laplacian eigenvalues greater than or equal to the average degree of $G$. In this work, we address the problem of characterizing those graphs $G$ having $\sigma(G)=1$. Our…

A nonrelativistic equation for the system of two interacting particles within the framework of a model with noncommuting operators of coordinates and momenta of different particles is proposed, and a self-consistent system of equations for…

Quantum Physics · Physics 2016-09-08 M. V. Kuzmenko

The distance matrix of a connected graph is defined as the matrix in which the entries are the pairwise distances between vertices. The distance spectrum of a graph is the set of eigenvalues of its distance matrix. A graph is said to be…

Combinatorics · Mathematics 2022-01-10 Anuj Sakarda , Jerry Tan , Armaan Tipirneni

We consider the problem of two interacting particles on a sphere. The potential of the interaction depends on the distance between the particles. The case of Newtonian-type potentials is studied in most detail. We reduce this system to a…

Chaotic Dynamics · Physics 2009-09-29 A. V. Borisov , I. S. Mamaev , A. A. Kilin

Given a projective plane $\Sigma$ and a polarity $\theta$ of $\Sigma$, the corresponding polarity graph is the graph whose vertices are the points of $\Sigma$, and two distinct points $p_1$ and $p_2$ are adjacent if $p_1$ is incident to…

Combinatorics · Mathematics 2016-01-20 Michael Tait , Craig Timmons

In this paper, we study the time-fractional diffusion equation on a metric star graph. The existence and uniqueness of the weak solution are investigated and the proof is based on eigenfunction expansions. Some priori estimates and…

Analysis of PDEs · Mathematics 2020-04-20 Vaibhav Mehandiratta , Mani Mehra , Gunter Leugering

In this paper we consider the conformal dynamics for a system of $N$ interacting relativistic massless particles. A detailed study is done for the case of two-particles, with a particular attention to the symmetries of the problem. In fact,…

High Energy Physics - Theory · Physics 2014-07-28 Roberto Casalbuoni , Joaquim Gomis

In this paper, we introduce a novel star partitioning problem for simple connected graphs $G=(V,E)$. The goal is to find a partition of the edges into stars that minimizes the maximum number of stars a node is contained in while…

Combinatorics · Mathematics 2024-08-15 Sarah Feldmann , Torben Schürenberg

The graph isomorphism problem is of practical importance, as well as being a theoretical curiosity in computational complexity theory in that it is not known whether it is $NP$-complete or $P$. However, for many graphs, the problem is…

Data Structures and Algorithms · Computer Science 2015-03-13 Russell K. Standish

We consider two particles interacting via a contact interaction that are constrained to a sphere, or $S^2$. We determine their spectrum to arbitrary precision and for arbitrary angular momentum. We show how the non-inertial frame leads to…

Mathematical Physics · Physics 2022-12-14 Dominic Schuh , Thomas Luu

The problem of the description of two interacting particles is considered. It is shown that it can be reduced to the description of one particle in an external static potential even in a relativistic case. The method is based on the…

High Energy Physics - Phenomenology · Physics 2014-06-24 A. B. Arbuzov , T. V. Kopylova , A. B. Zhunisbayev

The partition function of a factor graph and the partition function of the dual factor graph are related to each other by the normal factor graph duality theorem. We apply this result to the classical problem of computing the partition…

Information Theory · Computer Science 2013-07-16 Mehdi Molkaraie , Hans-Andrea Loeliger

Two-dimensional plasma crystals are characterized by a strong up-and-down asymmetry not only due to gravity but also due to the presence of plasma flow at the location of particles. We study for the first time the interaction of a…

Plasma Physics · Physics 2012-09-17 C. -R. Du , V. Nosenko , S. Zhdanov , H. M. Thomas , G. E. Morfill

We first provide a classification of the pure rotational motion of 2 particles on a sphere interacting via a repelling potential. This is achieved by providing a simple geometric equivalence between repelling particles and attracting…

Mathematical Physics · Physics 2026-03-03 Luis García-Naranjo , James Montaldi

It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each…

Combinatorics · Mathematics 2016-01-27 Chia-an Liu , Chih-wen Weng