Jamming and fluctuations in granular drag

We investigate the dynamic evolution of jamming in granular media through fluctuations in the granular drag force. The successive collapse and formation of jammed states give a stick-slip nature to the fluctuations which is independent of the contact surface between the grains and the dragged object, thus implying that the stress-induced collapse is nucleated in the bulk of the granular sample. We also find that while the fluctuations are periodic at small depths, they become "stepped" at large depths, a transition which we interpret as a consequence of the long-range nature of the force chains.     

Disease spreading on fitness-rewired complex networks

As people travel, human contact networks may change topologically from time to time. In this paper, we study the problem of epidemic spreading on this kind of dynamic network, specifically the one in which the rewiring dynamics of edges are carried out to preserve the degree of each node (called fitness rewiring). We also consider the adaptive rewiring of edges, which encourages disconnections from and discourages connections to infected nodes and eventually leads to the isolation of the infected from the susceptible with only a small number of links between them. We find that while the threshold of epidemic spreading remains unchanged and prevalence increases in the fitness rewiring dynamics, meeting of the epidemic threshold is delayed and prevalence is reduced (if adaptive dynamics are included). To understand these different behaviors, we introduce a new measure called the “mean change of effective links” and find that creation and deletion of pathways for pathogen transmission are the dominant factors in fitness and adaptive rewiring dynamics, respectively.     

Scale-free random graphs and Potts model

We introduce a simple algorithm that constructs scale-free random graphs efficiently: each vertexi has a prescribed weight P_i ∝ i^-μ (0 < μ< 1) and an edge can connect verticesi andj with rateP _i P _j . Corresponding equilibrium ensemble is identified and the problem is solved by theq → 1 limit of the q-state Potts model with inhomogeneous interactions for all pairs of spins. The number of loops as well as the giant cluster size and the mean cluster size are obtained in the thermodynamic limit as a function of the edge density. Various critical exponents associated with the percolation transition are also obtained together with finite-size scaling forms. The process of forming the giant cluster is qualitatively different between the cases of λ > 3 and 2 < λ < 3, whereλ = 1 +μ ^-1 is the degree distribution exponent. While for the former, the giant cluster forms abruptly at the percolation transition, for the latter, however, the formation of the giant cluster is gradual and the mean cluster size for finiteN shows double peaks.     

Asymmetric Binary Covering Codes

An asymmetric binary covering code of length n and radius R is a subset of the n-cube Q_n such that every vector xQ_n can be obtained from some vector c by changing at most R 1's of c to 0's, where R is as small as possible. K⁺(n,R) is defined as the smallest size of such a code. We show K⁺(n,R)Θ(2ⁿ/n^R) for constant R, using an asymmetric sphere-covering bound and probabilistic methods. We show K⁺(n,n− )= +1 for constant coradius iff n ( +1)/2. These two results are extended to near-constant R and , respectively. Various bounds on K⁺ are given in terms of the total number of 0's or 1's in a minimal code. The dimension of a minimal asymmetric linear binary code ([n,R]⁺-code) is determined to be min{0,n−R}. We conclude by discussing open problems and techniques to compute explicit values for K⁺, giving a table of best-known bounds.     

Skeleton and fractal scaling in complex networks

We find that the fractal scaling in a class of scale-free networks originates from the underlying tree structure called a skeleton, a special type of spanning tree based on the edge betweenness centrality. The fractal skeleton has the property of the critical branching tree. The original fractal networks are viewed as a fractal skeleton dressed with local shortcuts. An in silico model with both the fractal scaling and the scale-invariance properties is also constructed. The framework of fractal networks is useful in understanding the utility and the redundancy in networked systems.     

Spectral partitioning with multiple eigenvectors

The graph partitioning problem is to divide the vertices of a graph into disjoint clusters to minimize the total cost of the edges cut by the clusters. A spectral partitioning heuristic uses the graph's eigenvectors to construct a geometric representation of the graph (e.g., linear orderings) which are subsequently partitioned. Our main result shows that when all the eigenvectors are used, graph partitioning reduces to a new vector partitioning problem. This result implies that as many eigenvectors as are practically possible should be used to construct a solution. This philosophy is in contrast to that of the widely used spectral bipartitioning (SB) heuristic (which uses only a single eigenvector) and several previous multi-way partitioning heuristics [8, 11, 17, 27, 38] (which use k eigenvectors to construct k-way partitionings). Our result motivates a simple ordering heuristic that is a multiple-eigenvector extension of SB. This heuristic not only significantly outperforms recursive SB, but can also yield excellent multi-way VLSI circuit partitionings as compared to [1, 11]. Our experiments suggest that the vector partitioning perspective opens the door to new and effective partitioning heuristics. The present paper updates and improves a preliminary version of this work [5].     

The Larson–Sweedler theorem for weak multiplier Hopf algebras

The Larson–Sweedler theorem says that a finite-dimensional bialgebra with a faithful integral is a Hopf algebra [15 Larson, R. G., Sweedler, M. E. (1969). An associative orthogonal bilinear form for Hopf algebras. Amer. J. Math. 91:75–93.[Crossref], [Web of Science ®] , [Google Scholar]]. The result has been generalized to finite-dimensional weak Hopf algebras by Vecsernyés [44 Vecsernyés, P. (2003). Larson–Sweedler theorem and the role of grouplike elements in weak Hopf algebras. J. Algebra 270:471–520. See also arXiv: 0111045v3 [math.QA] for an extended version.[Crossref], [Web of Science ®] , [Google Scholar]]. In this paper, we show that the result is still true for weak multiplier Hopf algebras. The notion of a weak multiplier bialgebra was introduced by Böhm et al. in [4 Böhm, G., Gómez-Torecillas, J., López-Centella, E. (2015). Weak multiplier bialgebras. Weak multiplier bialgebras. 367(12):8681–8872. See also arXiv: 1306.1466 [math.QA]. [Google Scholar]]. In this note it is shown that a weak multiplier bialgebra with a regular and full coproduct is a regular weak multiplier Hopf algebra if there is a faithful set of integrals. Weak multiplier Hopf algebras are introduced and studied in [40 Van Daele, A., Wang, S. (2015). Weak multiplier Hopf algebras I. The main theory. J. Ange. Math. (Crelles J.) 705:155–209, ISSN (Online) 1435-5345, ISSN (Print) 0075-4102, DOI: 10.1515/crelle-2013-0053, July 2013. See also arXiv:1210.4395v1 [math.RA].[Web of Science ®] , [Google Scholar]]. Integrals on (regular) weak multiplier Hopf algebras are treated in [43 Van Daele, A., Wang, S. (2016). Weak multiplier Hopf algebras III. Integrals and duality. Preprint University of Leuven (Belgium) and Southeast University of Nanjing (China), See arXiv: 1701.04951.v3 [math.RA]. [Google Scholar]]. This result is important for the development of the theory of locally compact quantum groupoids in the operator algebra setting, see [13 Kahng, B.-J., Van Daele, A. A class of C*-algebraic locally compact quantum groupoids I. Preprint Canisius College Buffalo (USA) and University of Leuven (Belgium). [Google Scholar]] and [14 Kahng, B.-J., Van Daele, A. A class of C*-algebraic locally compact quantum groupoids II. Preprint Canisius College Buffalo (USA) and University of Leuven (Belgium). [Google Scholar]]. Our treatment of this material is motivated by the prospect of such a theory.