# Quantum graph as a quantum spectral filter

## Related Articles

- The maximum degree of random planar graphs. Drmota, M.; Giménez, O.; Noy, M.; Panagiotou, K.; Steger, A. // Proceedings of the London Mathematical Society;Oct2014, Vol. 109 Issue 4, p892
McDiarmid and Reed [â€˜On the maximum degree of a random planar graphâ€™, Combin. Probab. Comput. 17 (2008) 591â€“601] showed that the maximum degree $\Delta _n$ of a random labeled planar graph with $n$ vertices satisfies with high probability (w.h.p.)\[c_1 \log n <\Delta _n

- Security of scale-free networks. Gała̧zka, M.; Szymański, J. // Journal of Mathematical Sciences;Apr2012, Vol. 182 Issue 2, p200
An important property of a scale-free network which allows one to communicate between its nodes is the connectivity. From the simulation results it is known that such networks are resistant to random damage. It is also known from experiments that usually disconnecting such a graph is obtained by...

- BOUNDING BASIC CHARACTERISTICS OF SPATIAL EPIDEMICS WITH A NEW PERCOLATION MODEL. MEESTER, RONALD; TRAPMAN, PIETER // Advances in Applied Probability;Jun2011, Vol. 43 Issue 2, p335
We introduce a new 1-dependent percolation model to describe and analyze the spread of an epidemic on a general directed and locally finite graph. We assign a two-dimensional random weight vector to each vertex of the graph in such a way that the weights of different vertices are independent and...

- TYPICAL DISTANCES IN ULTRASMALL RANDOM NETWORKS. Dereich, Steffen; Monch, Christian; Morters, Peter // Advances in Applied Probability;Jun2012, Vol. 44 Issue 2, p583
Abstract We show that in preferential attachment models with power-law exponent Ï„ Îµ (2, 3) the distance between randomly chosen vertices in the giant component is asymptotically equal to (4 + o(1)) log log N/(- log(Ï„ - 2)), where N denotes the number of nodes. This is twice the value...

- A novel approach to a transport model for ultra-small-scale compound semiconductor devices. Cheng, Ming-C.; Huang, Lin // Journal of Applied Physics;10/15/1992, Vol. 72 Issue 8, p3539
Focuses on a study which developed a macrokinetic distribution function model for ultra-small-scale compound semiconductor devices. Significance of the momentum dependence of the macroscopic effective mass; Discussion on the multivalley moment equations; Physical interpretations of the...

- Numerical modeling of the solar wind turbulence. Kryukov, I.A.; Pogorelov, N.V.; Zank, G.P.; Borovikov, S.N. // AIP Conference Proceedings;5/21/2012, Vol. 1436 Issue 1, p48
We describe an extension of the Multi-Scale Fluid-Kinetic Simulation Suite (MSFLUKSS) by adding a solar wind turbulence model and a fluid treatment of pickup ions. Numerical results are presented of the time-dependent solar wind modeling with the boundary conditions provided by the OMNI data....

- The Complexity of Explicit Constructions. Santhanam, Rahul // Theory of Computing Systems;Oct2012, Vol. 51 Issue 3, p297
The existence of extremal combinatorial objects, such as Ramsey graphs and expanders, is often shown using the probabilistic method. It is folklore that pseudo-random generators can be used to obtain explicit constructions of these objects, if the test that the object is extremal can be...

- Object Modeling with Color Arrangement for Region-Based Tracking. Dae-Hwan Kim; Seung-Won Jung; Suryanto; Seung-Jun Lee; Hyo-Kak Kim; Sung-Jea Ko // ETRI Journal;Jun2012, Vol. 34 Issue 3, p399
In this paper, we propose a new color histogram model for object tracking. The proposed model incorporates the color arrangement of the target that encodes the relative spatial distribution of the colors inside the object. Using the color arrangement, we can determine which color bin is more...

- BRANCHES IN RANDOM RECURSIVE Îº-ARY TREES. JAVANIAN, M.; VAHIDI-ASL, M. Q. // Bulletin of the Iranian Mathematical Society;Jul2012, Vol. 38 Issue 2, p323
Using the generalized PÃ³lya urn models, we find the expected value of the size of a branch in recursive Îº-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.