相关论文: Two particles on a star graph I
We investigate a discrete model consisting of self-propelled particles that obey simple interaction rules. We show that this model can self-organize and exhibit coherent localized solutions in one- and in two-dimensions.In one-dimension,…
The question of what conditions should be set at the nodes of a discrete graph for the wave equation with discrete time is investigated. The variational method for the derivation of these conditions is used. A parallel with the continuous…
We study a system of equations arising in the Chern-Simons model on finite graphs. Using the iteration scheme and the upper and lower solutions method, we get existence of solutions in the non-critical case. The critical case is dealt with…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
We study the positive, regular, radially symmetric solutions to the nonlinear biharmonic equation $\Delta^2 \phi = \phi^p$. First, we show that there exists a critical value $p_c$, depending on the space dimension, such that the solutions…
The parameter $q(G)$ of a graph $G$ is the minimum number of distinct eigenvalues of a symmetric matrix whose pattern is given by $G$. We introduce a novel graph product by which we construct new infinite families of graphs that achieve…
We determine all graphs for which the adjacency matrix has at most two eigenvalues (multiplicities included) not equal to $-2$, or $0$, and determine which of these graphs are determined by their adjacency spectrum.
A plasmon of a bounded domain $\Omega\subset\mathbb{R}^n$ is a non-trivial bounded harmonic function on $\mathbb{R}^n\setminus\partial\Omega$ which is continuous at $\partial\Omega$ and whose exterior and interior normal derivatives at…
In this paper, we continue the classification work done in the first paper of the same name. With careful modifications of our previous approach, we are able to deduce (with two notable exceptions) which members of the previously introduced…
Consider two planar graphs which are subject to edge insertions and deletions. We show that whether the two graphs are isomorphic can be maintained with first-order logic formulas and auxiliary data of polynomial size. This places the…
We consider two-particle correlations, which appear in relativistic nuclear collisions due to the quantum statistics of identical particles, in the frame of two formalisms: wave-function and current. The first one is based on solution of…
Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…
The dynamics of a particle interacting with random classical field in a two-well potential is studied by the functional integration method. The probability of particle localization in either of the wells is studied in detail. Certain…
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…
In this paper, we introduce the concepts of the plain eigenvalue, the main-plain index and the refined spectrum of graphs. We focus on the graphs with two main and two plain eigenvalues and give some characterizations of them.
In this paper, we provide a simplified stellar structure model for ideal gases, in which the particles are only driven by gravity. According to the model, the structural information of the star can be roughly solved by the total mass and…
We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is…
We establish new analytic and numerical results on a general class of rational operator Nevanlinna functions that arise e.g. in modelling photonic crystals. The capability of these dielectric nano-structured materials to control the flow of…
We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…
We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…