Searcharxiv⌕ Search

arXiv subjects

Liang Li

Publications and source records attributed to Liang Li.

402 records · Page 23Linked to original sources

Optimizing transport efficiency on scale-free networks through assortative or dissortative topology

We find that transport on scale-free random networks depends strongly on degree-correlated network topologies whereas transport on Erd$\ddot{o}$s-R$\acute{e}$nyi networks is insensitive to the degree correlation. An approach for the tuning of scale-free network transport efficiency through assortative or dissortative topology is proposed. We elucidate that the unique transport behavior for scale-free networks results from the heterogeneous distribution of degrees.

cond-mat.stat-mech↗

Observation of Single Top Quark Production at D0

This paper presents the observation of the electroweak production of single top quarks in the D0 detector at the Fermilab Tevatron Collider at a center-of-mass energy of 1.96 TeV. Events containing an isolated electron or muon and missing transverse energy, together with jets originating from the fragmentation of b quarks are used to measure a cross section for single top quark production of sigma(ppbar -> tb + X, tqb + X) = 3.94 +- 0.88 pb. The probability to measure a cross section at this value or higher in the absence of signal is 2.5X10^-7, corresponding to a 5.0 standard deviation significance.

hep-ex↗

Exact phase transition of backtrack-free search with implications on the power of greedy algorithms

Backtracking is a basic strategy to solve constraint satisfaction problems (CSPs). A satisfiable CSP instance is backtrack-free if a solution can be found without encountering any dead-end during a backtracking search, implying that the instance is easy to solve. We prove an exact phase transition of backtrack-free search in some random CSPs, namely in Model RB and in Model RD. This is the first time an exact phase transition of backtrack-free search can be identified on some random CSPs. Our technical results also have interesting implications on the power of greedy algorithms, on the width of random hypergraphs and on the exact satisfiability threshold of random CSPs.

cs.AI↗

Persistent Cell Motion in the Absence of External Signals: A Search Strategy for Eukaryotic Cells

Eukaryotic cells are large enough to detect signals and then orient to them by differentiating the signal strength across the length and breadth of the cell. Amoebae, fibroblasts, neutrophils and growth cones all behave in this way. Little is known however about cell motion and searching behavior in the absence of a signal. Is individual cell motion best characterized as a random walk? Do individual cells have a search strategy when they are beyond the range of the signal they would otherwise move toward? Here we ask if single, isolated, Dictyostelium and Polysphondylium amoebae bias their motion in the absence of external cues. We placed single well-isolated Dictyostelium and Polysphondylium cells on a nutrient-free agar surface and followed them at 10 sec intervals for ~10 hr, then analyzed their motion with respect to velocity, turning angle, persistence length, and persistence time, comparing the results to the expectation for a variety of different types of random motion. We find that amoeboid behavior is well described by a special kind of random motion: Amoebae show a long persistence time (~10 min) beyond which they start to lose their direction; they move forward in a zig-zag manner; and they make turns every 1-2 min on average. They bias their motion by remembering the last turn and turning away from it. Interpreting the motion as consisting of runs and turns, the duration of a run and the amplitude of a turn are both found to be exponentially distributed. We show that this behavior greatly improves their chances of finding a target relative to performing a random walk. We believe that other eukaryotic cells may employ a strategy similar to Dictyostelium when seeking conditions or signal sources not yet within range of their detection system.

q-bio.CB↗

From k-SAT to k-CSP: Two Generalized Algorithms

Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bounds on running time for restricted SAT with bounded clause length k (k-SAT) can be classified into three styles: DPLL-like, PPSZ-like and Local Search, with local search algorithms having already been generalized to CSP with bounded constraint arity k (k-CSP). We generalize a DPLL-like algorithm in its simplest form and a PPSZ-like algorithm from k-SAT to k-CSP. As far as we know, this is the first attempt to use PPSZ-like strategy to solve k-CSP, and before little work has been focused on the DPLL-like or PPSZ-like strategies for k-CSP.

cs.DS↗

Hierarchical structure description of spatiotemporal chaos

We develop a hierarchical structure (HS) analysis for quantitative description of statistical states of spatially extended systems. Examples discussed here include an experimental reaction-diffusion system with Belousov-Zhabotinsky kinetics, the two-dimensional complex Ginzburg-Landau equation and the modified FitzHugh-Nagumon equation, which all show complex dynamics of spirals and defects. We demonstrate that the spatial-temporal fluctuation fields in the above mentioned systems all display the HS similarity property originally proposed for the study of fully developed turbulence [Z.-S. She and E. Leveque, Phys. Rev. Lett. {\bf 72}, 336 (1994)]. The derived values of a HS parameter $β$ from experimental and numerical data in various physical regimes exhibit consistent trends and characterize the degree of turbulence in the systems near the transition, and the degree of heterogeneity of multiple disorders far from the transition. It is suggested that the HS analysis offers a useful quantitative description for the complex dynamics of two-dimensional spatiotemporal patterns.

nlin.PS↗