Open Contents
주제분야

arXivModular forms from NoetherLefschetz theory François Greer 20171231 We enumerate smooth rational curves on very general Weierstrass fibrations over hypersurfaces in projective space. The generating functions for these numbers lie in the ring of classical modular forms. The method of proof uses topological intersection products on a period stack and the cohomological theta correspondence of Kudla and Millson for special cycles on a locally symmetric space of orthogonal type. The results here apply only in base degree 1, but heuristics for higher base degree match predictions from the topological string partition function.
Subject 수학 Source arXiv URL https://arxiv.org/abs/1801.00375view Article Title Modular forms from NoetherLefschetz theoryAuthors François GreerAbstract We enumerate smooth rational curves on very general Weierstrass fibrations over hypersurfaces in projective space. The generating functions for these numbers lie in the ring of classical modular forms. The method of proof uses topological intersection products on a period stack and the cohomological theta correspondence of Kudla and Millson for special cycles on a locally symmetric space of orthogonal type. The results here apply only in base degree 1, but heuristics for higher base degree match predictions from the topological string partition function.Is Part Of Alg. Number Th. 14 (2020) 23352368 20171231 Identifier ISSN: DOI 10.2140/ant.2020.14.2335Category math.AGLicense 
arXivDistributed Observers Design for LeaderFollowing Control of MultiAgent Networks (Extended Version) Yiguang Hong, Guanrong Chen, Linda Bushnell... more(3) 20171231 This paper is concerned with a leaderfollower problem for a multiagent system with a switching interconnection topology. Distributed observers are designed for the secondorder followeragents, under the common assumption that the velocity of the active leader cannot be measured in real time. Some dynamic neighborbased rules, consisting of distributed controllers and observers for the autonomous agents, are developed to keep updating the information of the leader. With the help of an explicitly constructed common Lyapunov function (CLF), it is proved that each agent can follow the active leader. Moreover, the tracking error is estimated even in a noisy environment. Finally, a numerical example is given for illustration.
Subject 수학 Source arXiv URL https://arxiv.org/abs/1801.00258view Article Title Distributed Observers Design for LeaderFollowing Control of MultiAgent Networks (Extended Version)Authors Yiguang Hong; Guanrong Chen; Linda BushnellAbstract This paper is concerned with a leaderfollower problem for a multiagent system with a switching interconnection topology. Distributed observers are designed for the secondorder followeragents, under the common assumption that the velocity of the active leader cannot be measured in real time. Some dynamic neighborbased rules, consisting of distributed controllers and observers for the autonomous agents, are developed to keep updating the information of the leader. With the help of an explicitly constructed common Lyapunov function (CLF), it is proved that each agent can follow the active leader. Moreover, the tracking error is estimated even in a noisy environment. Finally, a numerical example is given for illustration.Is Part Of 20171231 Identifier ISSN: Category math.OCLicense 
Springer NatureGateway or Garrison? Border Regions in Times of Geopolitical Crisis Blakkisrud, Helge, Wilson Rowe, Elana Springer 20171231 AbstractRussia’s border regions have had moments as open ‘gateways’ to cooperation. More often, however, the border has been viewed as a ‘garrison’: an outpost of state power. This chapter places the Russian Far East in the broader context of Russia’s pursuit of economic development and security concerns, noting that Russian foreign policy is not necessarily uniform: there are elements of compartmentalization/disaggregation along geographical vectors. The chapter broaches the question that informs all case studies in this volume: has Russia intensified its diplomatic and economic outreach to its eastern border areas and beyond because of the recent breakdown in relations with the West—or would such a shift have taken place anyway, given the economic pull of the AsiaPacific region?
Subject Source Springer Nature URL http://dx.doi.org/10.1007/9783319697901_1view Article Title Gateway or Garrison? Border Regions in Times of Geopolitical CrisisAuthors Blakkisrud, Helge; Wilson Rowe, ElanaAbstract AbstractRussia’s border regions have had moments as open ‘gateways’ to cooperation. More often, however, the border has been viewed as a ‘garrison’: an outpost of state power. This chapter places the Russian Far East in the broader context of Russia’s pursuit of economic development and security concerns, noting that Russian foreign policy is not necessarily uniform: there are elements of compartmentalization/disaggregation along geographical vectors. The chapter broaches the question that informs all case studies in this volume: has Russia intensified its diplomatic and economic outreach to its eastern border areas and beyond because of the recent breakdown in relations with the West—or would such a shift have taken place anyway, given the economic pull of the AsiaPacific region?Is Part Of Russia's Turn to the East 20171231 Identifier EISSN: null ; PISSN: DOI 10.1007/9783319697901_1Publisher SpringerLicense ©2018 The Editor(s) (if applicable) and The Author(s) 
arXivButterfly Counting in Bipartite Networks SeyedVahid SaneiMehri, Ahmet Erdem Sariyuce, Srikanta Tirthapura... more(3) 20171231 We consider the problem of counting motifs in bipartite affiliation networks, such as authorpaper, userproduct, and actormovie relations. We focus on counting the number of occurrences of a "butterfly", a complete $2 \times 2$ biclique, the simplest cohesive higherorder structure in a bipartite graph. Our main contribution is a suite of randomized algorithms that can quickly approximate the number of butterflies in a graph with a provable guarantee on accuracy. An experimental evaluation on large realworld networks shows that our algorithms return accurate estimates within a few seconds, even for networks with trillions of butterflies and hundreds of millions of edges.
Subject Source arXiv URL https://arxiv.org/abs/1801.00338view Article Title Butterfly Counting in Bipartite NetworksAuthors SeyedVahid SaneiMehri; Ahmet Erdem Sariyuce; Srikanta TirthapuraAbstract We consider the problem of counting motifs in bipartite affiliation networks, such as authorpaper, userproduct, and actormovie relations. We focus on counting the number of occurrences of a "butterfly", a complete $2 \times 2$ biclique, the simplest cohesive higherorder structure in a bipartite graph. Our main contribution is a suite of randomized algorithms that can quickly approximate the number of butterflies in a graph with a provable guarantee on accuracy. An experimental evaluation on large realworld networks shows that our algorithms return accurate estimates within a few seconds, even for networks with trillions of butterflies and hundreds of millions of edges.Is Part Of 20171231 Identifier ISSN: Category cs.DMLicense 
arXivCardinal characteristics of the continuum and partitions William Chen, Shimon Garti, Thilo Weinert... more(3) 20171231 We prove combinatorial theorems concerning the stick principle and cardinal characteristics.
Subject 수학 Source arXiv URL https://arxiv.org/abs/1801.00238view Article Title Cardinal characteristics of the continuum and partitionsAuthors William Chen; Shimon Garti; Thilo WeinertAbstract We prove combinatorial theorems concerning the stick principle and cardinal characteristics.Is Part Of Israel Journal of Mathematics, vol. 235 (2020), pp. 1338 20171231 Identifier ISSN: DOI 10.1007/s118560191942yCategory math.LOLicense 
arXivViscoelastic Theory Representation Of Gravitational Strain Fields In The ${}^+\Lambda$CDM Vacuum Ronald Gamble Jr, K. M. Flurchick 20171231 In recent years, investigations of gravitational interactions has led us to discover new facets of the fundamental force. With these discoveries the general theory of relativity is under greater scrutiny now than it was 100 years ago. Development of a more advanced theory is needed for experimental tests and extensive predictions of gravitational interactions in local and cosmological settings. In this work, we present axioms of a novel theory that describes spacetime as a relativistic viscoelastic continuum; retaining the properties of the natural ${}^{+}\Lambda$CDM vacuum. With these axioms, we provide a foundation for a tensor field theory of Gravitational Strain; introduced as an advanced formulation of an elastic interpretation of gravitational interactions. This viscoelastic definition of gravity is a natural advancement of general relativity to an observable measure of a proper relativistic gravitational field.
Subject Source arXiv URL https://arxiv.org/abs/1801.00350view Article Title Viscoelastic Theory Representation Of Gravitational Strain Fields In The ${}^+\Lambda$CDM VacuumAuthors Ronald Gamble Jr; K. M. FlurchickAbstract In recent years, investigations of gravitational interactions has led us to discover new facets of the fundamental force. With these discoveries the general theory of relativity is under greater scrutiny now than it was 100 years ago. Development of a more advanced theory is needed for experimental tests and extensive predictions of gravitational interactions in local and cosmological settings. In this work, we present axioms of a novel theory that describes spacetime as a relativistic viscoelastic continuum; retaining the properties of the natural ${}^{+}\Lambda$CDM vacuum. With these axioms, we provide a foundation for a tensor field theory of Gravitational Strain; introduced as an advanced formulation of an elastic interpretation of gravitational interactions. This viscoelastic definition of gravity is a natural advancement of general relativity to an observable measure of a proper relativistic gravitational field.Is Part Of 20171231 Identifier ISSN: Category grqcLicense 
arXivGoldstone Modes and ClebschGordan Coefficients XianZheng Bai, Deshan Yang, DaXin Zhang... more(3) 20171231 We solve explicitly the Goldstone modes in spontaneously symmetry breaking models with supersymmetry. We find that, when more than one fields or representations contribute to the symmetry breaking, there exist identities among the ClebschGordan coefficients which can be used as consistent checks on the calculations.
Subject Source arXiv URL https://arxiv.org/abs/1801.00300view Article Title Goldstone Modes and ClebschGordan CoefficientsAuthors XianZheng Bai; Deshan Yang; DaXin ZhangAbstract We solve explicitly the Goldstone modes in spontaneously symmetry breaking models with supersymmetry. We find that, when more than one fields or representations contribute to the symmetry breaking, there exist identities among the ClebschGordan coefficients which can be used as consistent checks on the calculations.Is Part Of 20171231 Identifier ISSN: DOI 10.1016/j.nuclphysb.2018.10.014Category hepph nuclthLicense 
arXivTo Wait or Not to Wait: Twoway Functional Hazards Model for Understanding Waiting in Call Centers Gen Li, Jianhua Z. Huang, Haipeng Shen... more(3) 20171231 Telephone call centers offer a convenient communication channel between businesses and their customers. Efficient management of call centers needs accurate modeling of customer waiting behavior, which contains important information about customer patience (how long a customer is willing to wait) and service quality (how long a customer needs to wait to get served). Hazard functions offer dynamic characterization of customer waiting behavior, and provide critical inputs for agent scheduling. Motivated by this application, we develop a twoway functional hazards (tFHazards) model to study customer waiting behavior as a function of two timescales, waiting duration and the time of day that a customer calls in. The model stems from a twoway piecewise constant hazard function, and imposes lowrank structure and smoothness on the hazard rates to enhance interpretability. We exploit an alternating direction method of multipliers (ADMM) algorithm to optimize a penalized likelihood function of the model. We carefully analyze the data from a US bank call center, and provide informative insights about customer patience and service quality patterns along waiting time and across different times of a day. The findings provide primitive inputs for call center agent staffing and scheduling, as well as for call center practitioners to understand the effect of system protocols on customer waiting behavior.
Subject Source arXiv URL https://arxiv.org/abs/1801.00344view Article Title To Wait or Not to Wait: Twoway Functional Hazards Model for Understanding Waiting in Call CentersAuthors Gen Li; Jianhua Z. Huang; Haipeng ShenAbstract Telephone call centers offer a convenient communication channel between businesses and their customers. Efficient management of call centers needs accurate modeling of customer waiting behavior, which contains important information about customer patience (how long a customer is willing to wait) and service quality (how long a customer needs to wait to get served). Hazard functions offer dynamic characterization of customer waiting behavior, and provide critical inputs for agent scheduling. Motivated by this application, we develop a twoway functional hazards (tFHazards) model to study customer waiting behavior as a function of two timescales, waiting duration and the time of day that a customer calls in. The model stems from a twoway piecewise constant hazard function, and imposes lowrank structure and smoothness on the hazard rates to enhance interpretability. We exploit an alternating direction method of multipliers (ADMM) algorithm to optimize a penalized likelihood function of the model. We carefully analyze the data from a US bank call center, and provide informative insights about customer patience and service quality patterns along waiting time and across different times of a day. The findings provide primitive inputs for call center agent staffing and scheduling, as well as for call center practitioners to understand the effect of system protocols on customer waiting behavior.Is Part Of 20171231 Identifier ISSN: Category stat.APLicense 
arXivEstimating symplectic capacities from lengths of closed curves on the unit spheres Arseniy Akopyan, Roman Karasev 20171231 We improve the estimates for the EkelandHoferZehnder capacity of convex bodies by Gluskin and Ostrover. In the course of our argument we show that a closed characteristic of minimal action on the boundary of a centrally symmetric convex body in $\mathbb R^{2n}$ must itself be centrally symmetric, with generalizations to some other types of symmetry.
Subject 수학 Source arXiv URL https://arxiv.org/abs/1801.00242view Article Title Estimating symplectic capacities from lengths of closed curves on the unit spheresAuthors Arseniy Akopyan; Roman KarasevAbstract We improve the estimates for the EkelandHoferZehnder capacity of convex bodies by Gluskin and Ostrover. In the course of our argument we show that a closed characteristic of minimal action on the boundary of a centrally symmetric convex body in $\mathbb R^{2n}$ must itself be centrally symmetric, with generalizations to some other types of symmetry.Is Part Of 20171231 Identifier ISSN: Category math.MG math.SGLicense 
arXivConfidence set for group membership Andreas Dzemski, Ryo Okui 20171231 Our confidence set quantifies the statistical uncertainty from datadriven cluster assignment in clustered panel models. It covers the true cluster memberships jointly for all units with prespecified probability and is constructed by inverting many simultaneous unitspecific onesided tests for group membership. We justify our approach under $N, T \to \infty$ asymptotics using tools from highdimensional statistics, some of which we extend or develop in this paper. We provide an empirical application as well as Monte Carlo evidence that the confidence set has adequate coverage in finite samples.
Subject Source arXiv URL https://arxiv.org/abs/1801.00332view Article Title Confidence set for group membershipAuthors Andreas Dzemski; Ryo OkuiAbstract Our confidence set quantifies the statistical uncertainty from datadriven cluster assignment in clustered panel models. It covers the true cluster memberships jointly for all units with prespecified probability and is constructed by inverting many simultaneous unitspecific onesided tests for group membership. We justify our approach under $N, T \to \infty$ asymptotics using tools from highdimensional statistics, some of which we extend or develop in this paper. We provide an empirical application as well as Monte Carlo evidence that the confidence set has adequate coverage in finite samples.Is Part Of 20171231 Identifier ISSN: Category econ.EM stat.MELicense